2008 |
30 | EE | 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 |
29 | EE | Gabriela Arévalo,
Anne Berry,
Marianne Huchard,
Guillaume Perrot,
Alain Sigayret:
Performances of Galois Sub-hierarchy-building Algorithms.
ICFCA 2007: 166-180 |
28 | EE | 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) |
27 | EE | Anne Berry,
Jean Paul Bordat,
Alain Sigayret:
A local approach to concept generation.
Ann. Math. Artif. Intell. 49(1-4): 117-136 (2007) |
26 | EE | Anne Berry,
Martin Charles Golumbic,
Marina Lipshteyn:
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs.
SIAM J. Discrete Math. 21(3): 573-591 (2007) |
2006 |
25 | EE | Anne Berry,
Ross M. McConnell,
Alain Sigayret,
Jeremy Spinrad:
Very Fast Instances for Concept Generation.
ICFCA 2006: 119-129 |
24 | EE | Anne Berry,
Eric SanJuan,
Alain Sigayret:
Generalized domination in closure systems.
Discrete Applied Mathematics 154(7): 1064-1084 (2006) |
23 | EE | Anne Berry,
Jean R. S. Blair,
Geneviève Simonet:
Preface.
Discrete Mathematics 306(3): 293 (2006) |
22 | EE | Anne Berry,
Pinar Heggernes,
Yngve Villanger:
A vertex incremental approach for maintaining chordality.
Discrete Mathematics 306(3): 318-336 (2006) |
21 | EE | 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) |
20 | EE | Anne Berry,
Alain Sigayret,
Christine Sinoquet:
Maximal sub-triangulation in pre-processing phylogenetic data.
Soft Comput. 10(5): 461-468 (2006) |
2005 |
19 | EE | 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 |
18 | EE | Anne Berry,
Richard Krueger,
Geneviève Simonet:
Ultimate Generalizations of LexBFS and LEX M.
WG 2005: 199-213 |
17 | EE | Anne Berry,
Alain Sigayret,
Jeremy Spinrad:
Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny.
WG 2005: 445-455 |
16 | EE | 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) |
2004 |
15 | EE | Anne Berry,
Martin Charles Golumbic,
Marina Lipshteyn:
Two tricks to triangulate chordal probe graphs in polynomial time.
SODA 2004: 962-969 |
14 | EE | 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) |
13 | EE | Anne Berry,
Alain Sigayret:
Representing a concept lattice by a graph.
Discrete Applied Mathematics 144(1-2): 27-42 (2004) |
2003 |
12 | EE | Anne Berry,
Pinar Heggernes,
Yngve Villanger:
A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs.
ISAAC 2003: 47-57 |
11 | EE | Anne Berry,
Pinar Heggernes,
Geneviève Simonet:
The Minimum Degree Heuristic and the Minimal Triangulation Process.
WG 2003: 58-70 |
2002 |
10 | EE | Anne Berry,
Alain Sigayret:
Maintaining Class Membership Information.
OOIS Workshops 2002: 13-23 |
9 | EE | Anne Berry,
Jean R. S. Blair,
Pinar Heggernes:
Maximum Cardinality Search for Computing Minimal Triangulations.
WG 2002: 1-12 |
2001 |
8 | | Anne Berry,
Jean Paul Bordat:
Asteroidal triples of moplexes.
Discrete Applied Mathematics 111(3): 219-229 (2001) |
7 | EE | Anne Berry,
Jean Paul Bordat:
Moplex elimination orderings.
Electronic Notes in Discrete Mathematics 8: 6-9 (2001) |
2000 |
6 | EE | Anne Berry,
Jean Paul Bordat,
Pinar Heggernes:
Recognizing Weakly Triangulated Graphs by Edge Separability.
SWAT 2000: 139-149 |
5 | | 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) |
4 | | Anne Berry,
Jean Paul Bordat,
Pinar Heggernes:
Recognizing Weakly Triangulated Graphs by Edge Separability.
Nord. J. Comput. 7(3): 164-177 (2000) |
1999 |
3 | EE | Anne Berry:
A Wide-Range Efficient Algorithm for Minimal Triangulation.
SODA 1999: 860-861 |
2 | EE | Anne Berry,
Jean Paul Bordat,
Olivier Cogis:
Generating All the Minimal Separators of a Graph.
WG 1999: 167-172 |
1998 |
1 | EE | Anne Berry,
Jean Paul Bordat:
Separability Generalizes Dirac's Theorem.
Discrete Applied Mathematics 84(1-3): 43-53 (1998) |