A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary

DOI10.1137/1.9781611975994.57OpenAlexW3001577222MaRDI QIDQ5146828

Julien Baste, Ignasi Sau, Dimitrios M. Thilikos

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://doi.org/10.1137/1.9781611975994.57

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (9)

\(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Combing a Linkage in an Annulus ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds ⋮ Subexponential parameterized algorithms and kernelization on almost chordal graphs ⋮ Hitting minors on bounded treewidth graphs. III. Lower bounds ⋮ Hitting forbidden induced subgraphs on bounded treewidth graphs ⋮ Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs

This page was built for publication: A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary