Note sur la recherche des monomes maximaux en algebre de post. - Jean Paul Bordat (Discret. Math., 1977)

Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnes. - Jean Paul Bordat (Discret. Appl. Math., 1985)

Complexité De Problèmes Liés Aux Graphes Sans Circuit. - Jean Paul Bordat (RAIRO Theor. Informatics Appl., 1987)

Efficient polynomial algorithms for distributive lattices. - Jean Paul Bordat (Discret. Appl. Math., 1991)

Separability Generalizes Dirac's Theorem. - Anne Berry; Jean Paul Bordat (Discret. Appl. Math., 1998)

Generating All the Minimal Separators of a Graph. - Anne Berry; Jean Paul Bordat; Olivier Cogis (Int. J. Found. Comput. Sci., 2000)

Recognizing Weakly Triangulated Graphs by Edge Separability. - Anne Berry; Jean Paul Bordat; Pinar Heggernes (Nord. J. Comput., 2000)

Asteroidal triples of moplexes. - Anne Berry; Jean Paul Bordat (Discret. Appl. Math., 2001)

Moplex elimination orderings. - Anne Berry; Jean Paul Bordat (Electron. Notes Discret. Math., 2001)

Extremities and orderings defined by generalized graph search algorithms. - Anne Berry; Jean R. S. Blair; Jean Paul Bordat; Richard Krueger; Geneviève Simonet (Electron. Notes Discret. Math., 2005)

A wide-range algorithm for minimal triangulation from an arbitrary ordering. - Anne Berry; Jean Paul Bordat; Pinar Heggernes; Geneviève Simonet; Yngve Villanger (J. Algorithms, 2006)

A local approach to concept generation. - Anne Berry; Jean Paul Bordat; Alain Sigayret (Ann. Math. Artif. Intell., 2007)

Graph Extremities Defined by Search Algorithms. - Anne Berry; Jean R. S. Blair; Jean Paul Bordat; Geneviève Simonet (Algorithms, 2010)