{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T10:12:28Z","timestamp":1784110348098,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642114083","type":"print"},{"value":"9783642114090","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_13","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T13:12:27Z","timestamp":1259845947000},"page":"143-153","source":"Crossref","is-referenced-by-count":10,"title":["Connected Feedback Vertex Set in Planar Graphs"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Grigoriev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ren\u00e9","family":"Sitters","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V. Bafna","year":"1999","unstructured":"Bafna, V., Berman, P., Fujito, T.: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem. SIAM J. Discrete Math.\u00a012, 289\u2013297 (1999)","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B. Baker","year":"1994","unstructured":"Baker, B.: Approximation algorithms for NP-complete problems on planar graphs. JACM\u00a041, 153\u2013180 (1994)","journal-title":"JACM"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0012-365X(74)90016-8","volume":"10","author":"D. Barnette","year":"1974","unstructured":"Barnette, D.: An upper bound for the diameter of a polytope. Discr. Math.\u00a010, 9\u201313 (1974)","journal-title":"Discr. Math."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0004-3702(95)00004-6","volume":"83","author":"A. Becker","year":"1996","unstructured":"Becker, A., Geiger, D.: Optimization of Pearl\u2019s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artificial Intelligence\u00a083, 167\u2013188 (1996)","journal-title":"Artificial Intelligence"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/11970125_6","volume-title":"Approximation and Online Algorithms","author":"H.L. Bodlaender","year":"2007","unstructured":"Bodlaender, H.L., Feremans, C., Grigoriev, A., Penninkx, E., Sitters, R., Wolle, T.: On the minimum corridor connection and other generalized geometric problems. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol.\u00a04368, pp. 69\u201382. Springer, Heidelberg (2007)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-0010-x","volume":"49","author":"H.L. Bodlaender","year":"2007","unstructured":"Bodlaender, H.L., Grigoriev, A.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica\u00a049, 1\u201311 (2007)","journal-title":"Algorithmica"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0167-6377(98)00021-2","volume":"22","author":"F.A. Chudak","year":"1998","unstructured":"Chudak, F.A., Goemans, M.X., Hochbaum, D.S., Williamson, D.P.: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Oper. Res. Lett.\u00a022, 111\u2013118 (1998)","journal-title":"Oper. Res. Lett."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1093\/comjnl\/bxm033","volume":"51","author":"E.D. Demaine","year":"2008","unstructured":"Demaine, E.D., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. The Computer Journal\u00a051, 292\u2013302 (2008)","journal-title":"The Computer Journal"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s004530010020","volume":"27","author":"D. Eppstein","year":"2000","unstructured":"Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica\u00a027, 275\u2013291 (2000)","journal-title":"Algorithmica"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-74839-7_20","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B. Escoffier","year":"2007","unstructured":"Escoffier, B., Gourv\u00e8s, L., Monnot, J.: Complexity and approximation results for the connected vertex cover problem. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 202\u2013213. Springer, Heidelberg (2007)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math.\u00a032, 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"13_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01196127","volume":"17","author":"M.X. Goemans","year":"1997","unstructured":"Goemans, M.X., Williamson, D.P.: Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs. Combinatorica\u00a017, 1\u201323 (1997)","journal-title":"Combinatorica"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0020-0190(82)90022-9","volume":"14","author":"C.D. Savage","year":"1982","unstructured":"Savage, C.D.: Depth-first search and the vertex cover problem. Inf. Process. Lett.\u00a014, 233\u2013235 (1982)","journal-title":"Inf. Process. Lett."}],"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-642-11409-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:51:59Z","timestamp":1619783519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}