Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable

DOI10.1137/1.9781611975994.56MaRDI QIDQ5146827

Dimitrios M. Thilikos, Giannos Stamoulis, Petr A. Golovach

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (5)

Combing a Linkage in an Annulus ⋮ Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm ⋮ Approximation algorithm for minimum weight connected-\(k\)-subgraph cover ⋮ Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds ⋮ Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable

This page was built for publication: Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable