{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:33:57Z","timestamp":1725489237668},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669043"},{"type":"electronic","value":"9783540466482"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46648-7_39","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:29:28Z","timestamp":1186892968000},"page":"379-391","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Infinite Trees and the Future"],"prefix":"10.1007","author":[{"given":"Camil","family":"Demetrescu","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Irene","family":"Finocchi","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Pizzonia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"39_CR1","unstructured":"Astra. Mercury international. \nhttp:\/\/www.merc-int.com\/\n\n."},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"U. Brandes and D. Wagner. A bayesian paradigm for dynamic graph layout. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Comput. Sci., pages 236\u2013247. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-63938-1_66"},{"issue":"5","key":"39_CR3","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539792235724","volume":"24","author":"R. F. Cohen","year":"1995","unstructured":"R. F. Cohen, G. Di Battista, R. Tamassia, and I. G. Tollis. Dynamic graph drawings: Trees, series-parallel digraphs, and planar ST-digraphs. SIAM J. Comput., 24(5):970\u20131001, 1995.","journal-title":"SIAM J. Comput."},{"key":"39_CR4","unstructured":"P. Crescenzi, C. Demetrescu, I. Finocchi, and R. Petreschi. Leonardo: a software visualization system. In G. Italiano and S. Orlando, editors, Workshop on Algorithm Engineering, pages 146\u2013155, 1997."},{"key":"39_CR5","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"key":"39_CR6","unstructured":"C. A. Duncan, M. Goodrich, and S. Kobourov. Balanced aspect ratio trees and their use for drawing very large graphs. In S. Whitesides,editor, Graph Drawing (Proc. GD\u2019 98), volume 1547 of Lecture Notes Comput. Sci., pages 384\u2013393. Springer-Verlag, 1999."},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"P. Eades, R. F. Cohen, and M. L. Huang. Online animated graph drawing for web navigation. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Comput. Sci., pages 330\u2013335. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_77"},{"key":"39_CR8","unstructured":"P. Eades, W. Lai, K. Misue, and K. Sugiyama. Preserving the mental map of a diagram. In Proceedings of Compugraphics 91, pages 24\u201333, 1991."},{"key":"39_CR9","unstructured":"T. R. Henry and S. E. Hudson. Viewing large graphs. Technical Report 90-13, Department of Computer Science, University of Arizona, 1990."},{"key":"39_CR10","unstructured":"Hyperbolic Tree. Inxight. \nhttp:\/\/www.hyperbolictree.com\/\n\n."},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"K. Kaugars, J. Reinfelds, and A. Brazma. A simple algorithm for drawing large graphs on small screens. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD\u2019 94), volume 894 of Lecture Notes Comput. Sci., pages 278\u2013281. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3_382"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"D. Kimelman, B. Leban, T. Roth, and D. Zernik. Reduction of visual complexity in dynamic graphs. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD\u2019 94), volume 894 of Lecture Notes Comput. Sci., pages 218\u2013225. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3_373"},{"issue":"1","key":"39_CR13","first-page":"1","volume":"SMC-21","author":"E. B. Messinger","year":"1991","unstructured":"E. B. Messinger, L. A. Rowe, and R. H. Henry. A divide-and-conquer algorithm for the automatic layout of large directed graphs. IEEE Trans. Syst. Man Cybern., SMC-21(1):1\u201312, 1991.","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"2","key":"39_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K. Misue","year":"1995","unstructured":"K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. J. Visual Lang. Comput., 6(2):183\u2013210, 1995.","journal-title":"J. Visual Lang. Comput."},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/52.56447","volume":"7","author":"S. Moen","year":"1990","unstructured":"S. Moen. Drawing dynamic trees. IEEE Softw., 7:21\u201328, 1990.","journal-title":"IEEE Softw."},{"issue":"4","key":"39_CR16","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/38.689657","volume":"8","author":"T. Munzner","year":"1998","unstructured":"T. Munzner. Exploring large graphs in 3d hyperbolic space. Comp. Graphics and its Applications, 8(4):18\u201323, 1998.","journal-title":"Comp. Graphics and its Applications"},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"T. Munzner. Drawing large graphs with h3viewer and site manager. In S. Whitesides, editor, Graph Drawing (Proc. GD\u2019 98), volume 1547 of Lecture Notes Comput. Sci., pages 384\u2013393. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-37623-2_30"},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"S. North. Incremental layout in DynaDAG. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes Comput. Sci., pages 409\u2013418. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021824"},{"issue":"2","key":"39_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"SE-7","author":"E. Reingold","year":"1981","unstructured":"E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Trans. Softw. Eng., SE-7(2):223\u2013228, 1981.","journal-title":"IEEE Trans. Softw. Eng."},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"G. J. Wills. NicheWorks-interactive visualization of very large graphs. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Comput. Sci., pages 403\u2013414. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_85"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46648-7_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T13:14:09Z","timestamp":1585919649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46648-7_39"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669043","9783540466482"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-46648-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"3 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}