Jean Paul Bordat

15 papers B 1Journal 13Unranked 1
YearRankTypeTitle / Venue / Authors
2010 J jnl
Graph Extremities Defined by Search Algorithms.
Algorithms
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Geneviève Simonet
2007 J jnl
A local approach to concept generation.
Ann. Math. Artif. Intell.
Anne Berry, Jean Paul Bordat, Alain Sigayret
2006 J jnl
A wide-range algorithm for minimal triangulation from an arbitrary ordering.
J. Algorithms
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger
2005 J jnl
Extremities and orderings defined by generalized graph search algorithms.
Electron. Notes Discret. Math.
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Richard Krueger, Geneviève Simonet
2001 J jnl
Asteroidal triples of moplexes.
Discret. Appl. Math.
Anne Berry, Jean Paul Bordat
2001 J jnl
Moplex elimination orderings.
Electron. Notes Discret. Math.
Anne Berry, Jean Paul Bordat
2000 J jnl
Generating All the Minimal Separators of a Graph.
Int. J. Found. Comput. Sci.
Anne Berry, Jean Paul Bordat, Olivier Cogis
2000 — conf
Recognizing Weakly Triangulated Graphs by Edge Separability.
SWAT
Anne Berry, Jean Paul Bordat, Pinar Heggernes
2000 J jnl
Recognizing Weakly Triangulated Graphs by Edge Separability.
Nord. J. Comput.
Anne Berry, Jean Paul Bordat, Pinar Heggernes
1999 B conf
Generating All the Minimal Separators of a Graph.
WG
Anne Berry, Jean Paul Bordat, Olivier Cogis
1998 J jnl
Separability Generalizes Dirac's Theorem.
Discret. Appl. Math.
Anne Berry, Jean Paul Bordat
1991 J jnl
Efficient polynomial algorithms for distributive lattices.
Discret. Appl. Math.
Jean Paul Bordat
1987 J jnl
Complexité De Problèmes Liés Aux Graphes Sans Circuit.
RAIRO Theor. Informatics Appl.
Jean Paul Bordat
1985 J jnl
Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnes.
Discret. Appl. Math.
Jean Paul Bordat
1977 J jnl
Note sur la recherche des monomes maximaux en algebre de post.
Discret. Math.
Jean Paul Bordat