{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:36:51Z","timestamp":1725521811728},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001423"},{"type":"electronic","value":"9783540361367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_22","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T19:07:11Z","timestamp":1227640031000},"page":"241-248","source":"Crossref","is-referenced-by-count":24,"title":["Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set"],"prefix":"10.1007","author":[{"given":"Venkatesh","family":"Raman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. R.","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"22_CR1","first-page":"93","volume":"1851","author":"J. Alber","year":"2000","unstructured":"J. Alber, H. L. Bodlaender, H. Fernau and R. Niedermeier, \u2018Fixed Parameter Algorithms for Dominating Set and Related Problems on Planar Graphs\u2019, Lecture Notes in Computer Science 1851 (2000) 93\u2013110; to appear in Algorithmica.","journal-title":"Lecture Notes in Computer Science"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-44683-4_11","volume":"2136","author":"J. Alber","year":"2001","unstructured":"J. Alber, H. Fan, M. R. Fellows, H. Fernau, R. Niedermeier, F. Rosamand and U. Stege, \u2018Refined Search Tree Techniques for Dominating Set on Planar Graphs\u2019, Lecture Notes in Computer Science 2136 (2001) 111\u2013122.","journal-title":"Lecture Notes in Computer Science"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-46632-0_26","volume":"1741","author":"N. Bansal","year":"1999","unstructured":"N. Bansal and V. Raman, \u2018Upper Bounds for MAX-SAT further improved, Lecture Notes in Computer Science 1741 (1999) 247\u2013258.","journal-title":"Lecture Notes in Computer Science"},{"unstructured":"R. Bar-Yehuda, D. Geiger, J. Naor, R. M. Roth, \u2018Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference\u2019, Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, Virginia, (1994) 344\u2013354.","key":"22_CR4"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1613\/jair.638","volume":"12","author":"A. Becker","year":"2000","unstructured":"A Becker, R. Bar-Yehuda and D. Geiger, \u2018Random Algorithms for the Loop Cutset Problem\u2019, Journal of Artificial Intelligence Research 12 (2000) 219\u2013234.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-46784-X_30","volume":"1665","author":"J. Chen","year":"1999","unstructured":"J. Chen, I. A. Kanj and W. Jia, \u2018Vertex Cover, Further Observations and Further Improvements\u2019, Lecture Notes in Computer Science 1665 (1999) 313\u2013324.","journal-title":"Lecture Notes in Computer Science"},{"key":"22_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-45294-X_11","volume-title":"Proceedings of 21st Foundations of Software Technology and Theoretical Computer Science (FST TCS) conference","author":"J. Chen","year":"2001","unstructured":"J. Chen, D. K. Friesen, W. Jia and I. A. Kanj, \u2018Using Nondeterminism to Design Efficient Deterministic Algorithms\u2019 in Proceedings of 21st Foundations of Software Technology and Theoretical Computer Science (FST TCS) conference, Lecture Notes in Computer Science, Springer Verlag 2245 (2001) 120\u2013131."},{"doi-asserted-by":"crossref","unstructured":"R. Downey and M. R. Fellows, \u2018Parameterized Complexity\u2019, Springer Verlag 1998.","key":"22_CR8","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.5486\/PMD.1962.9.1-2.02","volume":"9","author":"P. Erdos","year":"1962","unstructured":"P. Erdos and L. Posa, \u2018On the maximal number of disjoint circuits of a graph\u2019, Publ Math. Debrecen 9 (1962) 3\u201312.","journal-title":"Publ Math. Debrecen"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"A. Itai and M. Rodeh, \u201cFinding a minimum circuit in a graph\u201d, SIAM Journal on Computing, 7 (1978) 413\u2013423.","journal-title":"SIAM Journal on Computing"},{"key":"22_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/3-540-49116-3_53","volume-title":"in Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS)","author":"R. Niedermeier","year":"1999","unstructured":"R. Niedermeier and P. Rossmanith, \u2018Upper Bounds for Vertex Cover: Further Improved\u2019, in Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science 1563 (1999) 561\u2013570."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/jagm.2000.1075","volume":"36","author":"R. Niedermeier","year":"2000","unstructured":"R. Niedermeier and P. Rossmanith, \u2018New Upper Bounds for Maximum Satisfiability\u2019, Journal of Algorithms 36 (2000) 63\u201368.","journal-title":"Journal of Algorithms"},{"unstructured":"V. Raman, \u2018Parameterized Complexity,\u2019 in Proceedings of the 7th National Seminar on Theoretical Computer Science, Chennai, India (1997), 1\u201318.","key":"22_CR13"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T13:47:23Z","timestamp":1684676843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}