{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:31Z","timestamp":1759638031598},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230717"},{"type":"electronic","value":"9783540286394"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28639-4_21","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T20:25:35Z","timestamp":1285014335000},"page":"235-247","source":"Crossref","is-referenced-by-count":27,"title":["Parameterized Algorithms for Feedback Vertex Set"],"prefix":"10.1007","author":[{"given":"Iyad","family":"Kanj","sequence":"first","affiliation":[]},{"given":"Michael","family":"Pelsmajer","sequence":"additional","affiliation":[]},{"given":"Marcus","family":"Schaefer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"21_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 Mathematics\u00a012(3), 289\u2013297 (1999)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"21_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.M.: Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and bayesian inference. SIAM Journal on Computing\u00a027(4), 942\u2013959 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1613\/jair.638","volume":"12","author":"A. Becker","year":"2000","unstructured":"Becker, A., Bar-Yehuda, R., Geiger, D.: Random algorithms for the Loop Cutset problem. Journal of Artificial Intelligence Research\u00a012, 219\u2013234 (2000)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/S0129054194000049","volume":"5","author":"H. Bodlaender","year":"1994","unstructured":"Bodlaender, H.: On disjoint cycles. International Journal of Foundations of Computer Science\u00a05, 59\u201368 (1994)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"21_CR5","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. Academic Press, London (1978)"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0095-8956(74)90052-5","volume":"16","author":"J.A. Bondy","year":"1974","unstructured":"Bondy, J.A., Simonovits, M.: Cycles of even length in a graph. J. Combinatorial Theory (B)\u00a016, 97\u2013105 (1974)","journal-title":"J. Combinatorial Theory (B)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms\u00a041, 280\u2013301 (2001)","journal-title":"Journal of Algorithms"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progression. Journal of Symbolic Computation\u00a09, 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"key":"21_CR9","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory, 2nd edn. Springer, New York (2000)","edition":"2"},{"key":"21_CR10","first-page":"161","volume":"87","author":"R. Downey","year":"1992","unstructured":"Downey, R., Fellows, M.: Fixed-parameter tractability and completeness. Congressus Numerantium\u00a087, 161\u2013187 (1992)","journal-title":"Congressus Numerantium"},{"key":"21_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.5486\/PMD.1962.9.1-2.02","volume":"9","author":"P. Erdos","year":"1962","unstructured":"Erdos, P., Posa, L.: On the maximal number of disjoint circuits of a graph. Pubbl. Math. Debrecen\u00a09, 3\u201312 (1962)","journal-title":"Pubbl. Math. Debrecen"},{"issue":"2","key":"21_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G. Even","year":"1998","unstructured":"Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica\u00a020(2), 151\u2013174 (1998)","journal-title":"Algorithmica"},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02579343","volume":"3","author":"R.J. Faudree","year":"1983","unstructured":"Faudree, R.J., Simonovits, M.: On a class of degenerate extremal graph problems. Combinatorica\u00a03(1), 83\u201393 (1983)","journal-title":"Combinatorica"},{"key":"21_CR15","unstructured":"Fomin, F., Thilikos, D.: Dominating sets in planar graphs: branch-width and exponential speed-up. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, pp. 168\u2013177 (2003)"},{"issue":"2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0020-0190(96)00094-4","volume":"59","author":"T. Fujito","year":"1996","unstructured":"Fujito, T.: A note on approximation of the Vertex Cover and Feedback Vertex Set problems-unified approach. Information Processing Letters\u00a059(2), 59\u201363 (1996)","journal-title":"Information Processing Letters"},{"key":"21_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"4","key":"21_CR18","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/12.54846","volume":"39","author":"R. Gupta","year":"1990","unstructured":"Gupta, R., Gupta, R., Breuer, M.: Ballast: A methodology for partial scan design. IEEE Transactions on Computers\u00a039(4), 538\u2013544 (1990)","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"21_CR19","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM Journal on Computing\u00a07(4), 413\u2013423 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR20","first-page":"37","volume":"38","author":"V. Kostochka","year":"1982","unstructured":"Kostochka, V.: The minimum Hadwiger number for graphs with a given mean degree of vertices. Metody Diskret. Analiz.\u00a038, 37\u201358 (1982)","journal-title":"Metody Diskret. Analiz."},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF00137392","volume":"1","author":"A. Kunzmann","year":"1990","unstructured":"Kunzmann, A., Wunderlich, H.: An analytical approach to the partial scan problem. Journal of Electronic Testing: Theory and Applications\u00a01, 163\u2013174 (1990)","journal-title":"Journal of Electronic Testing: Theory and Applications"},{"key":"21_CR22","unstructured":"Raman, V.: Parameterized complexity. In: Proceedings of the 7th National Seminar on Theoretical Computer Science, pp. 1\u201318 (1997)"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-36136-7_22","volume-title":"Algorithms and Computation","author":"V. Raman","year":"2002","unstructured":"Raman, V., Saurabh, S., Subramanian, C.: Faster fixed-parameter tractable algorithms for Undirected Feedback Vertex Set. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 241\u2013248. Springer, Heidelberg (2002)"},{"issue":"2","key":"21_CR24","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01200760","volume":"15","author":"P. Seymour","year":"1995","unstructured":"Seymour, P.: Packing directed circuits fractionally. Combinatorica\u00a015(2), 281\u2013288 (1995)","journal-title":"Combinatorica"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Thomason, A.: An extremal function for contractions of graphs. In: Math. Proc. Cambridge Philos. Soc., vol.\u00a095(2), pp. 261\u2013265 (2001)","DOI":"10.1017\/S0305004100061521"},{"key":"21_CR26","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0095-8956(83)90067-9","volume":"35","author":"C. Thomassen","year":"1983","unstructured":"Thomassen, C.: Girth in graphs. J. Combin. Theory Ser. B\u00a035, 129\u2013141 (1983)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28639-4_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T11:55:45Z","timestamp":1685793345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28639-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230717","9783540286394"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28639-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}