Demo Data from EDBT 2026 / reviewers in the wild / expert
Vincent Bouchitté
dblp:72/3190
· DBLP profile ↗
12ranked-venue papers
11as first author
0since 2021 · last 2004
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 12 · 11 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory › graph theory › graph transformation › graph modification
graph triangulation |
0.0 | 1 | 2001 | Treewidth and Minimum Fill-in: Grouping the Minimal Separators · SIAM J. Comput. 2001 |
Graph algorithms and graph theory › graph theory › graph transformation › graph modification
minimal triangulation |
0.0 | 1 | 2001 | Treewidth and Minimum Fill-in: Grouping the Minimal Separators · SIAM J. Comput. 2001 |
Graph algorithms and graph theory › graph theory › graph parameters › graph width parameters
treewidth |
0.0 | 1 | 2001 | Treewidth and Minimum Fill-in: Grouping the Minimal Separators · SIAM J. Comput. 2001 |
Methods — techniques the papers use, named apart from their topics
potential maximal clique characterization · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | On treewidth approximations
Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca |
Discret. Appl. Math. | 1 |
| 2003 | Approximating the treewidth of AT-free graphs
Vincent Bouchitté, Ioan Todinca |
Discret. Appl. Math. | 1 |
| 2002 | Listing all potential maximal cliques of a graph
Vincent Bouchitté, Ioan Todinca |
Theor. Comput. Sci. | 1 |
| 2001 | Treewidth and Minimum Fill-in: Grouping the Minimal SeparatorsabstractWe use the notion of potential maximal clique to characterize the maximal cliques appearing in minimal triangulations of a graph. We show that if these objects can be listed in polynomial time for a class of graphs, the treewidth and the minimum fill-in are polynomially tractable for these graphs. We prove that for all classes of graphs for which polynomial algorithms computing the treewidth and the minimum fill-in exist, we can list their potential maximal cliques in polynomial time. Our approach unifies these algorithms. Finally we show how to compute in polynomial time the potential maximal cliques of weakly triangulated graphs for which the treewidth and the minimum fill-in problems were open. Vincent Bouchitté, Ioan Todinca |
SIAM J. Comput. | 1 |
| 2000 | Listing All Potential Maximal Cliques of a Graph
Vincent Bouchitté, Ioan Todinca |
STACS | 1 |
| 2000 | Approximating the Treewidth of AT-Free Graphs
Vincent Bouchitté, Ioan Todinca |
WG | 1 |
| 1999 | Treewidth and Minimum Fill-in of Weakly Triangulated Graphs
Vincent Bouchitté, Ioan Todinca |
STACS | 1 |
| 1998 | Minimal Triangulations for Graphs with "Few" Minimal Separators
Vincent Bouchitté, Ioan Todinca |
ESA | 1 |
| 1997 | Preface: Orders, Algorithms and Applications
Vincent Bouchitté, Michel Habib, Michel Morvan |
Theor. Comput. Sci. | 1 |
| 1997 | On-Line Algorithms for Orders
Vincent Bouchitté, Jean-Xavier Rampon |
Theor. Comput. Sci. | 1 |
| 1994 | On the Directionality of Interval Orders
Vincent Bouchitté, Roland Jégou, Jean-Xavier Rampon |
Discret. Appl. Math. | 1 |
| 1994 | Finite Labelling Problem in Event Structures
Marc Roland Assous, Vincent Bouchitté, Christine Charretton, Brigitte Rozoy |
Theor. Comput. Sci. | 2 |