| 2013 | ICFCA | Dismantlable Lattices in the Mirror. | Anne Berry, Alain Sigayret |
| 2013 | WG | The Normal Graph Conjecture for Classes of Sparse Graphs. | Anne Berry, Annegret K. Wagler |
| 2012 | ICFCA | A Peep through the Looking Glass: Articulation Points in Lattices. | Anne Berry, Alain Sigayret |
| 2012 | WG | Triangulation and Clique Separator Decomposition of Claw-Free Graphs. | Anne Berry, Annegret K. Wagler |
| 2007 | ICFCA | Performances of Galois Sub-hierarchy-building Algorithms. | Gabriela Arvalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret |
| 2006 | ICFCA | Very Fast Instances for Concept Generation. | Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad |
| 2005 | ICFCA | 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 |
| 2005 | WG | Ultimate Generalizations of LexBFS and LEX M. | Anne Berry, Richard Krueger, Genevive Simonet |
| 2005 | WG | Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny. | Anne Berry, Alain Sigayret, Jeremy P. Spinrad |
| 2004 | SODA | Two tricks to triangulate chordal probe graphs in polynomial time. | Anne Berry, Martin Charles Golumbic, Marina Lipshteyn |
| 2003 | ISAAC | A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. | Anne Berry, Pinar Heggernes, Yngve Villanger |
| 2003 | WG | The Minimum Degree Heuristic and the Minimal Triangulation Process. | Anne Berry, Pinar Heggernes, Genevive Simonet |
| 2002 | WG | Maximum Cardinality Search for Computing Minimal Triangulations. | Anne Berry, Jean R. S. Blair, Pinar Heggernes |
| 1999 | SODA | A Wide-Range Efficient Algorithm for Minimal Triangulation. | Anne Berry |
| 1999 | WG | Generating All the Minimal Separators of a Graph. | Anne Berry, Jean Paul Bordat, Olivier Cogis |