A. Berry, J. P. Bordat, and O. Cogis, Generating all the minimal separators of a graph, Workshop on Graphs (WG'99), vol.1665, 1999.

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, 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.

T. Kloks, H. L. Bodlaender, H. Müller, and D. Kratsch, Computing treewidth and minimum fill-in: all you need are the minimal separators, Proceedings First Annual European Symposium on Algorithms (ESA'93), vol.726, pp.260-271, 1993.

T. Kloks and D. Kratsch, Finding all minimal separators of a graph, Proceedings 11th Annual Symposium on Theoretical Aspects of Computer Science (STACS'94), vol.775, pp.759-768, 1994.

T. Kloks and D. Kratsch, Listing all minimal separators of a graph, SIAM J. Comput, vol.27, issue.3, pp.605-613, 1998.

A. Parra, Structural and Algorithmic Aspects of Chordal Graph Embeddings, 1996.

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.

H. Shen and W. Liang, Efficient enumeration of all minimal separators in a graph, Theoretical Computer Science, vol.180, pp.169-180, 1997.

I. Todinca, Aspects algorithmiques des triangulations minimales des graphes, 1999.