S. Arnborg, D. G. Corneil, and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. on Algebraic and Discrete Methods, vol.8, pp.277-284, 1987.

S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese, An algebraic theory of graph reduction, J. of ACM, vol.40, pp.1134-1164, 1993.

S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Applied Mathematics, vol.23, pp.11-24, 1989.

H. L. Bodlaender and B. De-fluiter, Reduction algorithms for constructing solutions of graphs with small treewidth, Proceedings of COCOON'96, vol.1090, pp.199-208, 1996.

V. Bouchitté and I. Todinca, Minimal triangulations for graphs with "few" minimal separators, Proceedings 6th Annual European Symposium on Algorithms (ESA'98), vol.1461, pp.344-355, 1998.

V. Bouchitté and I. Todinca, Treewidth and minimum fill-in of weakly triangulated graphs, Proceedings 16th Symposium on Theoretical Aspects of Computer Science (STACS'99), vol.1563, pp.197-206, 1999.

V. Bouchitté and I. Todinca, Listing all potential maximal cliques of a graph, Proceedings 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000, vol.1770, pp.503-515, 2000.

V. Bouchitté and I. Todinca, Approximating the treewidth of at-free graphs, Discrete Appl. Math, vol.131, issue.1, pp.11-37, 2003.

B. Courcelle and M. Moshbah, Monadic second-order evaluations on tree-decomposable graphs, Theoretical Computer Science, vol.109, pp.49-82, 1993.

E. M. Eschen and J. P. Spinrad, An O(n 2 ) algorithm for circular-arc graph recognition, Proceedings of SODA'93, pp.128-137, 1993.

M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, 1980.

T. Kloks, J. Kratochvíl, and H. Müller, New branchwidth territories, Proceedings 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS'99), vol.1563, pp.173-183, 1999.

A. Parra and P. Scheffler, Characterizations and algorithmic applications of chordal graph embeddings, Discrete Appl. Math, vol.79, issue.1-3, pp.171-188, 1997.

N. Robertson and P. D. Seymour, Graphs minors. III. Planar tree-width, J. of Combinatorial Theory Series B, vol.36, pp.49-64, 1984.

N. Robertson and P. D. Seymour, Graphs minors. II. Algorithmic aspects of tree-width, J. of Algorithms, vol.7, pp.309-322, 1986.

N. Robertson and P. D. Seymour, Graphs minors. X. Obstruction to tree-decomposition, J. of Combinatorial Theory Series B, vol.52, pp.153-190, 1991.

N. Robertson and P. D. Seymour, Graphs minors. XI. Circuits on a surface, J. of Combinatorial Theory Series B, vol.60, pp.72-106, 1994.

P. D. Seymour and R. Thomas, Call routing and the ratcatcher, Combinatorica, vol.14, issue.2, pp.217-241, 1994.

R. Sundaram, K. S. Singh, and C. Pandu-rangan, Treewidth of circular-arc graphs, SIAM J. Discrete Math, vol.7, pp.647-655, 1994.