{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:48:04Z","timestamp":1781077684974,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":73,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["715744,819416"],"award-info":[{"award-number":["715744,819416"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001742","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1176\/18"],"award-info":[{"award-number":["1176\/18"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"name":"United States - Israel Binational Science Foundation","award":["2018302"],"award-info":[{"award-number":["2018302"]}]},{"DOI":"10.13039\/501100001742","name":"Swarnajayanti Fellowship","doi-asserted-by":"publisher","award":["DST\/SJF\/MSA01\/2017-18"],"award-info":[{"award-number":["DST\/SJF\/MSA01\/2017-18"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384318","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"1317-1326","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Hitting topological minors is FPT"],"prefix":"10.1145","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[{"name":"University of Bergen, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[{"name":"University of California at Santa Barbara, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[{"name":"IIT Hyderabad, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[{"name":"IMSc, India \/ University of Bergen, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meirav","family":"Zehavi","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2016.10.001"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90006-K"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480196305124"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90020-1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796305109"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Ann Becker Reuven Bar-Yehuda and Dan Geiger. 2000. Randomized algorithms for the loop cutset problem. J. Artificial Intelligence Res. 12 ( 2000 ) 219-234.  Ann Becker Reuven Bar-Yehuda and Dan Geiger. 2000. Randomized algorithms for the loop cutset problem. J. Artificial Intelligence Res. 12 ( 2000 ) 219-234.","DOI":"10.1613\/jair.638"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0054-2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029946"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00050-6"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798338163"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629595"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.06.026"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Jianer Chen Yang Liu and Songjian Lu. 2009. An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. Algorithmica 55 1 ( 2009 ) 1-13.  Jianer Chen Yang Liu and Songjian Lu. 2009. An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. Algorithmica 55 1 ( 2009 ) 1-13.","DOI":"10.1007\/s00453-007-9130-6"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411511"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00221-3"},{"key":"e_1_3_2_1_17_1","volume-title":"Parameterized Algorithms","author":"Cygan Marek","unstructured":"Marek Cygan , Fedor V. Fomin , \u0141ukasz Kowalik , Daniel Lokshtanov , Daniel Marx , Marcin Pilipczuk , Michal Pilipczuk , and Saket Saurabh . 2015. Parameterized Algorithms . Springer-Verlag . Marek Cygan, Fedor V. Fomin, \u0141ukasz Kowalik, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. 2015. Parameterized Algorithms. Springer-Verlag."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1101821.1101823"},{"key":"e_1_3_2_1_19_1","first-page":"590","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005 )","author":"Erik","unstructured":"Erik D. Demaine and MohammadTaghi Hajiaghayi. 2005. Bidimensionality: new connections between FPT algorithms and PTASs . In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005 ) ( Vancouver, British Columbia). ACM-SIAM, New York , 590 - 601 . Erik D. Demaine and MohammadTaghi Hajiaghayi. 2005. Bidimensionality: new connections between FPT algorithms and PTASs. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005 ) (Vancouver, British Columbia). ACM-SIAM, New York, 590-601."},{"key":"e_1_3_2_1_20_1","volume-title":"Fellows","author":"Downey Rodney G.","year":"2013","unstructured":"Rodney G. Downey and Michael R . Fellows . 2013 . Fundamentals of Parameterized Complexity. Springer . Rodney G. Downey and Michael R. Fellows. 2013. Fundamentals of Parameterized Complexity. Springer."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Guy Even Joseph Naor Baruch Schieber and Madhu Sudan. 1998. Approximating Minimum Feedback Sets and Multicuts in Directed Graphs. Algorithmica 20 2 ( 1998 ) 151-174.  Guy Even Joseph Naor Baruch Schieber and Madhu Sudan. 1998. Approximating Minimum Feedback Sets and Multicuts in Directed Graphs. Algorithmica 20 2 ( 1998 ) 151-174.","DOI":"10.1007\/PL00009191"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/44483.44491"},{"key":"e_1_3_2_1_23_1","volume-title":"Parameterized Complexity Theory","author":"Flum J\u00f6rg","unstructured":"J\u00f6rg Flum and Martin Grohe . 2006. Parameterized Complexity Theory . SpringerVerlag , Berlin . 493 pages. J\u00f6rg Flum and Martin Grohe. 2006. Parameterized Complexity Theory. SpringerVerlag, Berlin. 493 pages."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3284176"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1552285.1552286"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Fedor V. Fomin Daniel Lokshtanov Neeldhara Misra and Saket Saurabh. 2012. Planar F-Deletion: Approximation Kernelization and Optimal FPT Algorithms. In FOCS.  Fedor V. Fomin Daniel Lokshtanov Neeldhara Misra and Saket Saurabh. 2012. Planar F-Deletion: Approximation Kernelization and Optimal FPT Algorithms. In FOCS.","DOI":"10.1109\/FOCS.2012.62"},{"key":"e_1_3_2_1_28_1","volume-title":"Hitting Topological Minors is FPT. arXiv:cs.DS\/","author":"Fomin Fedor V.","year":"1904","unstructured":"Fedor V. Fomin , Daniel Lokshtanov , Fahad Panolan , Saket Saurabh , and Meirav Zehavi . 2019. Hitting Topological Minors is FPT. arXiv:cs.DS\/ 1904 .02944 Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi. 2019. Hitting Topological Minors is FPT. arXiv:cs.DS\/ 1904.02944"},{"key":"e_1_3_2_1_29_1","volume-title":"Thilikos","author":"Fomin Fedor V.","year":"2010","unstructured":"Fedor V. Fomin , Daniel Lokshtanov , Saket Saurabh , and Dimitrios M . Thilikos . 2010 . Bidimensionality and Kernels. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010 ). 503-510. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M. Thilikos. 2010. Bidimensionality and Kernels. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010 ). 503-510."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/140964801"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/504794.504798"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00035-3"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.63"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2017.57"},{"key":"e_1_3_2_1_35_1","volume-title":"Thilikos","author":"Golovach Petr A.","year":"2019","unstructured":"Petr A. Golovach , Giannos Stamoulis , and Dimitrios M . Thilikos . 2019 . Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. CoRR. abs\/ 1907.02919 ( SODA 2020 to appear) ( 2019 ). arXiv: 1907.02919 http:\/\/arxiv.org\/ abs\/ 1907.02919 Petr A. Golovach, Giannos Stamoulis, and Dimitrios M. Thilikos. 2019. Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. CoRR. abs\/ 1907.02919 ( SODA 2020 to appear) ( 2019 ). arXiv: 1907.02919 http:\/\/arxiv.org\/ abs\/ 1907.02919"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993700"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.30"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3051095"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.104"},{"key":"e_1_3_2_1_40_1","volume-title":"to appear in IPEC","author":"Iwata Yoichi","year":"2019","unstructured":"Yoichi Iwata and Yusuke Kobayashi . to appear in IPEC 2019 . Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. CoRR abs\/ 1905.12233 (to appear in IPEC 2019 ). arXiv: 1905.12233 http:\/\/arxiv.org\/abs\/ 1905.12233 Yoichi Iwata and Yusuke Kobayashi. to appear in IPEC 2019. Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. CoRR abs\/ 1905.12233 (to appear in IPEC 2019 ). arXiv: 1905.12233 http:\/\/arxiv.org\/abs\/ 1905.12233"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.130"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.02.004"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.45"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2011.12.001"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2011.07.004"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.31"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.52"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.77"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2017.09.006"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2797140"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804330"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90060-4"},{"key":"e_1_3_2_1_53_1","volume-title":"to appear in SODA","author":"Li Jason","year":"2020","unstructured":"Jason Li and Jesper Nederlof . to appear in SODA 2020 . Detecting Feedback Vertex Sets of Size k in O \u22c6(2.7k ) Time. CoRR abs\/ 1906.12298 (to appear in SODA 2020 ). arXiv: 1906.12298 http:\/\/arxiv.org\/abs\/ 1906.12298 Jason Li and Jesper Nederlof. to appear in SODA 2020. Detecting Feedback Vertex Sets of Size k in O \u22c6(2.7k ) Time. CoRR abs\/ 1906.12298 (to appear in SODA 2020 ). arXiv: 1906.12298 http:\/\/arxiv.org\/abs\/ 1906.12298"},{"key":"e_1_3_2_1_54_1","volume-title":"to appear in SODA","author":"Lokshtanov Daniel","year":"2020","unstructured":"Daniel Lokshtanov , Pranabendu Misra , Joydeep Mukherjee , Geevarghese Philip , Fahad Panolan , and Saket Saurabh . to appear in SODA 2020 . A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. CoRR abs\/ 1809.08437 (to appear in SODA 2020 ). arXiv: 1809.08437 http:\/\/arxiv.org\/abs\/ 1809.08437 Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, and Saket Saurabh. to appear in SODA 2020. A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. CoRR abs\/ 1809.08437 (to appear in SODA 2020 ). arXiv: 1809.08437 http:\/\/arxiv.org\/abs\/ 1809.08437"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56939-1_60"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.007"},{"key":"e_1_3_2_1_57_1","unstructured":"Fr\u00e9d\u00e9ric Mazoit. 2013. A single exponential bound for the redundant vertex Theorem on surfaces. arXiv preprint arXiv:1309.7820 ( 2013 ).  Fr\u00e9d\u00e9ric Mazoit. 2013. A single exponential bound for the redundant vertex Theorem on surfaces. arXiv preprint arXiv:1309.7820 ( 2013 )."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"crossref","unstructured":"G. L. Nemhauser and L. E. Trotter Jr. 1974. Properties of vertex packing and independence system polyhedra. Math. Programming 6 ( 1974 ) 48-61.  G. L. Nemhauser and L. E. Trotter Jr. 1974. Properties of vertex packing and independence system polyhedra. Math. Programming 6 ( 1974 ) 48-61.","DOI":"10.1007\/BF01580222"},{"key":"e_1_3_2_1_59_1","volume-title":"Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications","author":"Niedermeier Rolf","unstructured":"Rolf Niedermeier . 2006. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications , Vol. 31 . Oxford University Press , Oxford . xii+ 300 pages. Rolf Niedermeier. 2006. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications, Vol. 31. Oxford University Press, Oxford. xii+ 300 pages."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/1597036.1597043"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.10.009"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90030-4"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90061-N"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00042-X"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.08.001"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2007.12.007"},{"key":"e_1_3_2_1_69_1","volume-title":"Approximation algorithms","author":"Vazirani Vijay V","unstructured":"Vijay V Vazirani . 2013. Approximation algorithms . Springer Science & Business Media . Vijay V Vazirani. 2013. Approximation algorithms. Springer Science & Business Media."},{"key":"e_1_3_2_1_70_1","volume-title":"The design of approximation algorithms","author":"Williamson David P","unstructured":"David P Williamson and David B Shmoys . 2011. The design of approximation algorithms . Cambridge university press . David P Williamson and David B Shmoys. 2011. The design of approximation algorithms. Cambridge university press."},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2017.06.001"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322157"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57811-0_4"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA","acronym":"STOC '20","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384318","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:13Z","timestamp":1750200073000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384318"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":73,"alternative-id":["10.1145\/3357713.3384318","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384318","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}