Hitting topological minors is FPT

DOI10.1145/3357713.3384318OpenAlexW3035318934MaRDI QIDQ5145015

Daniel Lokshtanov, Saket Saurabh, Fahad Panolan, Fedor V. Fomin, Meirav Zehavi

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.02944

zbMATH Keywords

parameterized complexitytopological minor containmenttopological minor deletion

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (7)

Distance from triviality 2.0: hybrid parameterizations ⋮ Combing a Linkage in an Annulus ⋮ First-order Logic with Connectivity Operators ⋮ Strong hardness of approximation for tree transversals ⋮ Approximation algorithm for minimum weight connected-\(k\)-subgraph cover ⋮ Parameterized complexity of set-restricted disjoint paths on chordal graphs ⋮ Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable

This page was built for publication: Hitting topological minors is FPT