The following publications are possibly variants of this publication:
- Hitting minors on bounded treewidth graphs. III. Lower boundsJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. jcss, 109:56-77, 2020. [doi]
- Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded TreewidthJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. iwpec 2018: [doi]
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal AlgorithmJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. SICOMP, 52(4):865-912, August 2023. [doi]
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithmsJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. TCS, 814:135-152, 2020. [doi]
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundaryJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. soda 2020: 951-970 [doi]
- Hitting forbidden induced subgraphs on bounded treewidth graphsIgnasi Sau, Uéverton dos Santos Souza. iandc, 281:104812, 2021. [doi]
- Hitting Forbidden Induced Subgraphs on Bounded Treewidth GraphsIgnasi Sau, Uéverton dos Santos Souza. mfcs 2020: [doi]