{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:26Z","timestamp":1750308086319,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,6]],"date-time":"2005-06-06T00:00:00Z","timestamp":1118016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,6,6]]},"DOI":"10.1145\/1064092.1064093","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"32-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Clustered planarity"],"prefix":"10.1145","author":[{"given":"Pier Francesco","family":"Cortese","sequence":"first","affiliation":[{"name":"Universit\u00e1 Roma Tre, Italia"}]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[{"name":"Universit\u00e1 Roma Tre, Italia"}]}],"member":"320","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/647679.732148"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39890-5_15"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31843-9_12"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"E.\n      Dahlhaus\n    .\n  Linear time algorithm to recognize clustered planar graphs and its parallelization\n  . In C. Lucchesi editor LATIN '98 3rd Latin American symposium on theoretical informatics Campinas Brazil April 20--24 1998 volume \n  1380\n   of \n  LNCS pages \n  239\n  --\n  248 1998.   E. Dahlhaus. Linear time algorithm to recognize clustered planar graphs and its parallelization. In C. Lucchesi editor LATIN '98 3rd Latin American symposium on theoretical informatics Campinas Brazil April 20--24 1998 volume 1380 of LNCS pages 239--248 1998.","DOI":"10.1007\/BFb0054325"},{"key":"e_1_3_2_1_5_1","first-page":"60","volume-title":"Proc. Graph Drawing 2001 (GD'01)","author":"Di Battista G.","year":"2001","unstructured":"G. Di Battista , W. Didimo , and A. Marcandalli . Planarization of clustered graphs . In Proc. Graph Drawing 2001 (GD'01) , LNCS, pages 60 -- 74 . Springer-Verlag , 2001 . G. Di Battista, W. Didimo, and A. Marcandalli. Planarization of clustered graphs. In Proc. Graph Drawing 2001 (GD'01), LNCS, pages 60--74. Springer-Verlag, 2001."},{"key":"e_1_3_2_1_6_1","volume-title":"Graph Drawing","author":"Di Battista G.","year":"1999","unstructured":"G. Di Battista , P. Eades , R. Tamassia , and I. G. Tollis . Graph Drawing . Prentice Hall , Upper Saddle River, NJ, 1999 . G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90045-Y"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(02)00094-9"},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","first-page":"101","volume-title":"Proc. Graph Drawing 1996 (GD'96)","author":"Eades P.","year":"1997","unstructured":"P. Eades and Q. W. Feng . Multilevel visualization of clustered graphs . In S. C. North, editor, Proc. Graph Drawing 1996 (GD'96) , volume 1190 of LNCS , pages 101 -- 112 . Springer-Verlag , 1997 . P. Eades and Q. W. Feng. Multilevel visualization of clustered graphs. In S. C. North, editor, Proc. Graph Drawing 1996 (GD'96), volume 1190 of LNCS, pages 101--112. Springer-Verlag, 1997."},{"key":"e_1_3_2_1_10_1","series-title":"LNCS","first-page":"113","volume-title":"Proc. Graph Drawing 1996 (GD'96)","author":"Eades P.","year":"1997","unstructured":"P. Eades , Q. W. Feng , and X. Lin . Straight line drawing algorithms for hierarchical graphs and clustered graphs . In S. C. North, editor, Proc. Graph Drawing 1996 (GD'96) , volume 1190 of LNCS , pages 113 -- 128 . Springer-Verlag , 1997 . P. Eades, Q. W. Feng, and X. Lin. Straight line drawing algorithms for hierarchical graphs and clustered graphs. In S. C. North, editor, Proc. Graph Drawing 1996 (GD'96), volume 1190 of LNCS, pages 113--128. Springer-Verlag, 1997."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00016"},{"key":"e_1_3_2_1_13_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Symposium on Algorithms (Proc. ESA '95)","author":"Feng Q. W.","year":"1995","unstructured":"Q. W. Feng , R. F. Cohen , and P. Eades . Planarity for clustered graphs . In P. Spirakis, editor, Symposium on Algorithms (Proc. ESA '95) , volume 979 of LNCS , pages 213 -- 226 . Springer-Verlag , 1995 . Q. W. Feng, R. F. Cohen, and P. Eades. Planarity for clustered graphs. In P. Spirakis, editor, Symposium on Algorithms (Proc. ESA '95), volume 979 of LNCS, pages 213--226. Springer-Verlag, 1995."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"C.\n      Gutwenger M.\n      Jnger S.\n      Leipert P.\n      Mutzel M.\n      Percan and \n      R.\n      Weiskircher\n  . \n  Subgraph induced planar connectivity augmentation. In 29-th Workshop on Graph-Theoretic Concepts in Computer Science (WG\n  2003\n  ) volume \n  2880\n   of \n  LNCS pages \n  261\n  --\n  272\n  . \n  Springer-Verlag 2003.  C. Gutwenger M. Jnger S. Leipert P. Mutzel M. Percan and R. Weiskircher. Subgraph induced planar connectivity augmentation. In 29-th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003) volume 2880 of LNCS pages 261--272. Springer-Verlag 2003.","DOI":"10.1007\/978-3-540-39890-5_23"},{"key":"e_1_3_2_1_15_1","series-title":"LNCS","first-page":"220","volume-title":"Proc. Graph Drawing 2002 (GD'02)","author":"Gutwenger C.","year":"2002","unstructured":"C. Gutwenger , M. J\u00fcnger , S. Leipert , P. Mutzel , M. Percan , and R. Weiskircher . Advances in C-planarity testing of clustered graphs . In S. G. Kobourov and M. T. Goodrich, editors, Proc. Graph Drawing 2002 (GD'02) , volume 2528 of LNCS , pages 220 -- 235 . Springer-Verlag , 2002 . C. Gutwenger, M. J\u00fcnger, S. Leipert, P. Mutzel, M. Percan, and R. Weiskircher. Advances in C-planarity testing of clustered graphs. In S. G. Kobourov and M. T. Goodrich, editors, Proc. Graph Drawing 2002 (GD'02), volume 2528 of LNCS, pages 220--235. Springer-Verlag, 2002."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65952"},{"key":"e_1_3_2_1_17_1","series-title":"LNCS","first-page":"369","volume-title":"Proc. Graph Drawing 2003 (GD'03)","author":"Nagamochi H.","year":"2004","unstructured":"H. Nagamochi and K. Kuroya . Convex drawing for c-planar biconnected clustered graphs . In G. Liotta, editor, Proc. Graph Drawing 2003 (GD'03) , volume 2912 of LNCS , pages 369 -- 380 . Springer-Verlag , 2004 . H. Nagamochi and K. Kuroya. Convex drawing for c-planar biconnected clustered graphs. In G. Liotta, editor, Proc. Graph Drawing 2003 (GD'03), volume 2912 of LNCS, pages 369--380. Springer-Verlag, 2004."}],"event":{"name":"SoCG05: The 21st Annual ACM Symposium on Computational Geometry 2005","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Pisa Italy","acronym":"SoCG05"},"container-title":["Proceedings of the twenty-first annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064092.1064093","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1064092.1064093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:50Z","timestamp":1750262870000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064092.1064093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,6]]},"references-count":16,"alternative-id":["10.1145\/1064092.1064093","10.1145\/1064092"],"URL":"https:\/\/doi.org\/10.1145\/1064092.1064093","relation":{},"subject":[],"published":{"date-parts":[[2005,6,6]]},"assertion":[{"value":"2005-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}