1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
2. An algebraic theory of graph reduction;Arnborg;J. ACM,1993
3. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989
4. Generating all the minimal separators of a graph, Workshop on Graph-theoretic Concepts in Computer Science (WG’99);Berry,1999
5. A tourist guide through treewidth;Bodlaender;Acta Cybernet.,1993