Anne Berry

According to our database, Anne Berry authored at least 50 papers between 1998 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Properties and Recognition of Atom Graphs.

Geneviève Simonet, Anne Berry

Algorithms, 2022

2021

Computing the Atom Graph of a Graph and the Union Join Graph of a Hypergraph.

Anne Berry, Geneviève Simonet

Algorithms, 2021

2018

The Normal Graph Conjecture for Two Classes of Sparse Graphs.

Anne Berry, Annegret Wagler

Graphs Comb., 2018

2017

Computing a Clique Tree with the Algorithm Maximal Label Search.

Anne Berry, Geneviève Simonet

Algorithms, 2017

2016

Computing a clique tree with algorithm MLS (Maximal Label Search).

Anne Berry, Geneviève Simonet

CoRR, 2016

2015

The Dilworth Number of Auto-Chordal Bipartite Graphs.

Anne Berry, Andreas Brandstädt, Konrad Engel

Graphs Comb., 2015

Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds.

Anne Berry, Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray

Discret. Appl. Math., 2015

2014

Organizing the atoms of the clique separator decomposition into an atom tree.

Anne Berry, Romain Pogorelcnik, Geneviève Simonet

Discret. Appl. Math., 2014

Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation.

Anne Berry, Alain Gutierrez, Marianne Huchard, Amedeo Napoli, Alain Sigayret

Ann. Math. Artif. Intell., 2014

2013

MosaicFinder: identification of fused gene families in sequence similarity networks.

Pierre-Alain Jachiet, Romain Pogorelcnik, Anne Berry, Philippe Lopez, Eric Bapteste

Bioinform., 2013

The Normal Graph Conjecture for Classes of Sparse Graphs.

Anne Berry, Annegret Wagler

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Dismantlable Lattices in the Mirror.

Anne Berry, Alain Sigayret

Proceedings of the Formal Concept Analysis, 2013

2012

Triangulation and Clique Separator Decomposition of Claw-Free Graphs.

Anne Berry, Annegret Wagler

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

A Peep through the Looking Glass: Articulation Points in Lattices.

Anne Berry, Alain Sigayret

Proceedings of the Formal Concept Analysis - 10th International Conference, 2012

Hermes: an Efficient Algorithm for Building Galois Sub-hierarchies.

Anne Berry, Marianne Huchard, Amedeo Napoli, Alain Sigayret

Proceedings of The Ninth International Conference on Concept Lattices and Their Applications, 2012

2011

A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph.

Anne Berry, Romain Pogorelcnik

Inf. Process. Lett., 2011

A General Label Search to investigate classical graph search algorithms.

Richard Krueger, Geneviève Simonet, Anne Berry

Discret. Appl. Math., 2011

Vertical Decomposition of a Lattice Using Clique Separators.

Anne Berry, Romain Pogorelcnik, Alain Sigayret

Proceedings of The Eighth International Conference on Concept Lattices and Their Applications, 2011

2010

An Introduction to Clique Minimal Separator Decomposition.

Anne Berry, Romain Pogorelcnik, Geneviève Simonet

Algorithms, 2010

Graph Extremities Defined by Search Algorithms.

Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Geneviève Simonet

Algorithms, 2010

2009

Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings.

Anne Berry, Richard Krueger, Geneviève Simonet

SIAM J. Discret. Math., 2009

2008

Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree.

Anne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet

Theor. Comput. Sci., 2008

2007

Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs.

Anne Berry, Martin Charles Golumbic, Marina Lipshteyn

SIAM J. Discret. Math., 2007

Clustering Gene Expression Data Using Graph Separators.

Bangaly Kaba, Nicolas Pinet, Gaëlle Lelandais, Alain Sigayret, Anne Berry

Silico Biol., 2007

Introduction to the special volume on knowledge discovery and discrete mathematics and a tribute to the memory of Peter L. Hammer.

Anne Berry, Eric SanJuan, Maurice Pouzet, Martin Charles Golumbic

Ann. Math. Artif. Intell., 2007

A local approach to concept generation.

Anne Berry, Jean Paul Bordat, Alain Sigayret

Ann. Math. Artif. Intell., 2007

Performances of Galois Sub-hierarchy-building Algorithms.

Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret

Proceedings of the Formal Concept Analysis, 5th International Conference, 2007

2006

Maximal sub-triangulation in pre-processing phylogenetic data.

Anne Berry, Alain Sigayret, Christine Sinoquet

Soft Comput., 2006

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 vertex incremental approach for maintaining chordality.

Anne Berry, Pinar Heggernes, Yngve Villanger

Discret. Math., 2006

Preface.

Anne Berry, Jean R. S. Blair, Geneviève Simonet

Discret. Math., 2006

Generalized domination in closure systems.

Anne Berry, Eric SanJuan, Alain Sigayret

Discret. Appl. Math., 2006

Very Fast Instances for Concept Generation.

Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad

Proceedings of the Formal Concept Analysis, 4th International Conference, 2006

2005

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

Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny.

Anne Berry, Alain Sigayret, Jeremy P. Spinrad

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Ultimate Generalizations of LexBFS and LEX M.

Anne Berry, Richard Krueger, Geneviève Simonet

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice.

Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad

Proceedings of the Formal Concept Analysis, Third International Conference, 2005

2004

Representing a concept lattice by a graph.

Anne Berry, Alain Sigayret

Discret. Appl. Math., 2004

Maximum Cardinality Search for Computing Minimal Triangulations of Graphs.

Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton

Algorithmica, 2004

Two tricks to triangulate chordal probe graphs in polynomial time.

Anne Berry, Martin Charles Golumbic, Marina Lipshteyn

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

The Minimum Degree Heuristic and the Minimal Triangulation Process.

Anne Berry, Pinar Heggernes, Geneviève Simonet

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs.

Anne Berry, Pinar Heggernes, Yngve Villanger

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Maximum Cardinality Search for Computing Minimal Triangulations.

Anne Berry, Jean R. S. Blair, Pinar Heggernes

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Maintaining Class Membership Information.

Anne Berry, Alain Sigayret

Proceedings of the Advances in Object-Oriented Information Systems, 2002

2001

Moplex elimination orderings.

Anne Berry, Jean Paul Bordat

Electron. Notes Discret. Math., 2001

Asteroidal triples of moplexes.

Anne Berry, Jean Paul Bordat

Discret. Appl. Math., 2001

2000

Recognizing Weakly Triangulated Graphs by Edge Separability.

Anne Berry, Jean Paul Bordat, Pinar Heggernes

Nord. J. Comput., 2000

Generating All the Minimal Separators of a Graph.

Anne Berry, Jean Paul Bordat, Olivier Cogis

Int. J. Found. Comput. Sci., 2000

1999

A Wide-Range Efficient Algorithm for Minimal Triangulation.

Anne Berry

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Separability Generalizes Dirac's Theorem.

Anne Berry, Jean Paul Bordat

Discret. Appl. Math., 1998