Anne Berry

Publication Activity (10 Years)

Years Active: 1998-2022
Publications (10 Years): 6

Top Topics

Maximum Cardinality

Graph Representation

Top Venues

Discret. Appl. Math.

Publications

Geneviève Simonet, Anne Berry
Properties and Recognition of Atom Graphs. Algorithms 15 (8) (2022)
Anne Berry, Geneviève Simonet
Computing the Atom Graph of a Graph and the Union Join Graph of a Hypergraph. Algorithms 14 (12) (2021)
Anne Berry, Annegret Wagler
The Normal Graph Conjecture for Two Classes of Sparse Graphs. Graphs Comb. 34 (1) (2018)
Anne Berry, Geneviève Simonet
Computing a Clique Tree with the Algorithm Maximal Label Search. Algorithms 10 (1) (2017)
Anne Berry, Geneviève Simonet
Computing a clique tree with algorithm MLS (Maximal Label Search). CoRR (2016)
Anne Berry, Geneviève Simonet
Computing the atom graph of a graph and the union join graph of a hypergraph. CoRR (2016)
Anne Berry, Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. Discret. Appl. Math. 184 (2015)
Anne Berry, Andreas Brandstädt, Konrad Engel
The Dilworth Number of Auto-Chordal Bipartite Graphs. Graphs Comb. 31 (5) (2015)
Anne Berry, Alain Gutierrez, Marianne Huchard, Amedeo Napoli, Alain Sigayret
Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation. Ann. Math. Artif. Intell. 72 (1-2) (2014)
Anne Berry, Romain Pogorelcnik, Geneviève Simonet
Organizing the atoms of the clique separator decomposition into an atom tree. Discret. Appl. Math. 177 (2014)
Anne Berry, Annegret Wagler
The Normal Graph Conjecture for Classes of Sparse Graphs. WG (2013)
Anne Berry, Andreas Brandstädt, Konrad Engel
The Dilworth Number of Auto-Chordal-Bipartite Graphs. CoRR (2013)
Anne Berry, Alain Sigayret
Dismantlable Lattices in the Mirror. ICFCA (2013)
Pierre-Alain Jachiet, Romain Pogorelcnik, Anne Berry, Philippe Lopez, Eric Bapteste
MosaicFinder: identification of fused gene families in sequence similarity networks. Bioinform. 29 (7) (2013)
Anne Berry, Alain Sigayret
A Peep through the Looking Glass: Articulation Points in Lattices. ICFCA (2012)
Anne Berry, Annegret Wagler
Triangulation and Clique Separator Decomposition of Claw-Free Graphs. WG (2012)
Anne Berry, Marianne Huchard, Amedeo Napoli, Alain Sigayret
Hermes: an Efficient Algorithm for Building Galois Sub-hierarchies. CLA (2012)
Anne Berry, Romain Pogorelcnik, Alain Sigayret
Vertical Decomposition of a Lattice Using Clique Separators. CLA (2011)
Anne Berry, Romain Pogorelcnik
A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph. Inf. Process. Lett. 111 (11) (2011)
Richard Krueger, Geneviève Simonet, Anne Berry
A General Label Search to investigate classical graph search algorithms. Discret. Appl. Math. 159 (2-3) (2011)
Anne Berry, Romain Pogorelcnik, Geneviève Simonet
An Introduction to Clique Minimal Separator Decomposition. Algorithms 3 (2) (2010)
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Geneviève Simonet
Graph Extremities Defined by Search Algorithms. Algorithms 3 (2) (2010)
Anne Berry, Richard Krueger, Geneviève Simonet
Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings. SIAM J. Discret. Math. 23 (1) (2009)
Anne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree. Theor. Comput. Sci. 409 (3) (2008)
Bangaly Kaba, Nicolas Pinet, Gaëlle Lelandais, Alain Sigayret, Anne Berry
Clustering Gene Expression Data Using Graph Separators. Silico Biol. 7 (4-5) (2007)
Anne Berry, Jean Paul Bordat, Alain Sigayret
A local approach to concept generation. Ann. Math. Artif. Intell. 49 (1-4) (2007)
Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret
Performances of Galois Sub-hierarchy-building Algorithms. ICFCA (2007)
Anne Berry, Martin Charles Golumbic, Marina Lipshteyn
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. SIAM J. Discret. Math. 21 (3) (2007)
Anne Berry, Eric SanJuan, Maurice Pouzet, Martin Charles Golumbic
Introduction to the special volume on knowledge discovery and discrete mathematics and a tribute to the memory of Peter L. Hammer. Ann. Math. Artif. Intell. 49 (1-4) (2007)
Anne Berry, Pinar Heggernes, Yngve Villanger
A vertex incremental approach for maintaining chordality. Discret. Math. 306 (3) (2006)
Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad
Very Fast Instances for Concept Generation. ICFCA (2006)
Anne Berry, Alain Sigayret, Christine Sinoquet
Maximal sub-triangulation in pre-processing phylogenetic data. Soft Comput. 10 (5) (2006)
Anne Berry, Jean R. S. Blair, Geneviève Simonet
Preface. Discret. Math. 306 (3) (2006)
Anne Berry, Eric SanJuan, Alain Sigayret
Generalized domination in closure systems. Discret. Appl. Math. 154 (7) (2006)
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) (2006)
Anne Berry, Richard Krueger, Geneviève Simonet
Ultimate Generalizations of LexBFS and LEX M. WG (2005)
Anne Berry, Alain Sigayret, Jeremy P. Spinrad
Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny. WG (2005)
Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad
Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice. ICFCA (2005)
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Richard Krueger, Geneviève Simonet
Extremities and orderings defined by generalized graph search algorithms. Electron. Notes Discret. Math. 22 (2005)
Anne Berry, Martin Charles Golumbic, Marina Lipshteyn
Two tricks to triangulate chordal probe graphs in polynomial time. SODA (2004)
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. Algorithmica 39 (4) (2004)
Anne Berry, Alain Sigayret
Representing a concept lattice by a graph. Discret. Appl. Math. 144 (1-2) (2004)
Anne Berry, Pinar Heggernes, Geneviève Simonet
The Minimum Degree Heuristic and the Minimal Triangulation Process. WG (2003)
Anne Berry, Pinar Heggernes, Yngve Villanger
A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. ISAAC (2003)
Anne Berry, Alain Sigayret
Maintaining Class Membership Information. OOIS Workshops (2002)
Anne Berry, Jean R. S. Blair, Pinar Heggernes
Maximum Cardinality Search for Computing Minimal Triangulations. WG (2002)
Anne Berry, Jean Paul Bordat
Asteroidal triples of moplexes. Discret. Appl. Math. 111 (3) (2001)
Anne Berry, Jean Paul Bordat
Moplex elimination orderings. Electron. Notes Discret. Math. 8 (2001)
Anne Berry, Jean Paul Bordat, Olivier Cogis
Generating All the Minimal Separators of a Graph. Int. J. Found. Comput. Sci. 11 (3) (2000)
Anne Berry, Jean Paul Bordat, Pinar Heggernes
Recognizing Weakly Triangulated Graphs by Edge Separability. Nord. J. Comput. 7 (3) (2000)
Anne Berry, Jean Paul Bordat, Pinar Heggernes
Recognizing Weakly Triangulated Graphs by Edge Separability. SWAT (2000)
Anne Berry, Jean Paul Bordat, Olivier Cogis
Generating All the Minimal Separators of a Graph. WG (1999)
Anne Berry
A Wide-Range Efficient Algorithm for Minimal Triangulation. SODA (1999)
Anne Berry, Jean Paul Bordat
Separability Generalizes Dirac's Theorem. Discret. Appl. Math. 84 (1-3) (1998)