{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T17:25:14Z","timestamp":1784568314732,"version":"3.55.0"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-06-BLAN-0148"],"award-info":[{"award-number":["ANR-06-BLAN-0148"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2010,3]]},"abstract":"<jats:p>\n            We prove that given an undirected graph\n            <jats:italic>G<\/jats:italic>\n            on\n            <jats:italic>n<\/jats:italic>\n            vertices and an integer\n            <jats:italic>k<\/jats:italic>\n            , one can compute, in polynomial time in\n            <jats:italic>n<\/jats:italic>\n            , a graph\n            <jats:italic>G\u2032<\/jats:italic>\n            with at most 4\n            <jats:italic>k<\/jats:italic>\n            <jats:sup>2<\/jats:sup>\n            vertices and an integer\n            <jats:italic>k\u2032<\/jats:italic>\n            such that\n            <jats:italic>G<\/jats:italic>\n            has a feedback vertex set of size at most\n            <jats:italic>k<\/jats:italic>\n            iff\n            <jats:italic>G\u2032<\/jats:italic>\n            has a feedback vertex set of size at most\n            <jats:italic>k\u2032<\/jats:italic>\n            . This result improves a previous\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>k<\/jats:italic>\n            <jats:sup>11<\/jats:sup>\n            ) kernel of Burrage et al., and a more recent cubic kernel of Bodlaender. This problem was communicated by Fellows.\n          <\/jats:p>","DOI":"10.1145\/1721837.1721848","type":"journal-article","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T02:56:32Z","timestamp":1270608992000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":118,"title":["A 4\n            <i>k<\/i>\n            <sup>2<\/sup>\n            kernel for feedback vertex set"],"prefix":"10.1145","volume":"6","author":[{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"first","affiliation":[{"name":"Universit\u00e9 Montpellier II - CNRS, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,4,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622248.1622256"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054194000049"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763424.1763464"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the International Workshop on Parameterized and Exact Computation (IWPEC'06)","author":"Bodlaender H. L."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 3rd International Workshop on Parameterized and Exact Computation (IWPEC'08)","volume":"5018","author":"Bodlaender H. L."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11847250_18"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374404"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 11th Annual International Conference on Computing and Combinatorics (COCOON'05)","volume":"3595","author":"Dehne F."},{"key":"e_1_2_1_9_1","first-page":"161","article-title":"Fixed-parameter tractability and completeness","volume":"87","author":"Downey R. G.","year":"1992","journal-title":"Congressus Numer."},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Downey R. G. and Fellows M. R. 1999. Parameterized Complexity. Springer.   Downey R. G. and Fellows M. R. 1999. Parameterized Complexity. Springer.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"e_1_2_1_12_1","unstructured":"Flum J. and Grohe M. 2006. Parameterized Complexity Theory. Springer.   Flum J. and Grohe M. 2006. Parameterized Complexity Theory. Springer."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11847250_17"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02066678"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11534273_15"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 1st International Workshop on Parameterized and Exact Computation (IWPEC'04)","volume":"3162","author":"Kanj I. A."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.02.002"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.12"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Niedermeier R. 2006. Invitation to Fixed Parameter Algorithms. Oxford University Press.  Niedermeier R. 2006. Invitation to Fixed Parameter Algorithms. Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC'02)","volume":"2518","author":"Raman V."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2005.05.037"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11785293_17"},{"key":"e_1_2_1_23_1","first-page":"319","article-title":"A short proof of Mader's S -paths theorem. J. Combin.Theory","volume":"82","author":"Schrijver A.","year":"2001","journal-title":"Ser. B"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1721837.1721848","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1721837.1721848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:38Z","timestamp":1750249418000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1721837.1721848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["10.1145\/1721837.1721848"],"URL":"https:\/\/doi.org\/10.1145\/1721837.1721848","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]},"assertion":[{"value":"2008-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-04-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}