{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:55:15Z","timestamp":1742399715560},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433095"},{"type":"electronic","value":"9783540458487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45848-4_19","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T10:47:53Z","timestamp":1186829273000},"page":"232-246","source":"Crossref","is-referenced-by-count":13,"title":["Online Hierarchical Graph Drawing"],"prefix":"10.1007","author":[{"given":"Stephen C.","family":"North","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gordon","family":"Woodhull","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"key":"19_CR1","unstructured":"Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph Drawing: algorithms for the visualization of graphs. Prentice-Hall, 1999."},{"key":"19_CR2","series-title":"Lect Notes Comput Sci","first-page":"37","volume-title":"Area-efficient static and incremental graph drawings","author":"T. Bield","year":"1997","unstructured":"Therese Bield and Michael Kaufmann. Area-efficient static and incremental graph drawings. In Proc. 5th European Symposium on Algorithms (ESA\u201997), volume 1284 of Lecture Notes in Computer Science, pages 37\u201352. Springer-Verlag, 1997."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"K. Bohringer and F. Newbery Paulisch. Using constraints to acheive stability in automatic graph layout algorithms. In Proceedings of ACM CHI\u201990, pages 43\u201351, 1990.","DOI":"10.1145\/97243.97250"},{"key":"19_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-63938-1_73","volume-title":"Graph Drawing \u203497","author":"S. S. Bridgeman","year":"1998","unstructured":"S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara. Interactive Giotto: An algorithm for interactive orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing \u203497, volume 1353 of Lecture Notes in Computer Science, pages 303\u2013308, Rome, Italy, 1998. Springer-Verlag."},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","first-page":"217","volume-title":"Graph Drawing \u203499","author":"R. Schonfeld","year":"2000","unstructured":"R. Schonfeld C. Matuszewski and P. Molitor. Using sifting for k-layer crossing minimization. In Jan Kratochv\u00edl, editor, Graph Drawing \u203499, volume 1731 of Lecture Notes in Computer Science, pages 217\u2013224. Springer-Verlag, 2000."},{"issue":"11","key":"19_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/264645.264657","volume":"4","author":"J. Cohen","year":"1997","unstructured":"J. Cohen. Drawing graphs to convey proximity: an incremental arrangement method. ACM Trans. on Computer-Human Interfaces, 4(11):197\u2013229, 1997.","journal-title":"ACM Trans. on Computer-Human Interfaces"},{"key":"19_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Graph Drawing \u203497","author":"D. Dobkin","year":"1998","unstructured":"D. Dobkin, E. Gansner, E. Koutsofios, and S. North. Implementing a generalpurpose edge router. In G. Di Battista, editor, Graph Drawing \u203497, volume 1353 of Lecture Notes in Computer Science, Rome, Italy, 1998. Springer-Verlag."},{"key":"19_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/3-540-45678-3","volume-title":"Graph Drawing \u203400","author":"P. Eades","year":"2001","unstructured":"P. Eades and C. Friedrich. The Marey graph animation tool demo. In Joe Marks, editor, Graph Drawing \u203400, volume 1984 of Lecture Notes in Computer Science, pages 396\u2013406. Springer-Verlag, 2001."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"P. Eades","year":"1995","unstructured":"P. Eades, W. Lai, K. Misue, and K. Sugiyama. Layout adjustment and the mental map. Journal of Visual Languages and Computing, 6:183\u2013210, 1995.","journal-title":"Journal of Visual Languages and Computing"},{"key":"19_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Graph Drawing\u2019 97","author":"P. Eades","year":"1998","unstructured":"Peter Eades, Robert F. Cohen, and Mao Lin Huang. Online animated graph drawing for web navigation. In G.Di Battista, editor, Graph Drawing\u2019 97, volume 1353 of Lecture Notes in Computer Science, Rome, Italy, 1998. Springer Verlag."},{"key":"19_CR11","unstructured":"J. Ellson and S. North. TclDG \u2014 a Tcl extension for dynamic graphs. In Proc. 4th USENIX Tcl\/Tk Workshop, pages 37\u201348, 1996."},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"E. R. Gansner","year":"1993","unstructured":"E. R. Gansner, E. Koutsofios, S. C. North, and K.-P. Vo. A technique for drawing directed graphs. IEEE Trans. Software Engineering, 19(3):214\u2013230, 1993.","journal-title":"IEEE Trans. Software Engineering"},{"key":"19_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-37623-2_29","volume-title":"Graph Drawing\u2019 98","author":"M. Huang","year":"1999","unstructured":"M. Huang and P. Eades. A fully animated interactive system for clustering and navigating huge graphs. In Sue H. Whitesides, editor, Graph Drawing\u2019 98, volume 1547 of Lecture Notes in Computer Science, pages 374\u2013383, Montreal, Canada, 1999. Springer-Verlag."},{"key":"19_CR14","unstructured":"Tamara Munzner. Interactive visualization of large graphs and networks. PhD thesis, Stanford University, 2000."},{"key":"19_CR15","series-title":"Lect Notes Comput Sci","first-page":"101","volume-title":"Graph Drawing\u2019 96","author":"A. Papakostas","year":"1997","unstructured":"A. Papakostas, J. M. Six, and I. G. Tollis. Experimental and theoretical results in interactive orthogonal graph drawing. In S.C. North, editor, Graph Drawing\u2019 96, volume 1190 of Lecture Notes in Computer Science, pages 101\u2013112, 1997."},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. on Systems, Man and Cybernetics, SMC-11(2):109\u2013125, 1981.","journal-title":"IEEE Trans. on Systems, Man and Cybernetics"},{"key":"19_CR17","unstructured":"G. Woodhull and S. North. Montage \u2014 an ActiveX container for dynamic interfaces. In Proc. 2nd USENIX Windows NT Symposium, 1998."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45848-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:28:22Z","timestamp":1556738902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45848-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433095","9783540458487"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45848-4_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}