1. Approximation algorithms for treewidth;Amir;Algorithmica,2010
2. S. Arnborg, A. Proskurowski, Characterization and recognition of partial k-trees, in: Proceedings of the Sixteenth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Fla., 1985, vol. 47, 1985, pp. 69–75.
3. Fourier meets Möbius: fast subset convolution;Björklund,2007
4. An O(ckn) 5-approximation algorithm for treewidth;Bodlaender,2013
5. Faster algorithms on branch and clique decompositions;Bodlaender,2010