{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:24:42Z","timestamp":1742379882492},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_42","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:37:58Z","timestamp":1330295878000},"page":"113-128","source":"Crossref","is-referenced-by-count":42,"title":["Straight-line drawing algorithms for hierarchical graphs and clustered graphs"],"prefix":"10.1007","author":[{"given":"Peter","family":"Eades","sequence":"first","affiliation":[]},{"given":"Qing-Wen","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science, 61:175\u2013198, 1988.","journal-title":"Theoretical Computer Science"},{"key":"10_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. North-Holland, New York, N.Y., 1976."},{"key":"10_CR3","unstructured":"P. Eades and K. Sugiyama. How to draw a directed graph. Journal of Information Processing, 424\u2013437, 1991."},{"key":"10_CR4","volume-title":"Technical Report 96-04","author":"P. Eades","year":"1996","unstructured":"Peter Eades and Qing-Wen Feng. Orthogonal grid drawing of clustered graphs. Technical Report 96-04, Department of Computer Science, The University of Newcastle, Australia, 1996."},{"key":"10_CR5","unstructured":"Peter D. Eades, Xuemin Lin, and Roberto Tamassia. An algorithm for drawing a hierarchical graph. International Journal of Computational Geometry and Applications, 1995."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"S. Even and R. E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2:339\u2013344, 1976.","journal-title":"Theoretical Computer Science"},{"key":"10_CR7","first-page":"229","volume":"11","author":"I. Fary","year":"1948","unstructured":"I. Fary. On straight lines representation of planar graphs. Acta Sci. Math. Szeged., 11:229\u2013233, 1948.","journal-title":"Acta Sci. Math. Szeged."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Qing-Wen Feng, Robert F. Cohen, and Peter Eades. How to draw a planar clustered graph. In COCOON'95, volume 959 of Lecture Notes in Computer Science, pages 21\u201331. Springer-Verlag, 1995.","DOI":"10.1007\/BFb0030816"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Qing-Wen Feng, Robert F. Cohen, and Peter Eades. Planarity for clustered graphs. In ESA'95, volume 979 of Lecture Notes in Computer Science, pages 213\u2013226. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60313-1_145"},{"issue":"11","key":"10_CR10","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1002\/spe.4380181104","volume":"18","author":"E.R. Gansner","year":"1988","unstructured":"E.R. Gansner, S.C. North, and K.P. Vo. Dag \u2014 a program that draws directed graphs. Software \u2014 Practice and Experience, 18(11):1047\u20131062, 1988.","journal-title":"Software \u2014 Practice and Experience"},{"issue":"5","key":"10_CR11","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/42411.42414","volume":"31","author":"D. Harel","year":"1988","unstructured":"D. Harel. On visual formalisms. Communications of the ACM, 31(5):514\u2013530, 1988.","journal-title":"Communications of the ACM"},{"key":"10_CR12","volume-title":"PhD thesis","author":"W. Lai","year":"1993","unstructured":"Wei Lai. Building Interactive Digram Applications. PhD thesis, Department of Computer Science, University of Newcastle, Callaghan, New South Wales, Australia, 2308, June 1993."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1145\/65950.65952","volume":"36","author":"T. Lengauer","year":"1989","unstructured":"Thomas Lengauer. Hierarchical planarity testing algorithms. Journal of ACM, 36:474\u2013509, 1989.","journal-title":"Journal of ACM"},{"key":"10_CR14","volume-title":"PhD thesis","author":"X. Lin","year":"1992","unstructured":"Xuemin Lin. Analysis of Algorithms for Drawing Graphs. PhD thesis, Department of Computer Science, University of Queensland, Australia, 1992."},{"key":"10_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: an introduction","author":"F. P. Preparata","year":"1985","unstructured":"Franco P. Preparata and Michael I. Shamos. Computational geometry: an introduction. Springer-Verlag, New York, 1985."},{"key":"10_CR16","unstructured":"R. Read. Methods for computer display and manipulation of graphs and the corresponding algorithms. Technical Report 86-12, Faculty of Mathematics, Univ. of Waterloo, July 1986."},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1090\/S0002-9939-1951-0041425-5","volume":"2","author":"S.K. Stein","year":"1951","unstructured":"S.K. Stein. Convex maps. Proceedings American Mathematical Society, 2:464\u2013466, 1951.","journal-title":"Proceedings American Mathematical Society"},{"issue":"4","key":"10_CR18","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1109\/21.108304","volume":"21","author":"K. Sugiyama","year":"1991","unstructured":"K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man and Cybernetics, 21(4):876\u2013892, 1991.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"2","key":"10_CR19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC-11","author":"K. Sugiyama","year":"1981","unstructured":"K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Transactions on Systems, Man and Cybernetics, SMC-11(2):109\u2013125, 1981.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"13","key":"10_CR20","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"3","author":"W.T. Tutte","year":"1963","unstructured":"W.T. Tutte. How to draw a graph. Proceedings London Mathematical Society, 3(13):743\u2013768, 1963.","journal-title":"Proceedings London Mathematical Society"},{"key":"10_CR21","first-page":"26","volume":"46","author":"K. Wagner","year":"1936","unstructured":"K. Wagner. Bemerkungen zum vierfarbenproblem. Jber. Deutsch. Math.-Verein, 46:26\u201332, 1936.","journal-title":"Jber. Deutsch. Math.-Verein"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62495-3_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:12:50Z","timestamp":1605647570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}