Hitting minors on bounded treewidth graphs. III. Lower bounds - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Julien Baste, Ignasi Sau, Dimitrios M. Thilikos. Hitting minors on bounded treewidth graphs. III. Lower bounds. J. Comput. Syst. Sci., 109:56-77, 2020. [doi]

The following publications are possibly variants of this publication:

Hitting Minors on Bounded Treewidth Graphs. I. General Upper BoundsJulien Baste, Ignasi Sau, Dimitrios M. Thilikos. siamdm, 34(3):1623-1648, 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]

runs on WebDSL