Propriétés algorithmiques des extensions linéaires. (Algorithmical properties of linear extensions). - Vincent Bouchitté (1987)

On the Directionality of Interval Orders. - Vincent Bouchitté; Roland Jégou; Jean-Xavier Rampon (Discret. Appl. Math., 1994)

Finite Labelling Problem in Event Structures. - Marc Roland Assous; Vincent Bouchitté; Christine Charretton; Brigitte Rozoy (Theor. Comput. Sci., 1994)

Contiguity Orders. - Vincent Bouchitté; Abdelmajid Hilali; Roland Jégou; Jean-Xavier Rampon (Combinatorics and Computer Science, 1995)

Evaluating Array Expressions On Massively Parallel Machines With Communication/ Computation Overlap. - Vincent Bouchitté; Pierre Boulet; Alain Darte; Yves Robert (Int. J. High Perform. Comput. Appl., 1995)

Preface: Orders, Algorithms and Applications. - Vincent Bouchitté; Michel Habib; Michel Morvan (Theor. Comput. Sci., 1997)

On-Line Algorithms for Orders. - Vincent Bouchitté; Jean-Xavier Rampon (Theor. Comput. Sci., 1997)

Minimal Triangulations for Graphs with "Few" Minimal Separators. - Vincent Bouchitté; Ioan Todinca (ESA, 1998)

Treewidth and Minimum Fill-in of Weakly Triangulated Graphs. - Vincent Bouchitté; Ioan Todinca (STACS, 1999)

Treewidth of planar graphs: connections with duality. - Vincent Bouchitté; Frédéric Mazoit; Ioan Todinca (Electron. Notes Discret. Math., 2001)

Treewidth and Minimum Fill-in: Grouping the Minimal Separators. - Vincent Bouchitté; Ioan Todinca (SIAM J. Comput., 2001)

Listing all potential maximal cliques of a graph. - Vincent Bouchitté; Ioan Todinca (Theor. Comput. Sci., 2002)

Approximating the treewidth of AT-free graphs. - Vincent Bouchitté; Ioan Todinca (Discret. Appl. Math., 2003)

Chordal embeddings of planar graphs. - Vincent Bouchitté; Frédéric Mazoit; Ioan Todinca (Discret. Math., 2003)

On treewidth approximations. - Vincent Bouchitté; Dieter Kratsch; Haiko Müller; Ioan Todinca (Discret. Appl. Math., 2004)