{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:06Z","timestamp":1725502026650},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775362"},{"type":"electronic","value":"9783540775379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-77537-9_29","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T14:50:55Z","timestamp":1201704655000},"page":"291-302","source":"Crossref","is-referenced-by-count":11,"title":["Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Di Battista","sequence":"first","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.jda.2005.06.002","volume":"4","author":"S. Cornelsen","year":"2006","unstructured":"Cornelsen, S., Wagner, D.: Completely connected clustered graphs. Journal of Discrete Algorithms\u00a04(2), 313\u2013323 (2006)","journal-title":"Journal of Discrete Algorithms"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Cortese, P.F., Di Battista, G.: Clustered planarity. In: ACM SoCG 2005, pp. 32\u201334 (2005)","DOI":"10.1145\/1064092.1064093"},{"issue":"3","key":"29_CR3","doi-asserted-by":"crossref","first-page":"391","DOI":"10.7155\/jgaa.00115","volume":"9","author":"P.F. Cortese","year":"2005","unstructured":"Cortese, P.F., Di Battista, G., Patrignani, M., Pizzonia, M.: Clustering cycles into cycles of clusters. Journal of Graph Algorithms and Applications\u00a09(3), 391\u2013413 (2005)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11618058_5","volume-title":"Graph Drawing","author":"P.F. Cortese","year":"2006","unstructured":"Cortese, P.F., Di Battista, G., Patrignani, M., Pizzonia, M.: On embedding a cycle in a plane graph. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 49\u201360. Springer, Heidelberg (2006)"},{"key":"29_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 graphs and its parallelization. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 239\u2013248. Springer, Heidelberg (1998)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Di Battista, G., Frati, F.: Efficient c-planarity testing for embedded flat clustered graphs with small faces. Tech. Report RT-DIA-119-2007, Dip. Inf. e Aut., Univ. Roma Tre (2007)","DOI":"10.1007\/978-3-540-77537-9_29"},{"key":"29_CR7","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. Feng","year":"1995","unstructured":"Feng, Q., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 213\u2013226. Springer, Heidelberg (1995)"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11618058_20","volume-title":"Graph Drawing","author":"M.T. Goodrich","year":"2006","unstructured":"Goodrich, M.T., Lueker, G.S., Sun, J.Z.: C-planarity of extrovert clustered graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 211\u2013222. Springer, Heidelberg (2006)"},{"key":"29_CR9","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)"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02187912","volume":"3","author":"D.G. Kirkpatrick","year":"1988","unstructured":"Kirkpatrick, D.G.: Establishing order in planar subdivisions. Discrete & Computational Geometry\u00a03, 267\u2013280 (1988)","journal-title":"Discrete & Computational Geometry"},{"key":"29_CR11","unstructured":"Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. North-Holland (1988)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77537-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T14:21:02Z","timestamp":1557238862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540775362","9783540775379"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}