1. Some applications of nonconstructive proofs for polynomial-time decidability;Abello,1987
2. Complexity of binding embeddings in a k-tree;Arnborg,1984
3. Linear time algorithms for NP-hard problems on graphs embedded in k-trees;Arnborg,1984
4. An approach to the subgraph homeomorphism problem;Asano;Theor. Comput. Sci.,1985
5. On the complexity of covering vertices by faces in a planar graph;Bienstock,1986