{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:58Z","timestamp":1725524638569},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_12","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"114-120","source":"Crossref","is-referenced-by-count":4,"title":["Computing Maximum C-Planar Subgraphs"],"prefix":"10.1007","author":[{"given":"Markus","family":"Chimani","sequence":"first","affiliation":[]},{"given":"Carsten","family":"Gutwenger","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"Jansen","sequence":"additional","affiliation":[]},{"given":"Karsten","family":"Klein","sequence":"additional","affiliation":[]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-77537-9_17","volume-title":"Graph Drawing","author":"M. Chimani","year":"2008","unstructured":"Chimani, M., Mutzel, P., Schmidt, J.M.: Efficient extraction of multiple kuratowski subdivisions. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 159\u2013170. Springer, Heidelberg (2008)"},{"issue":"2","key":"12_CR2","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. J. Discrete Algorithms\u00a04(2), 313\u2013323 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"12_CR3","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.F. Cortese","year":"2005","unstructured":"Cortese, P.F., Di Battista, G., 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":"12_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":"12_CR5","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. Di Battista","year":"2002","unstructured":"Di Battista, G., 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)"},{"key":"12_CR6","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. Di Battista","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)"},{"issue":"5-6","key":"12_CR7","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Di Battista","year":"1997","unstructured":"Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl.\u00a07(5-6), 303\u2013325 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"key":"12_CR8","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":"12_CR9","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":"12_CR10","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":"12_CR11","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., Vyskocil, 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)"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02086607","volume":"16","author":"M. J\u00fcnger","year":"1996","unstructured":"J\u00fcnger, M., Mutzel, P.: Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica\u00a016(1), 33\u201359 (1996)","journal-title":"Algorithmica"},{"key":"12_CR13","first-page":"1325","volume":"30","author":"M. J\u00fcnger","year":"2000","unstructured":"J\u00fcnger, M., Thienel, S.: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Software: Practice and Experience\u00a030, 1325\u20131352 (2000)","journal-title":"Software: Practice and Experience"},{"key":"12_CR14","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K. Kuratowski","year":"1930","unstructured":"Kuratowski, K.: Sur le probl\u00e8me des courbes gauches en topologie. Fundamenta Mathematicae\u00a015, 271\u2013283 (1930)","journal-title":"Fundamenta Mathematicae"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T23:54:35Z","timestamp":1551743675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}