1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
2. Monotonicity in graph searching;Bienstock;J. Algorithms,1991
3. Improved self-reduction algorithms for graphs with bounded treewidth;Bodlaender,1989
4. Better algorithm for the pathwidth and treewidth of graphs;Bodlaender,1991
5. An intuitive approach to speleotopology;Breisch,1967