| 2007 |
|---|
| 12 | EE | Anne Berry,
Jean Paul Bordat,
Alain Sigayret:
A local approach to concept generation.
Ann. Math. Artif. Intell. 49(1-4): 117-136 (2007) |
| 2006 |
|---|
| 11 | EE | Anne Berry,
Jean Paul Bordat,
Pinar Heggernes,
Geneviève Simonet,
Yngve Villanger:
A wide-range algorithm for minimal triangulation from an arbitrary ordering.
J. Algorithms 58(1): 33-66 (2006) |
| 2005 |
|---|
| 10 | EE | Anne Berry,
Jean R. S. Blair,
Jean Paul Bordat,
Richard Krueger,
Geneviève Simonet:
Extremities and orderings defined by generalized graph search algorithms.
Electronic Notes in Discrete Mathematics 22: 413-420 (2005) |
| 2001 |
|---|
| 9 | | Anne Berry,
Jean Paul Bordat:
Asteroidal triples of moplexes.
Discrete Applied Mathematics 111(3): 219-229 (2001) |
| 8 | EE | Anne Berry,
Jean Paul Bordat:
Moplex elimination orderings.
Electronic Notes in Discrete Mathematics 8: 6-9 (2001) |
| 2000 |
|---|
| 7 | EE | Anne Berry,
Jean Paul Bordat,
Pinar Heggernes:
Recognizing Weakly Triangulated Graphs by Edge Separability.
SWAT 2000: 139-149 |
| 6 | | Anne Berry,
Jean Paul Bordat,
Olivier Cogis:
Generating All the Minimal Separators of a Graph.
Int. J. Found. Comput. Sci. 11(3): 397-403 (2000) |
| 5 | | Anne Berry,
Jean Paul Bordat,
Pinar Heggernes:
Recognizing Weakly Triangulated Graphs by Edge Separability.
Nord. J. Comput. 7(3): 164-177 (2000) |
| 1999 |
|---|
| 4 | EE | Anne Berry,
Jean Paul Bordat,
Olivier Cogis:
Generating All the Minimal Separators of a Graph.
WG 1999: 167-172 |
| 1998 |
|---|
| 3 | EE | Anne Berry,
Jean Paul Bordat:
Separability Generalizes Dirac's Theorem.
Discrete Applied Mathematics 84(1-3): 43-53 (1998) |
| 1991 |
|---|
| 2 | EE | Jean Paul Bordat:
Efficient polynomial algorithms for distributive lattices.
Discrete Applied Mathematics 32(1): 31-50 (1991) |
| 1987 |
|---|
| 1 | | Jean Paul Bordat:
Complexité De Problèmes Liés Aux Graphes Sans Circuit.
ITA 21(2): 181-197 (1987) |
