Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarVincent Bouchitté
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2000 – 2009
- 2004
[j12]Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca:
On treewidth approximations. Discrete Applied Mathematics 136(2-3): 183-196 (2004)- 2003
- [j11]Vincent Bouchitté, Ioan Todinca:
Approximating the treewidth of AT-free graphs. Discrete Applied Mathematics 131(1): 11-37 (2003) - [j10]Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca:
Chordal embeddings of planar graphs. Discrete Mathematics 273(1-3): 85-102 (2003) - 2002
- [j9]Vincent Bouchitté, Ioan Todinca:
Listing all potential maximal cliques of a graph. Theor. Comput. Sci. 276(1-2): 17-32 (2002) - 2001
- [j8]Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca:
On treewidth approximations. Electronic Notes in Discrete Mathematics 8: 98-101 (2001) - [j7]Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca:
Treewidth of planar graphs: connections with duality. Electronic Notes in Discrete Mathematics 10: 34-38 (2001) - [j6]Vincent Bouchitté, Ioan Todinca:
Treewidth and Minimum Fill-in: Grouping the Minimal Separators. SIAM J. Comput. 31(1): 212-232 (2001) - 2000
- [c6]Vincent Bouchitté, Ioan Todinca:
Listing All Potential Maximal Cliques of a Graph. STACS 2000: 503-515 - [c5]
1990 – 1999
- 1999
- [c4]Vincent Bouchitté, Ioan Todinca:
Treewidth and Minimum Fill-in of Weakly Triangulated Graphs. STACS 1999: 197-206 - 1998
- [c3]Vincent Bouchitté, Ioan Todinca:
Minimal Triangulations for Graphs with "Few" Minimal Separators. ESA 1998: 344-355 - 1997
- [j5]Vincent Bouchitté, Michel Habib, Michel Morvan:
Preface: Orders, Algorithms and Applications. Theor. Comput. Sci. 175(2): 223 (1997) - [j4]Vincent Bouchitté, Jean-Xavier Rampon:
On-Line Algorithms for Orders. Theor. Comput. Sci. 175(2): 225-238 (1997) - 1995
- [j3]Vincent Bouchitté, Pierre Boulet, Alain Darte, Yves Robert:
Evaluating Array Expressions On Massively Parallel Machines With Communication/ Computation Overlap. IJHPCA 9(3): 205-219 (1995) - [c2]Vincent Bouchitté, Abdelmajid Hilali, Roland Jégou, Jean-Xavier Rampon:
Contiguity Orders. Combinatorics and Computer Science 1995: 275-287 - 1994
- [j2]Vincent Bouchitté, Roland Jégou, Jean-Xavier Rampon:
On the Directionality of Interval Orders. Discrete Applied Mathematics 48(1): 87-92 (1994) - [j1]Marc Roland Assous, Vincent Bouchitté, Christine Charretton, Brigitte Rozoy:
Finite Labelling Problem in Event Structures. Theor. Comput. Sci. 123(1): 9-19 (1994) - [c1]Vincent Bouchitté, Pierre Boulet, Alain Darte, Yves Robert:
Evaluating Array Expressions on Massively Parallel Machines with Communication/ Computation Overlap. CONPAR 1994: 713-724 - [e1]Vincent Bouchitté, Michel Morvan:
Orders, Algorithms, and Applications, International Workshop ORDAL '94, Lyon, France, July 4-8, 1994, Proceedings. Lecture Notes in Computer Science 831, Springer 1994, ISBN 3-540-58274-6 [contents]
1980 – 1989
- 1987
- [b1]Vincent Bouchitté:
Propriétés algorithmiques des extensions linéaires. (Algorithmical properties of linear extensions). Montpellier 2 University, France 1987
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2019-01-09 01:19 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
