Dynamic Programming Over Graphs of Bounded Treewidth
Treewidth and Applications
On Sparsification for Computing Treewidth
Polynomial Bounds for the Grid-Minor Theorem