{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:14:34Z","timestamp":1781345674776,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540204527","type":"print"},{"value":"9783540398905","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_23","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T21:16:57Z","timestamp":1283548617000},"page":"261-272","source":"Crossref","is-referenced-by-count":8,"title":["Subgraph Induced Planar Connectivity Augmentation"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Gutwenger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Leipert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Merijam","family":"Percan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ren\u00e9","family":"Weiskircher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"5","key":"23_CR1","first-page":"956","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. Journal on Computing\u00a025(5), 956\u2013997 (1996)","journal-title":"Journal on Computing"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-60114-7","volume-title":"Algorithms - ESA \u201995","author":"R.-F. Cohen","year":"1995","unstructured":"Cohen, R.-F., Eades, P., Feng, Q.-W.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 213\u2013226. Springer, Heidelberg (1995)"},{"key":"23_CR3","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.: 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":"23_CR4","first-page":"260","volume-title":"Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998)","author":"S. Fialko","year":"1998","unstructured":"Fialko, S., Mutzel, P.: A new approximation algorithm for the planar augmentation problem. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), San Francisco, California, pp. 260\u2013269. ACM Press, New York (1998)"},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM J. Discrete Mathematics\u00a05(1), 25\u201353 (1992)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Gutwenger, C., J\u00fcnger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Advances in c-planarity testing of clustered graphs. Technical report, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, zaik2002\u2013436 (2002)","DOI":"10.1007\/3-540-36151-0_21"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Gutwenger, C., J\u00fcnger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Subgraph induced planar connectivity augmentation. Technical report, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, zaik2002\u2013435 (2002)","DOI":"10.1007\/978-3-540-39890-5_23"},{"key":"23_CR8","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":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 77\u201390. Springer, Heidelberg (2001)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/BFb0028270","volume-title":"Algorithms and Data Structures","author":"G. Kant","year":"1991","unstructured":"Kant, G., Bodlaender, H.L.: Planar graph augmentation problems. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol.\u00a0519, pp. 286\u2013298. Springer, Heidelberg (1991)"},{"key":"23_CR11","unstructured":"Khuller, S.: Approximation Algorithms for Finding Highly Connected Subgraphs. In: Hochbaum, D.S. (ed.), pp. 236\u2013265. PWS Publishing Company, Boston (1997)"},{"key":"23_CR12","volume-title":"Combinatorial Problems and Exercises","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises. North-Holland, Amsterdam (1979)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/3-540-60313-1_166","volume-title":"Algorithms - ESA \u201995","author":"P. Mutzel","year":"1995","unstructured":"Mutzel, P.: A polyhedral approach to planar augmentation and related problems. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 494\u2013507. Springer, Heidelberg (1995)"},{"issue":"229","key":"23_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0166-218X(97)00087-5","volume":"80","author":"C. Simone De","year":"1997","unstructured":"De Simone, C., J\u00fcnger, M.: On the two-connected planar spanning subgraph polytope. Discrete Applied Mathematics\u00a080(229), 223\u2013229 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR15","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0088963","volume-title":"Design of Survivable Networks","author":"M. Stoer","year":"1992","unstructured":"Stoer, M.: Design of Survivable Networks. Lecture Notes in Mathematics, vol.\u00a01531. Springer, Berlin (1992)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39890-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T09:19:15Z","timestamp":1559553555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}