1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM Journal on Algebraic and Discrete Mathematics,1987
2. Characterization and recognition of partial 3-trees;Arnborg;SIAM Journal on Algebraic and Discrete Mathematics,1986
3. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete and Applied Mathematics,1989
4. Coullard CR, Rais A, Rardin RL, Wagner DK. The 2-connected Steiner subgraph polytope for series-parallel graphs. Industrial Engineering Report Series 91-32, Purdue University, West Lafayette, IN, 1991.
5. Coullard CR, Rais A, Rardin RL, Wagner DK. The dominant of the 2-connected Steiner subgraph polytope for W4-free graphs. Industrial Engineering Report Series 91-34, Purdue University, West Lafayette, IN, 1991.