|
Search the dblp DataBase
Vincent Bouchitté:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Vincent Bouchitté, Abdelmajid Hilali, Roland Jégou, Jean-Xavier Rampon
Contiguity Orders. [Citation Graph (0, 0)][DBLP] Combinatorics and Computer Science, 1995, pp:275-287 [Conf]
- Vincent Bouchitté, Pierre Boulet, Alain Darte, Yves Robert
Evaluating Array Expressions on Massively Parallel Machines with Communication/ Computation Overlap. [Citation Graph (0, 0)][DBLP] CONPAR, 1994, pp:713-724 [Conf]
- Vincent Bouchitté, Ioan Todinca
Minimal Triangulations for Graphs with "Few" Minimal Separators. [Citation Graph (0, 0)][DBLP] ESA, 1998, pp:344-355 [Conf]
- Vincent Bouchitté, Ioan Todinca
Treewidth and Minimum Fill-in of Weakly Triangulated Graphs. [Citation Graph (0, 0)][DBLP] STACS, 1999, pp:197-206 [Conf]
- Vincent Bouchitté, Ioan Todinca
Listing All Potential Maximal Cliques of a Graph. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:503-515 [Conf]
- Vincent Bouchitté, Ioan Todinca
Approximating the Treewidth of AT-Free Graphs. [Citation Graph (0, 0)][DBLP] WG, 2000, pp:59-70 [Conf]
- Vincent Bouchitté, Roland Jégou, Jean-Xavier Rampon
On the Directionality of Interval Orders. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:48, n:1, pp:87-92 [Journal]
- Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca
On treewidth approximations. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:183-196 [Journal]
- Vincent Bouchitté, Ioan Todinca
Approximating the treewidth of AT-free graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:1, pp:11-37 [Journal]
- Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca
Chordal embeddings of planar graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:273, n:1-3, pp:85-102 [Journal]
- Vincent Bouchitté, Ioan Todinca
Treewidth and Minimum Fill-in: Grouping the Minimal Separators. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2001, v:31, n:1, pp:212-232 [Journal]
- Marc Roland Assous, Vincent Bouchitté, Christine Charretton, Brigitte Rozoy
Finite Labelling Problem in Event Structures. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:123, n:1, pp:9-19 [Journal]
- Vincent Bouchitté, Michel Habib, Michel Morvan
Preface: Orders, Algorithms and Applications. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:175, n:2, pp:223- [Journal]
- Vincent Bouchitté, Jean-Xavier Rampon
On-Line Algorithms for Orders. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:175, n:2, pp:225-238 [Journal]
- Vincent Bouchitté, Ioan Todinca
Listing all potential maximal cliques of a graph. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:276, n:1-2, pp:17-32 [Journal]
Search in 0.001secs, Finished in 0.002secs
|