|
Search the dblp DataBase
Jean Paul Bordat:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Anne Berry, Jean Paul Bordat, Pinar Heggernes
Recognizing Weakly Triangulated Graphs by Edge Separability. [Citation Graph (0, 0)][DBLP] SWAT, 2000, pp:139-149 [Conf]
- Anne Berry, Jean Paul Bordat, Olivier Cogis
Generating All the Minimal Separators of a Graph. [Citation Graph (0, 0)][DBLP] WG, 1999, pp:167-172 [Conf]
- Anne Berry, Jean Paul Bordat
Asteroidal triples of moplexes. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:111, n:3, pp:219-229 [Journal]
- Anne Berry, Jean Paul Bordat
Separability Generalizes Dirac's Theorem. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:43-53 [Journal]
- Anne Berry, Jean Paul Bordat, Olivier Cogis
Generating All the Minimal Separators of a Graph. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:397-403 [Journal]
- Jean Paul Bordat
Complexité De Problèmes Liés Aux Graphes Sans Circuit. [Citation Graph (0, 0)][DBLP] ITA, 1987, v:21, n:2, pp:181-197 [Journal]
- Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger
A wide-range algorithm for minimal triangulation from an arbitrary ordering. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2006, v:58, n:1, pp:33-66 [Journal]
- Anne Berry, Jean Paul Bordat, Pinar Heggernes
Recognizing Weakly Triangulated Graphs by Edge Separability. [Citation Graph (0, 0)][DBLP] Nord. J. Comput., 2000, v:7, n:3, pp:164-177 [Journal]
- Anne Berry, Jean Paul Bordat, Alain Sigayret
A local approach to concept generation. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2007, v:49, n:1-4, pp:117-136 [Journal]
Efficient polynomial algorithms for distributive lattices. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|