Properties and Recognition of Atom Graphs. - Simonet, Geneviève; Berry, Anne (Algorithms, 2022)

Computing the Atom Graph of a Graph and the Union Join Graph of a Hypergraph. - Berry, Anne; Simonet, Geneviève (Algorithms, 2021)

The Normal Graph Conjecture for Two Classes of Sparse Graphs. - Berry, Anne; Wagler, Annegret (Graphs Comb., 2018)

Computing a Clique Tree with the Algorithm Maximal Label Search. - Berry, Anne; Simonet, Geneviève (Algorithms, 2017)

Computing the atom graph of a graph and the union join graph of a hypergraph. - Berry, Anne; Simonet, Geneviève (CoRR, 2016)

Computing a clique tree with algorithm MLS (Maximal Label Search). - Berry, Anne; Simonet, Geneviève (CoRR, 2016)

Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. - Berry, Anne; Brandstädt, Andreas; Giakoumakis, Vassilis; Maffray, Frédéric (Discret. Appl. Math., 2015)

The Dilworth Number of Auto-Chordal Bipartite Graphs. - Berry, Anne; Brandstädt, Andreas; Engel, Konrad (Graphs Comb., 2015)

Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation. - Berry, Anne; Gutierrez, Alain; Huchard, Marianne; Napoli, Amedeo; Sigayret, Alain (Ann. Math. Artif. Intell., 2014)

Organizing the atoms of the clique separator decomposition into an atom tree. - Berry, Anne; Pogorelcnik, Romain; Simonet, Geneviève (Discret. Appl. Math., 2014)

MosaicFinder: identification of fused gene families in sequence similarity networks. - Jachiet, Pierre-Alain; Pogorelcnik, Romain; Berry, Anne; Lopez, Philippe; Bapteste, Eric (Bioinform., 2013)

Dismantlable Lattices in the Mirror. - Berry, Anne; Sigayret, Alain (2013)

The Normal Graph Conjecture for Classes of Sparse Graphs. - Berry, Anne; Wagler, Annegret (2013)

The Dilworth Number of Auto-Chordal-Bipartite Graphs. - Berry, Anne; Brandstädt, Andreas; Engel, Konrad (CoRR, 2013)

Hermes: an Efficient Algorithm for Building Galois Sub-hierarchies. - Berry, Anne; Huchard, Marianne; Napoli, Amedeo; Sigayret, Alain (2012)

A Peep through the Looking Glass: Articulation Points in Lattices. - Berry, Anne; Sigayret, Alain (2012)

Triangulation and Clique Separator Decomposition of Claw-Free Graphs. - Berry, Anne; Wagler, Annegret (2012)

A General Label Search to investigate classical graph search algorithms. - Krueger, Richard; Simonet, Geneviève; Berry, Anne (Discret. Appl. Math., 2011)

A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph. - Berry, Anne; Pogorelcnik, Romain (Inf. Process. Lett., 2011)

Vertical Decomposition of a Lattice Using Clique Separators. - Berry, Anne; Pogorelcnik, Romain; Sigayret, Alain (2011)

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

An Introduction to Clique Minimal Separator Decomposition. - Berry, Anne; Pogorelcnik, Romain; Simonet, Geneviève (Algorithms, 2010)

Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings. - Berry, Anne; Krueger, Richard; Simonet, Geneviève (SIAM J. Discret. Math., 2009)

Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree. - Berry, Anne; Dahlhaus, Elias; Heggernes, Pinar; Simonet, Geneviève (Theor. Comput. Sci., 2008)

Introduction to the special volume on knowledge discovery and discrete mathematics and a tribute to the memory of Peter L. Hammer. - Berry, Anne; SanJuan, Eric; Pouzet, Maurice; Golumbic, Martin Charles (Ann. Math. Artif. Intell., 2007)

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

Clustering Gene Expression Data Using Graph Separators. - Kaba, Bangaly; Pinet, Nicolas; Lelandais, Gaëlle; Sigayret, Alain; Berry, Anne (Silico Biol., 2007)

Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. - Berry, Anne; Golumbic, Martin Charles; Lipshteyn, Marina (SIAM J. Discret. Math., 2007)

Performances of Galois Sub-hierarchy-building Algorithms. - Arévalo, Gabriela; Berry, Anne; Huchard, Marianne; Perrot, Guillaume; Sigayret, Alain (2007)

Generalized domination in closure systems. - Berry, Anne; SanJuan, Eric; Sigayret, Alain (Discret. Appl. Math., 2006)

Preface. - Berry, Anne; Blair, Jean R. S.; Simonet, Geneviève (Discret. Math., 2006)

A vertex incremental approach for maintaining chordality. - Berry, Anne; Heggernes, Pinar; Villanger, Yngve (Discret. Math., 2006)

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

Maximal sub-triangulation in pre-processing phylogenetic data. - Berry, Anne; Sigayret, Alain; Sinoquet, Christine (Soft Comput., 2006)

Very Fast Instances for Concept Generation. - Berry, Anne; McConnell, Ross M.; Sigayret, Alain; Spinrad, Jeremy P. (2006)

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

Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice. - Berry, Anne; Huchard, Marianne; McConnell, Ross M.; Sigayret, Alain; Spinrad, Jeremy P. (2005)

Ultimate Generalizations of LexBFS and LEX M. - Berry, Anne; Krueger, Richard; Simonet, Geneviève (2005)

Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny. - Berry, Anne; Sigayret, Alain; Spinrad, Jeremy P. (2005)

Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. - Berry, Anne; Blair, Jean R. S.; Heggernes, Pinar; Peyton, Barry W. (Algorithmica, 2004)

Representing a concept lattice by a graph. - Berry, Anne; Sigayret, Alain (Discret. Appl. Math., 2004)

Two tricks to triangulate chordal probe graphs in polynomial time. - Berry, Anne; Golumbic, Martin Charles; Lipshteyn, Marina (2004)

A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. - Berry, Anne; Heggernes, Pinar; Villanger, Yngve (2003)

The Minimum Degree Heuristic and the Minimal Triangulation Process. - Berry, Anne; Heggernes, Pinar; Simonet, Geneviève (2003)

Maintaining Class Membership Information. - Berry, Anne; Sigayret, Alain (2002)

Maximum Cardinality Search for Computing Minimal Triangulations. - Berry, Anne; Blair, Jean R. S.; Heggernes, Pinar (2002)

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

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

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

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

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

A Wide-Range Efficient Algorithm for Minimal Triangulation. - Berry, Anne (1999)

Generating All the Minimal Separators of a Graph. - Berry, Anne; Bordat, Jean Paul; Cogis, Olivier (1999)

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