{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:19Z","timestamp":1759638079951},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003311"},{"type":"electronic","value":"9783540363798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36379-3_25","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:05Z","timestamp":1269897125000},"page":"282-295","source":"Crossref","is-referenced-by-count":28,"title":["New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs"],"prefix":"10.1007","author":[{"given":"Ton","family":"Kloks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.M.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiping","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"25_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44985-X_10","volume-title":"Faster algorithms for domination of planar graphs","author":"J. Alber","year":"2000","unstructured":"Alber, J., H. Bodlaender, H. Fernau, and R. Niedermeier, Faster algorithms for domination of planar graphs, Proc. of the 17th SWAT\u201900, Springer-Verlag LNCS 1851 (2000), pp. 97\u2013110."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Alber, J., H. Fan, M. Fellows, H. Fernau, R. Niedermeier, F. Rosamond, U. Stege, Refined search tree techniques for the planar dominating set problem, Proceedings26th MFCS 2001.","DOI":"10.1007\/3-540-44683-4_11"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Alber, Jochen, Henning Fernau, and Rolf Niedermeier, Parameterized complexity: Exponential speed-up for planar graph problems, Proceedings 28th ICALP, 2001.","DOI":"10.1007\/3-540-48224-5_22"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Alber, J., H. Fernau, R. Niedermeier, Graph separators: A parameterized view, Proceedings 7th COCOON 2001.","DOI":"10.1007\/3-540-44679-6_35"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/S0129054194000049","volume":"5","author":"Bodlaender","year":"1994","unstructured":"Bodlaender, Hans, L., On disjoint cycles, International Journal of Foundation of Computer Science 5, (1994), pp. 59\u201368.","journal-title":"International Journal of Foundation of Computer Science"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. Bodlaender","year":"1996","unstructured":"Bodlaender, H., A linear time algorithm for finding tree decompositions of small treewidth, SIAM J. Comput. 25, (1996), pp. 1305\u20131317.","journal-title":"SIAM J. Comput"},{"key":"25_CR7","unstructured":"Bodlaender, Hans L., Ton Kloks, Jochen Alber, Henning Fernau, and Rolf Niedermeier, Faster algorithms for planar dominating set and related problems, 40th Workshop Komplexit\u00e4tstheorie, Datenstrukturen und Effiziente Algorithmen, Technische Universit\u00e4t Ilmenau, 2000."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Cai, Liming and D. W. Juedes, Subexponential parameterized algorithms collapse the W-hierarchy, Proceedings 28th ICALP, 2001.","DOI":"10.1007\/3-540-48224-5_23"},{"key":"25_CR9","unstructured":"Cai, Liming, Michael Fellows, David Juedes, and Frances Rosamond, Efficient polynomial-time approximation schemes for problems on planar structures: upper and lowerbounds. Manuscript 2001."},{"key":"25_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/3-540-45477-2_5","volume-title":"Maximum clique transversals","author":"M.-S. Chang","year":"2001","unstructured":"Chang M.-S, T. Kloks, and C. M. Lee, Maximum clique transversals, Proceedings 27th WG 2001, Springer-Verlag LNCS 2204 (2001), pp. 32\u201343."},{"key":"25_CR11","first-page":"311","volume":"15","author":"B. Bollob\u00e1s","year":"1964","unstructured":"Bollob\u00e1s, B., Graphs without two independent circuits, (Hungarian), K. Mat. Lapok 15, (1964), pp. 311\u2013321.","journal-title":"K. Mat. Lapok"},{"key":"25_CR12","volume-title":"Graph Theory","author":"R. Diestel","year":"1997","unstructured":"Diestel, R., Graph Theory, Springer-Verlag, New York, 1997."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Downey, Rod G. and Mike R. Fellows, Parameterized complexity, Monographs in Computer Science, Springer-Verlag, 1999.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Downey, R. G. and M. R. Fellows, Parameterized computational feasibility, Proceedings of feasible mathematics II (eds. P. Clote and J. B. Remmel), Birkhauser (1995), pp. 219\u2013244.","DOI":"10.1007\/978-1-4612-2566-9_7"},{"key":"25_CR15","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1965-035-8","volume":"17","author":"P. Erd\u00f6s","year":"1964","unstructured":"Erd\u00f6s, P. and L. P\u00f3sa, On independent circuits contained in a graph, Canad. J. Math. 17, (1964), pp. 347\u2013352.","journal-title":"Canad. J. Math"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1145\/44483.44491","volume":"35","author":"M. R. Fellows","year":"1988","unstructured":"Fellows, M. R. and M. A. Langston, Nonconstructive tools for proving polynomial time decidability,J. ACM 35, (1988), pp. 727\u2013739.","journal-title":"J. ACM"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1006\/jctb.2000.2026","volume":"82","author":"B. Mohar","year":"2001","unstructured":"Mohar, Bojan, Face covers and the genus problem for apex graphs, Journal of Combinatorial Theory, Series B 82, (2001), pp. 102\u2013117.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0166-218X(93)90226-E","volume":"44","author":"J. A. Telle","year":"1993","unstructured":"Telle, Jan Arne and Andrezj Proskurowski, Efficient sets in partial k-trees, Discrete Applied Math. 44, (1993), pp. 109\u2013117.","journal-title":"Discrete Applied Math"},{"key":"25_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth-Computations and approxmations","author":"T. Kloks","year":"1994","unstructured":"Kloks, T., Treewidth-Computations and approxmations, Springer-Verlag, LNCS 842, 1994."},{"key":"25_CR20","unstructured":"Voss, H. J., Some properties of graphs containing k independent circuits, Proc. Colloq. Tihany, Academic Press, New York, 1968, pp. 321\u2013334."},{"key":"25_CR21","unstructured":"Voss, H. J., \u00dcber die Taillenweite in Graphen, die maximal unabh\u00e4ngige Kreise enthalten, und \u00fcber die Anzahl der Knotenpunkte, die alle Kreise repr\u00e4sentieren, X. Internat. Wiss. Koll. TH Ilmenau 1965 Heft 11, Mathematische Probleme der \u00d6konomie und Rechentechnik, Vortragsreihe, 23\u201327."}],"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\/3-540-36379-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T18:44:32Z","timestamp":1558982672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36379-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003311","9783540363798"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-36379-3_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}