default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent Bouchitté
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j12]Vincent Bouchitté, Dieter Kratsch, Haiko Müller
, Ioan Todinca:
On treewidth approximations. Discret. Appl. Math. 136(2-3): 183-196 (2004)- 2003
- [j11]Vincent Bouchitté, Ioan Todinca:
Approximating the treewidth of AT-free graphs. Discret. Appl. Math. 131(1): 11-37 (2003) - [j10]Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca:
Chordal embeddings of planar graphs. Discret. Math. 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. Electron. Notes Discret. Math. 8: 98-101 (2001) - [j7]Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca:
Treewidth of planar graphs: connections with duality. Electron. Notes Discret. Math. 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]Vincent Bouchitté, Ioan Todinca:
Approximating the Treewidth of AT-Free Graphs. WG 2000: 59-70
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. Int. J. High Perform. Comput. Appl. 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. Discret. Appl. Math. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
