Hitting topological minors is FPT

DOI10.1145/3357713.3384318OpenAlexW3035318934MaRDI QIDQ5145015FDOQ5145015

Authors: Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, 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)

Cited In (13)

• Approximation algorithm for minimum weight connected-\(k\)-subgraph cover
• Embedding phylogenetic trees in networks of low treewidth
• Faster parameterized algorithms for modification problems to minor-closed classes
• Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
• A more accurate view of the flat wall theorem
• First-order Logic with Connectivity Operators
• Distance from triviality 2.0: hybrid parameterizations
• Combing a Linkage in an Annulus
• Strong hardness of approximation for tree transversals
• Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
• Computing paths of large rank in planar frameworks deterministically
• A constant-factor approximation for weighted bond cover
• Parameterized complexity of set-restricted disjoint paths on chordal graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145015)