@inproceedings{a44e3cd747444db38562804c325c98c2,

title = "Hitting topological minor models in planar graphs is fixed parameter tractable",

abstract = "For a finite collection of graphs F, the F-TM-Deletion problem has as input an n-vertex graph G and an integer k and asks whether there exists a set S ⊆ V(G) with |S| ≤ k such that G\S does not contain any of the graphs in F as a topological minor. We prove that for every such F, F-TM-Deletion is fixed parameter tractable on planar graphs. In particular, we provide an f(h,k) · n2 algorithm where h is an upper bound to the vertices of the graphs in F.",

keywords = "Irrelevant vertex technique, Topological minors, Treewidth, Vertex deletion problems",

author = "Golovach, {Petr A.} and Giannos Stamoulis and Thilikos, {Dimitrios M.}",

note = "Publisher Copyright: Copyright {\textcopyright} 2020 by SIAM; 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020 ; Conference date: 05-01-2020 Through 08-01-2020",

year = "2020",

language = "English (US)",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "931--950",

editor = "Shuchi Chawla",

booktitle = "31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020",

}