Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal.

Karl Bringmann, Jasper Slusallek

Browse the full ICALP paper archive.