dblp.uni-trier.dewww.uni-trier.de

Anne Berry

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

Coauthor Index

1Gabriela Arévalo [29]
2Jean R. S. Blair [9] [14] [16] [23]
3Jean Paul Bordat [1] [2] [4] [5] [6] [7] [8] [16] [21] [27]
4Olivier Cogis [2] [5]
5Elias Dahlhaus [30]
6Martin Charles Golumbic [15] [26] [28]
7Pinar Heggernes [4] [6] [9] [11] [12] [14] [21] [22] [30]
8Marianne Huchard [19] [29]
9Richard Krueger [16] [18]
10Marina Lipshteyn [15] [26]
11Ross M. McConnell [19] [25]
12Guillaume Perrot [29]
13Barry W. Peyton [14]
14Maurice Pouzet [28]
15Eric SanJuan [24] [28]
16Alain Sigayret [10] [13] [17] [19] [20] [24] [25] [27] [29]
17Geneviève Simonet [11] [16] [18] [21] [23] [30]
18Christine Sinoquet [20]
19Jeremy Spinrad [17] [19] [25]
20Yngve Villanger [12] [21] [22]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)