{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:40:39Z","timestamp":1781217639134,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540433095","type":"print"},{"value":"9783540458487","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45848-4_5","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T14:47:53Z","timestamp":1186843673000},"page":"60-74","source":"Crossref","is-referenced-by-count":20,"title":["Planarization of Clustered Graphs"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Di Battista","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Marcandalli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"key":"5_CR1","unstructured":"AGD. A library of algorithms for graph drawing. Online. http:\/\/www.mpi-sb.mpg.de\/AGD\/ ."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum numbr of bends. IEEE Transactions on Computers, 49(8), 2000.","DOI":"10.1109\/12.868028"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"U. Brandes, S. Cornelsen, and D. Wagner. How to draw the minimum cuts of a planar graph. In J. Marks, editor, Graph Drawing (Proc. GD\u2019 00), volume 1984of Lecture Notes Comput. Sci., pages 103\u2013114. Springer-Verlag, 2000.","DOI":"10.1007\/3-540-44541-2_10"},{"key":"5_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Orthogonal and quasi-upward drawings with vertices of arbitrary size","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, W. Didimo, M. Patrignani, and M. Pizzonia. Orthogonal and quasi-upward drawings with vertices of arbitrary size. In Proc. GD\u2019 99, volume 1731 of LNCS, pages 297\u2013310, 2000."},{"key":"5_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","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":"5_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. TheoryAppl., 7:303\u2013325, 1997.","journal-title":"Comput. Geom. TheoryAppl."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"H. N. Djidjev. A linear algorithm for the maximal planar subgraph problem. In Proc. 4th Workshop Algorithms Data Struct., Lecture Notes Comput. Sci. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60220-8_77"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Planarity-preserving clustering and embedding for large planar graphs. In J. Kratochvil, editor, Graph Drawing (Proc. GD\u2019 99), volume 1731 of Lecture Notes Comput. Sci., pages 186\u2013196. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-46648-7_19"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"P. Eades and Q. W. Feng. Multilevel visualization of clustered graphs. In S. North, editor, Graph Drawing (Proc. GD\u2019 96), volume 1190 of Lecture Notes Comput. Sci., pages 101\u2013112. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-62495-3_41"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"P. Eades, Q. W. Feng, and X. Lin. Straight line drawing algorithms for hierarchical graphs and clustered graphs. In S. North, editor, Graph Drawing (Proc. GD\u2019 96), volume 1190 of Lecture Notes Comput. Sci., pages 113\u2013128. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-62495-3_42"},{"issue":"4","key":"5_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.7155\/jgaa.00016","volume":"3","author":"P. Eades","year":"2000","unstructured":"P. Eades, Q. W. Feng, and H. Nagamochi. Drawing clustered graphs on an orthogonal grid. Journal of Graph Algorithms and Applications, 3(4):3\u201329, 2000.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"5_CR12","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"S. Even. Graph Algorithms. Computer Science Press, Potomac, Maryland, 1979."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Q. W. Feng, R. Cohen, and P. Eades. How to draw a planar clustered graph. In Computing and Combinatorics (Cocoon\u2019 95), volume 959 of Lecture Notes Comput. Sci., pages 21\u201330. Springer-Verlag, 1995.","DOI":"10.1007\/BFb0030816"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Q. W. Feng, R. F. Cohen, and P. Eades. Planarity for clustered graphs. In P. Spirakis, editor, Symposium on Algorithms (Proc. ESA\u2019 95), volume 979 of Lecture Notes Comput. Sci., pages 213\u2013226. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60313-1_145"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"U. F\u00f6\u00dfmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes Comput. Sci., pages 254\u2013266. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021809"},{"key":"5_CR16","unstructured":"GDToolkit. Graph drawing toolkit. Online. http:\/\/www.dia.uniroma3.it\/?gdt ."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"M. L. Huang and P. Eades. A fully animated interactive system for clustering and navigating huge graphs. In S. H. Whitesides, editor, Graph Drawing (Proc. GD\u2019 98), volume 1547 of Lecture Notes Comput. Sci., pages 374\u2013383. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-37623-2_29"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"M. J\u00fcnger, E. K. Lee, P. Mutzel, and T. Odenthal. A polyhedral approach to the multi-layer crossing number problem. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), number 1353 in Lecture Notes Comput. Sci., pages 13\u201324. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_46"},{"issue":"1","key":"5_CR19","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02086607","volume":"16","author":"M. J\u00fcnger","year":"1996","unstructured":"M. J\u00fcnger and P. Mutzel. Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica, 16(1):33\u201359, 1996. (special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia).","journal-title":"Algorithmica"},{"key":"5_CR20","unstructured":"D. L\u00fctke-H\u00fcttmann. Knickminimales Zeichnen 4-planarer Clustergraphen. Master\u2019s thesis, Universit\u00e4t des Saarlandes, 1999."},{"key":"5_CR21","unstructured":"T. Nishizeki and N. Chiba. Planar graphs: Theory and algorithms. Ann. Discrete Math., 32, 1988."},{"issue":"6","key":"5_CR22","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and parallelization. SIAM J. Comput., 17(6):1253\u20131262, 1988.","journal-title":"SIAM J. Comput."},{"issue":"4","key":"5_CR23","first-page":"876","volume":"21","author":"K. Sugiyama","year":"1991","unstructured":"K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Trans. Softw. Eng., 21(4):876\u2013892, 1991.","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"2","key":"5_CR24","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. Syst. Man Cybern., SMC-11(2):109\u2013125, 1981.","journal-title":"IEEE Trans. Syst. Man Cybern."}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:28:30Z","timestamp":1556753310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45848-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433095","9783540458487"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45848-4_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}