{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:11Z","timestamp":1759638251218},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_11","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"102-113","source":"Crossref","is-referenced-by-count":5,"title":["Clustered Planarity: Clusters with Few Outgoing Edges"],"prefix":"10.1007","author":[{"given":"V\u00edt","family":"Jel\u00ednek","sequence":"first","affiliation":[]},{"given":"Ond\u0159ej","family":"Such\u00fd","sequence":"additional","affiliation":[]},{"given":"Marek","family":"Tesa\u0159","sequence":"additional","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"Vysko\u010dil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"11_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":"11_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":"11_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); In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 391\u2013413. Springer, Heidelberg (2005)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"11_CR4","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":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-77537-9_29","volume-title":"Graph Drawing","author":"G. Battista Di","year":"2008","unstructured":"Di Battista, G., Frati, F.: Efficient C-planarity testing for embedded flat clustered graphs with small faces. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 291\u2013302. Springer, Heidelberg (2008)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-004-1144-8","volume":"44","author":"P. Eades","year":"2006","unstructured":"Eades, P., Feng, Q.W., Lin, X., Nagamochi, H.: Straight-line drawing algorithms for hierarchical graphs and clustered Graphs. Algorithmica\u00a044, 1\u201332 (2006)","journal-title":"Algorithmica"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., 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":"11_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":"11_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":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-540-39890-5_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"C. Gutwenger","year":"2003","unstructured":"Gutwenger, C., J\u00fcnger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Subgraph induced planar connectivity augmentation. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 261\u2013272. Springer, Heidelberg (2003)"},{"issue":"4","key":"11_CR11","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"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-77537-9_30","volume-title":"Graph Drawing","author":"E. Jel\u00ednkov\u00e1","year":"2008","unstructured":"Jel\u00ednkov\u00e1, E., K\u00e1ra, J., Kratochv\u00edl, J., Pergel, M., Such\u00fd, O., Vysko\u010dil, T.: Clustered planarity: Small clusters in eulerian graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 303\u2013314. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T23:56:52Z","timestamp":1551743812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}