Vincent Bouchitté

According to our database1, Vincent Bouchitté authored at least 15 papers between 1987 and 2003.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2003
Chordal embeddings of planar graphs.
Discret. Math., 2003

2001
Treewidth and Minimum Fill-in: Grouping the Minimal Separators.
SIAM J. Comput., 2001

Treewidth of planar graphs: connections with duality.
Electron. Notes Discret. Math., 2001

On treewidth approximations.
Electron. Notes Discret. Math., 2001

2000
Approximating the Treewidth of AT-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Listing All Potential Maximal Cliques of a Graph.
Proceedings of the STACS 2000, 2000

1999
Treewidth and Minimum Fill-in of Weakly Triangulated Graphs.
Proceedings of the STACS 99, 1999

1998
Minimal Triangulations for Graphs with "Few" Minimal Separators.
Proceedings of the Algorithms, 1998

1997
On-Line Algorithms for Orders.
Theor. Comput. Sci., 1997

Preface: Orders, Algorithms and Applications.
Theor. Comput. Sci., 1997

1995
Contiguity Orders.
Proceedings of the Combinatorics and Computer Science, 1995

1994
Finite Labelling Problem in Event Structures.
Theor. Comput. Sci., 1994

On the Directionality of Interval Orders.
Discret. Appl. Math., 1994

Evaluating Array Expressions on Massively Parallel Machines with Communication/ Computation Overlap.
Proceedings of the Parallel Processing: CONPAR 94, 1994

1987
Propriétés algorithmiques des extensions linéaires. (Algorithmical properties of linear extensions).
PhD thesis, 1987


  Loading...