Can You Link Up With Treewidth?

Radu Curticapean, Simon Döring, Daniel Neuen +1

In a fundamental paper in parameterized complexity theory, Marx [ToC '10] constructed $k$-vertex graphs $H$ of maximum degree $3$ such that $n^{o(k/\log k)}$ time algorithms for d…