| 2013 | ||
|---|---|---|
| j23 | Pierre-Alain Jachiet, Romain Pogorelcnik, Anne Berry, Philippe Lopez, Eric Bapteste: MosaicFinder: identification of fused gene families in sequence similarity networks. Bioinformatics 29(7): 837-844 (2013) | |
| 2012 | ||
| c17 | Anne Berry, Marianne Huchard, Amedeo Napoli, Alain Sigayret: Hermes: an Efficient Algorithm for Building Galois Sub-hierarchies. CLA 2012: 21-32 | |
| c16 | Anne Berry, Alain Sigayret: A Peep through the Looking Glass: Articulation Points in Lattices. ICFCA 2012: 45-60 | |
| c15 | Anne Berry, Annegret Wagler: Triangulation and Clique Separator Decomposition of Claw-Free Graphs. WG 2012: 7-21 | |
| 2011 | ||
| j22 | Richard Krueger, Geneviève Simonet, Anne Berry: A General Label Search to investigate classical graph search algorithms. Discrete Applied Mathematics 159(2-3): 128-142 (2011) | |
| j21 | 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): 508-511 (2011) | |
| c14 | Anne Berry, Romain Pogorelcnik, Alain Sigayret: Vertical Decomposition of a Lattice Using Clique Separators. CLA 2011: 15-29 | |
| 2010 | ||
| j20 | Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Geneviève Simonet: Graph Extremities Defined by Search Algorithms. Algorithms 3(2): 100-124 (2010) | |
| j19 | Anne Berry, Romain Pogorelcnik, Geneviève Simonet: An Introduction to Clique Minimal Separator Decomposition. Algorithms 3(2): 197-215 (2010) | |
| 2009 | ||
| j18 | Anne Berry, Richard Krueger, Geneviève Simonet: Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings. SIAM J. Discrete Math. 23(1): 428-446 (2009) | |
| 2008 | ||
| j17 | 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): 601-616 (2008) | |
| 2007 | ||
| j16 | 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): 1-4 (2007) | |
| j15 | Anne Berry, Jean Paul Bordat, Alain Sigayret: A local approach to concept generation. Ann. Math. Artif. Intell. 49(1-4): 117-136 (2007) | |
| j14 | Anne Berry, Martin Charles Golumbic, Marina Lipshteyn: Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. SIAM J. Discrete Math. 21(3): 573-591 (2007) | |
| c13 | Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret: Performances of Galois Sub-hierarchy-building Algorithms. ICFCA 2007: 166-180 | |
| 2006 | ||
| j13 | Anne Berry, Eric SanJuan, Alain Sigayret: Generalized domination in closure systems. Discrete Applied Mathematics 154(7): 1064-1084 (2006) | |
| j12 | ||
| j11 | Anne Berry, Pinar Heggernes, Yngve Villanger: A vertex incremental approach for maintaining chordality. Discrete Mathematics 306(3): 318-336 (2006) | |
| j10 | 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): 33-66 (2006) | |
| j9 | Anne Berry, Alain Sigayret, Christine Sinoquet: Maximal sub-triangulation in pre-processing phylogenetic data. Soft Comput. 10(5): 461-468 (2006) | |
| c12 | Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy Spinrad: Very Fast Instances for Concept Generation. ICFCA 2006: 119-129 | |
| 2005 | ||
| j8 | Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Richard Krueger, Geneviève Simonet: Extremities and orderings defined by generalized graph search algorithms. Electronic Notes in Discrete Mathematics 22: 413-420 (2005) | |
| c11 | Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy Spinrad: Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice. ICFCA 2005: 208-222 | |
| c10 | Anne Berry, Richard Krueger, Geneviève Simonet: Ultimate Generalizations of LexBFS and LEX M. WG 2005: 199-213 | |
| c9 | Anne Berry, Alain Sigayret, Jeremy Spinrad: Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny. WG 2005: 445-455 | |
| 2004 | ||
| j7 | Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton: Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. Algorithmica 39(4): 287-298 (2004) | |
| j6 | Anne Berry, Alain Sigayret: Representing a concept lattice by a graph. Discrete Applied Mathematics 144(1-2): 27-42 (2004) | |
| c8 | Anne Berry, Martin Charles Golumbic, Marina Lipshteyn: Two tricks to triangulate chordal probe graphs in polynomial time. SODA 2004: 962-969 | |
| 2003 | ||
| c7 | Anne Berry, Pinar Heggernes, Yngve Villanger: A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. ISAAC 2003: 47-57 | |
| c6 | Anne Berry, Pinar Heggernes, Geneviève Simonet: The Minimum Degree Heuristic and the Minimal Triangulation Process. WG 2003: 58-70 | |
| 2002 | ||
| c5 | ||
| c4 | Anne Berry, Jean R. S. Blair, Pinar Heggernes: Maximum Cardinality Search for Computing Minimal Triangulations. WG 2002: 1-12 | |
| 2001 | ||
| j5 | Anne Berry, Jean Paul Bordat: Asteroidal triples of moplexes. Discrete Applied Mathematics 111(3): 219-229 (2001) | |
| j4 | Anne Berry, Jean Paul Bordat: Moplex elimination orderings. Electronic Notes in Discrete Mathematics 8: 6-9 (2001) | |
| 2000 | ||
| j3 | Anne Berry, Jean Paul Bordat, Olivier Cogis: Generating All the Minimal Separators of a Graph. Int. J. Found. Comput. Sci. 11(3): 397-403 (2000) | |
| j2 | Anne Berry, Jean Paul Bordat, Pinar Heggernes: Recognizing Weakly Triangulated Graphs by Edge Separability. Nord. J. Comput. 7(3): 164-177 (2000) | |
| c3 | Anne Berry, Jean Paul Bordat, Pinar Heggernes: Recognizing Weakly Triangulated Graphs by Edge Separability. SWAT 2000: 139-149 | |
| 1999 | ||
| c2 | ||
| c1 | Anne Berry, Jean Paul Bordat, Olivier Cogis: Generating All the Minimal Separators of a Graph. WG 1999: 167-172 | |
| 1998 | ||
| j1 | Anne Berry, Jean Paul Bordat: Separability Generalizes Dirac's Theorem. Discrete Applied Mathematics 84(1-3): 43-53 (1998) | |
Data released under the ODC-BY 1.0 license — See also our legal information page