{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:23Z","timestamp":1759637663117},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_20","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"211-222","source":"Crossref","is-referenced-by-count":19,"title":["C-Planarity of Extrovert Clustered Graphs"],"prefix":"10.1007","author":[{"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[]},{"given":"George S.","family":"Lueker","sequence":"additional","affiliation":[]},{"given":"Jonathan Z.","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45848-4_5","volume-title":"Graph Drawing","author":"G.D. Battista","year":"2002","unstructured":"Battista, G.D., Didimo, W., Marcandalli, A.: Planarization of clustered graphs. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 60\u201374. Springer, Heidelberg (2002)"},{"issue":"5","key":"20_CR2","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G.D. Battista","year":"1996","unstructured":"Battista, G.D., Tamassia, R.: On-line planarity testing. SIAM J. Comput.\u00a025(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"Booth, K., Lueker, G.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Systems Sci.\u00a013(3), 335\u2013379 (1976)","journal-title":"J. Comput. Systems Sci."},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-31843-9_12","volume-title":"Graph Drawing","author":"P.G. Cortese","year":"2005","unstructured":"Cortese, P.G., Battista, G.D., Patrignani, M., Pizzonia, M.: Clustering cycles into cycles of clusters. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 100\u2013110. Springer, Heidelberg (2005)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BFb0054325","volume-title":"LATIN\u201998: Theoretical Informatics","author":"E. Dahlhaus","year":"1998","unstructured":"Dahlhaus, E.: A linear time algorithm to recognize clustered planar graphs and its parallelization. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 239\u2013248. Springer, Heidelberg (1998)"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-46648-7_19","volume-title":"Graph Drawing","author":"C.A. Duncan","year":"1999","unstructured":"Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Planarity-preserving clustering and embedding for large planar graphs. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 186\u2013196. Springer, Heidelberg (1999)"},{"issue":"4","key":"20_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.7155\/jgaa.00016","volume":"3","author":"P. Eades","year":"1999","unstructured":"Eades, P., Feng, Q., Nagamochi, H.: Drawing clustered graphs on an orthogonal grid. Journal of Graph Algorithms and Applications\u00a03(4), 3\u201329 (1999)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/3-540-62495-3_41","volume-title":"Graph Drawing","author":"P. Eades","year":"1997","unstructured":"Eades, P., Feng, Q.-W.: Multilevel visualization of clustered graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 101\u2013112. Springer, Heidelberg (1997)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-62495-3_42","volume-title":"Graph Drawing","author":"P. Eades","year":"1997","unstructured":"Eades, P., Feng, Q.-W., Lin, X.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 113\u2013128. Springer, Heidelberg (1997)"},{"issue":"3","key":"20_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.7155\/jgaa.00029","volume":"4","author":"P. Eades","year":"2000","unstructured":"Eades, P., Huang, M.L.: Navigating clustered graphs using force-directed methods. J. Graph Algorithms and Applications: Special Issue on Selected Papers from 1998 Symp. Graph Drawing\u00a04(3), 157\u2013181 (2000)","journal-title":"J. Graph Algorithms and Applications: Special Issue on Selected Papers from 1998 Symp. Graph Drawing"},{"issue":"3","key":"20_CR11","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"Even, S., Tarjan, R.E.: Computing an st-numbering. Theoretical Computer Science\u00a02(3), 339\u2013344 (1976)","journal-title":"Theoretical Computer Science"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Algorithms - ESA \u201995","author":"Q.-W. Feng","year":"1995","unstructured":"Feng, Q.-W., Eades, P., Cohen, R.F.: Clustered graphs and C-planarity. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 213\u2013226. Springer, Heidelberg (1995)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-36151-0_21","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2002","unstructured":"Gutwenger, C., J\u00fcnger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Advances in C-planarity testing of clustered graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 220\u2013235. Springer, Heidelberg (2002)"},{"issue":"4","key":"20_CR14","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. J. ACM\u00a021(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(02)00435-8","volume":"296","author":"W. Hsu","year":"2003","unstructured":"Hsu, W., McConnell, R.M.: PC trees and circular-ones arrangements. Theoretical Computer Science\u00a0296(1), 59\u201374 (2003)","journal-title":"Theoretical Computer Science"},{"key":"20_CR16","unstructured":"Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Theory of graphs: International symposium, pp. 215\u2013232 (1966)"},{"key":"20_CR17","series-title":"Ann. Discrete Math.","volume-title":"Planar Graphs: Theory and Algorithms","author":"T. Nishizeki","year":"1988","unstructured":"Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. Ann. Discrete Math., vol.\u00a032. North-Holland, Amsterdam (1988)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:12:11Z","timestamp":1619507531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11618058_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}