{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:45:48Z","timestamp":1770993948013,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,4,5]],"date-time":"2011-04-05T00:00:00Z","timestamp":1301961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s10878-011-9394-2","type":"journal-article","created":{"date-parts":[[2011,4,4]],"date-time":"2011-04-04T20:43:39Z","timestamp":1301949819000},"page":"131-146","source":"Crossref","is-referenced-by-count":29,"title":["FPT algorithms for Connected Feedback Vertex Set"],"prefix":"10.1007","volume":"24","author":[{"given":"Neeldhara","family":"Misra","sequence":"first","affiliation":[]},{"given":"Geevarghese","family":"Philip","sequence":"additional","affiliation":[]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]},{"given":"Somnath","family":"Sikdar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,5]]},"reference":[{"key":"9394_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: theory, algorithms and applications","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen J, Gutin GZ (2009) Digraphs: theory, algorithms and applications, 2nd edn. Springer, Berlin","edition":"2"},{"key":"9394_CR2","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/3-540-55121-2_24","volume-title":"Proceedings on graph\u2013theoretic concepts in computer science (WG \u201991)","author":"HL Bodlaender","year":"1992","unstructured":"Bodlaender HL (1992) On disjoint cycles. In: Schmidt G, Berghammer R (eds) Proceedings on graph\u2013theoretic concepts in computer science (WG \u201991). LNCS, vol\u00a0570. Springer, Berlin, pp 230\u2013238"},{"issue":"6","key":"9394_CR3","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender HL (1996) A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J Comput 25(6):1305\u20131317","journal-title":"SIAM J Comput"},{"key":"9394_CR4","series-title":"LNCS","first-page":"563","volume-title":"Proceedings of ICALP 2008","author":"HL Bodlaender","year":"2008","unstructured":"Bodlaender HL, Downey RG, Fellows MR, Hermelin D (2008) On problems without polynomial kernels (extended abstract). In: Proceedings of ICALP 2008, LNCS. Springer, Berlin, pp 563\u2013574"},{"key":"9394_CR5","series-title":"Lecture notes in computer science","first-page":"93","volume-title":"SWAT","author":"Y Cao","year":"2010","unstructured":"Cao Y, Chen J, Liu Y (2010) On feedback vertex set: new measure and new structures. In: Kaplan H (ed) SWAT. Lecture notes in computer science, vol 6139. Springer, Berlin, pp 93\u2013104"},{"key":"9394_CR6","series-title":"LNCS","first-page":"859","volume-title":"Proceedings of COCOON 2005","author":"F Dehne","year":"2005","unstructured":"Dehne F, Fellows M, Langston MA, Rosamond F, Stevens K (2005) An O(2 O(k) n 3) FPT-algorithm for the undirected feedback vertex set problem. In: Proceedings of COCOON 2005. LNCS, vol 3595. Springer, Berlin, pp 859\u2013869"},{"issue":"1","key":"9394_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s00493-008-2140-4","volume":"28","author":"ED Demaine","year":"2008","unstructured":"Demaine ED, Hajiaghayi M (2008) Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica 28(1):19\u201336","journal-title":"Combinatorica"},{"key":"9394_CR8","first-page":"637","volume-title":"Proceedings of FOCS 2005","author":"ED Demaine","year":"2005","unstructured":"Demaine ED, Hajiaghayi M, Kawarabayashi K (2005) Algorithmic graph minor theory: decomposition, approximation, and coloring. In: Proceedings of FOCS 2005. IEEE Comput Soc, Los Alamitos, pp\u00a0637\u2013646"},{"key":"9394_CR9","volume-title":"Graph theory","author":"R Diestel","year":"2005","unstructured":"Diestel R (2005) Graph theory, 3rd edn. Springer, Heidelberg","edition":"3"},{"key":"9394_CR10","first-page":"836","volume-title":"ICDE","author":"B Ding","year":"2007","unstructured":"Ding B, Yu JX, Wang S, Qin L, Zhang X, Lin X (2007) Finding top-k min-cost connected trees in databases. In: ICDE. IEEE Press, New York, pp 836\u2013845"},{"key":"9394_CR11","series-title":"LNCS","first-page":"378","volume-title":"Proceedings of ICALP 2009","author":"M Dom","year":"2009","unstructured":"Dom M, Lokshtanov D, Saurabh S (2009) Incompressibility through Colors and IDs. In: Proceedings of ICALP 2009. LNCS, vol 5555. Springer, Berlin, pp 378\u2013389"},{"key":"9394_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"RG Downey","year":"1999","unstructured":"Downey RG, Fellows MR (1999) Parameterized complexity. Springer, New York"},{"key":"9394_CR13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/978-1-4757-3023-4_4","volume-title":"Handbook of combinatorial optimization","author":"P Festa","year":"1999","unstructured":"Festa P, Pardalos PM, Resende MGC (1999) Feedback set problems. In: Handbook of combinatorial optimization. Kluwer Academic, Dordrecht, pp 209\u2013258"},{"key":"9394_CR14","series-title":"Texts in theoretical computer science. An EATCS series","volume-title":"Parameterized complexity theory","author":"J Flum","year":"2006","unstructured":"Flum J, Grohe M (2006) Parameterized complexity theory. Texts in theoretical computer science. An EATCS series. Springer, Berlin"},{"issue":"2","key":"9394_CR15","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s00453-007-9145-z","volume":"52","author":"FV Fomin","year":"2008","unstructured":"Fomin FV, Grandoni F, Kratsch D (2008) Solving connected dominating set faster than 2 n . Algorithmica 52(2):153\u2013166","journal-title":"Algorithmica"},{"key":"9394_CR16","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/1.9781611973075.43","volume-title":"Proceedings of the 21th ACM-SIAM symposium on discrete algorithms (SODA 2010)","author":"FV Fomin","year":"2010","unstructured":"Fomin FV, Lokshtanov D, Saurabh S, Thilikos DM (2010) Bidimensionality and kernels. In: Proceedings of the 21th ACM-SIAM symposium on discrete algorithms (SODA 2010). ACM\/SIAM, New York\/Philadelphia, pp 503\u2013510"},{"key":"9394_CR17","series-title":"Lecture notes in computer science","first-page":"143","volume-title":"Graph-theoretic concepts in computer science, 35th international workshop, WG 2009","author":"A Grigoriev","year":"2009","unstructured":"Grigoriev A, Sitters R (2009) Connected feedback vertex set in planar graphs. In: Graph-theoretic concepts in computer science, 35th international workshop, WG 2009, Montpellier, France, June 24\u201326, 2009. Lecture notes in computer science, vol 5911. Springer, Berlin, pp 143\u2013153"},{"issue":"8","key":"9394_CR18","doi-asserted-by":"crossref","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 (2006) Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J Comput Syst Sci 72(8):1386\u20131396","journal-title":"J Comput Syst Sci"},{"key":"9394_CR19","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and homomorphisms","author":"P Hell","year":"2004","unstructured":"Hell P, Ne\u0161et\u0159il J (2004) Graphs and homomorphisms. Oxford University Press, London"},{"issue":"2","key":"9394_CR20","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/s00224-007-9089-3","volume":"43","author":"D M\u00f6lle","year":"2008","unstructured":"M\u00f6lle D, Richter S, Rossmanith P (2008) Enumerate and expand: improved algorithms for connected vertex cover and tree cover. Theory Comput Syst 43(2):234\u2013253","journal-title":"Theory Comput Syst"},{"key":"9394_CR21","unstructured":"Moser H (2005) Exact algorithms for generalizations of vertex cover. Master\u2019s thesis, Institut f\u00fcr Informatik, Friedrich-Schiller-Universit\u00e4t"},{"key":"9394_CR22","first-page":"713","volume-title":"Proceedings of ICALP 2009","author":"J Nederlof","year":"2009","unstructured":"Nederlof J (2009) Fast polynomial-space algorithms using M\u00f6bius inversion: improving on Steiner tree and related problems. In: Proceedings of ICALP 2009, pp 713\u2013725"},{"key":"9394_CR23","series-title":"Oxford lecture series in mathematics and its applications","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier R (2006) Invitation to fixed-parameter algorithms. Oxford lecture series in mathematics and its applications, vol 31. Oxford University Press, Oxford"},{"key":"9394_CR24","first-page":"115","volume-title":"Proceedings of SODA 2009","author":"S Thomass\u00e9","year":"2009","unstructured":"Thomass\u00e9 S (2009) A quadratic kernel for feedback vertex set. In: Proceedings of SODA 2009. SIAM, Philadelphia, pp 115\u2013119"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9394-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9394-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9394-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T17:30:19Z","timestamp":1560101419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9394-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,5]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["9394"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9394-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,5]]}}}