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

Julien Baste, Ignasi Sau, Dimitrios M. Thilikos

Browse the full SODA paper archive.