{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:17Z","timestamp":1759637897698},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001584"},{"type":"electronic","value":"9783540361510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36151-0_21","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T12:14:14Z","timestamp":1195215254000},"page":"220-236","source":"Crossref","is-referenced-by-count":37,"title":["Advances in C-Planarity Testing of Clustered Graphs"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Gutwenger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Leipert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Merijam","family":"Percan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Weiskircher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"21_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45848-4_5","volume-title":"Graph Drawing","author":"G. Battista Di","year":"2002","unstructured":"G. Di Battista, W. Didimo, and A. Marcandalli. Planarization of clustered graphs (extended abstract). In P. Mutzel, Michael J\u00fcnger, and Sebastian Leipert, editors, Graph Drawing, volume 2265 of Lecture Notes in Computer Science, pages 60\u201374. Springer-Verlag, 2002."},{"issue":"1","key":"21_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"K. Booth and G. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. Journal of Computer and System Sciences, 13(1):335\u2013379, 1976.","journal-title":"Journal of Computer and System Sciences"},{"issue":"5","key":"21_CR3","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"G. Di Battista and R. Tamassia. On-line planarity testing. SIAM Journal on Computing, 25(5):956\u2013997, 1996.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR4","unstructured":"I. Cederbaum, S. Even, and A. Lempel. An algorithm for planarity testing of graphs. In Theory of Graphs, International Symposium, Rome, pages 215\u2013232, 1967."},{"key":"21_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BFb0054325","volume-title":"Linear time algorithm to recognize clustered planar graphs and its parallelization (extended abstract)","author":"E. Dahlhaus","year":"1998","unstructured":"E. Dahlhaus. Linear time algorithm to recognize clustered planar graphs and its parallelization (extended abstract). In C. L. Lucchesi, editor, LATIN\u2019 98, 3rd Latin American symposium on theoretical informatics, Campinas, Brazil, April 20-24, 1998., volume 1380 of Lecture Notes in Computer Science, pages 239\u2013248, 1998."},{"key":"21_CR6","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:3\u201329, 2000.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"21_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Planarity for clustered graphs","author":"Q.-W. Feng","year":"1995","unstructured":"Q.-W. Feng, R.-F. Cohen, and P. Eades. Planarity for clustered graphs. In P. Spirakis, editor, Algorithms-ESA\u2019 95, Third Annual European Symposium, volume 979 of Lecture Notes in Computer Science, pages 213\u2013226. Springer-Verlag, 1995."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"C. Gutwenger, M. J\u00fcnger, S. Leipert, P. Mutzel, M. Percan, and R. Weiskircher. Subgraph induced planar connectivity augmentation. Technical report, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 2002. zaik2002\u2013435.","DOI":"10.1007\/978-3-540-39890-5_23"},{"key":"21_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"A linear time implementation of SPQR-trees","author":"C. Gutwenger","year":"2001","unstructured":"C. Gutwenger and P. Mutzel. A linear time implementation of SPQR-trees. In J. Marks, editor, Graph Drawing (Proc. 2000), volume 1984 of Lecture Notes in Computer Science, pages 77\u201390. Springer-Verlag, 2001."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36151-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:31:54Z","timestamp":1556969514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36151-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001584","9783540361510"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-36151-0_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}