A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
From MaRDI portal
Publication:5146828
DOI10.1137/1.9781611975994.57MaRDI QIDQ5146828
Ignasi Sau, Dimitrios M. Thilikos, Julien Baste
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
68Wxx: Algorithms in computer science