{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:39:55Z","timestamp":1725896395477},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_14","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T15:52:03Z","timestamp":1257781923000},"page":"113-124","source":"Crossref","is-referenced-by-count":1,"title":["Feedback Vertex Set on Graphs of Low Cliquewidth"],"prefix":"10.1007","author":[{"given":"Binh-Minh","family":"Bui-Xuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Vatshelle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_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 Journal on Discrete Math.\u00a012, 289\u2013297 (1999)","journal-title":"SIAM Journal on Discrete Math."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1137\/S0097539796305109","volume":"27","author":"R. Bar-Yehuda","year":"1998","unstructured":"Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.: Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM Journal on Computing\u00a027, 942\u2013959 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR3","unstructured":"Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discrete Applied Mathematics: special issue of GROW (to appear)"},{"key":"14_CR4","unstructured":"Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions, \n                    \n                      http:\/\/arxiv.org\/abs\/0903.4796"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-540-73951-7_37","volume-title":"Algorithms and Data Structures","author":"J. Chen","year":"2007","unstructured":"Chen, J., Fomin, F., Liu, Y., Lu, S., Villanger, Y.: Improved Algorithms for the Feedback Vertex Set Problems. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 422\u2013433. Springer, Heidelberg (2007)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0167-6377(98)00021-2","volume":"22","author":"F. Chudak","year":"1998","unstructured":"Chudak, F., Goemans, M., Hochbaum, D., Williamson, D.: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Operations Research Letters\u00a022, 111\u2013118 (1998)","journal-title":"Operations Research Letters"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique width. Theory of Comp. Sys.\u00a033(2), 125\u2013150 (2000)","journal-title":"Theory of Comp. Sys."},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/11533719_87","volume-title":"Computing and Combinatorics","author":"F. Dehne","year":"2005","unstructured":"Dehne, F., Fellows, M., Langston, M., Rosamond, F., Stevens, K.: An O(2\n                    O(k)\n                  n\n                  3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 859\u2013869. Springer, Heidelberg (2005)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-45477-2_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"W. Espelage","year":"2001","unstructured":"Espelage, W., Gurski, F., Wanke, E.: How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. In: Brandst\u00e4dt, A., Van Bang Le (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 117\u2013128. Springer, Heidelberg (2001)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1137\/S0895480195291874","volume":"13","author":"G. Even","year":"2000","unstructured":"Even, G., Naor, J., Schieber, B., Zosin, L.: Approximating minimum subset feedback sets in undirected graphs with applications. SIAM J. Discrete Math.\u00a013, 255\u2013267 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00453-007-9152-0","volume":"52","author":"F. Fomin","year":"2008","unstructured":"Fomin, F., Gaspers, S., Pyatkin, A., Razgon, I.: On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica\u00a052, 293\u2013307 (2008)","journal-title":"Algorithmica"},{"key":"14_CR12","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P.: On Parse Trees and Myhill-Nerode-type Tools for handling Graphs of Bounded Rank-width, \n                    \n                      http:\/\/www.fi.muni.cz\/~hlineny\/Research\/papers\/MNtools-dam3.pdf"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/PL00009810","volume":"18","author":"M. Goemans","year":"1998","unstructured":"Goemans, M., Williamson, D.: Primal-dual approximation algorithms for feedback problems in planar graphs. Combinatorica\u00a018(1), 37\u201359 (1998)","journal-title":"Combinatorica"},{"issue":"8","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1016\/j.jcss.2006.02.001","volume":"72","author":"J. Guo","year":"2006","unstructured":"Guo, J., Gramm, J., H\u00fcffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. Journal of Computer and System Sciences\u00a072(8), 1386\u20131396 (2006)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1142\/S0129054199000125","volume":"10","author":"M. Habib","year":"1999","unstructured":"Habib, M., Paul, C., Viennot, L.: Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. Int. J. of Foundations on Comp. Sci.\u00a010(2), 147\u2013170 (1999)","journal-title":"Int. J. of Foundations on Comp. Sci."},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1137\/070685920","volume":"38","author":"P. Hlin\u011bn\u00fd","year":"2008","unstructured":"Hlin\u011bn\u00fd, P., Oum, S.: Finding branch-decompositions and rank-decompositions. SIAM Journal on Computing\u00a038(3), 1012\u20131032 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1006\/jagm.2000.1137","volume":"38","author":"J. Kleinberg","year":"2001","unstructured":"Kleinberg, J., Kumar, A.: Wavelength conversion in optical networks. Journal of Algorithms\u00a038, 25\u201350 (2001)","journal-title":"Journal of Algorithms"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-36379-3_25","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T. Kloks","year":"2002","unstructured":"Kloks, T., Lee, C., Liu, J.: New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 282\u2013295. Springer, Heidelberg (2002)"},{"issue":"2-3","key":"14_CR21","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(02)00198-1","volume":"126","author":"D. Kobler","year":"2003","unstructured":"Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Applied Mathematics\u00a0126(2-3), 197\u2013221 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR22","unstructured":"Lanlignel, J.-M.: Autour de la d\u00e9composition en coupe. Ph. D. thesis, Universit\u00e9 Montpellier II (2001)"},{"issue":"4","key":"14_CR23","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.: Approximating clique-width and branch-width. J. Combin. Theory Ser. B\u00a096(4), 514\u2013528 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"6","key":"14_CR24","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal on Computing\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"14_CR25","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1159892.1159898","volume":"2","author":"V. Raman","year":"2006","unstructured":"Raman, V., Saurabh, S., Subramanian, C.: Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Trans. on Alg.\u00a02(3), 403\u2013415 (2006)","journal-title":"ACM Trans. on Alg."},{"issue":"24","key":"14_CR26","doi-asserted-by":"publisher","first-page":"6157","DOI":"10.1016\/j.disc.2007.11.039","volume":"308","author":"M. Rao","year":"2008","unstructured":"Rao, M.: Clique-width of graphs defined by one-vertex extensions. Discrete Mathematics\u00a0308(24), 6157\u20136165 (2008)","journal-title":"Discrete Mathematics"},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.: Graph minors X: Obstructions to tree-decomposition. Journal on Combinatorial Theory Series B\u00a052, 153\u2013190 (1991)","journal-title":"Journal on Combinatorial Theory Series B"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:34:26Z","timestamp":1619782466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}