Anne Berry - RankMe

54 papers A* 2B 8C 5Journal 35Unranked 4

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Properties and Recognition of Atom Graphs. Algorithms Geneviève Simonet, Anne Berry
2021	J	`jnl`	Computing the Atom Graph of a Graph and the Union Join Graph of a Hypergraph. Algorithms Anne Berry, Geneviève Simonet
2018	J	`jnl`	The Normal Graph Conjecture for Two Classes of Sparse Graphs. Graphs Comb. Anne Berry, Annegret K. Wagler
2017	J	`jnl`	Computing a Clique Tree with the Algorithm Maximal Label Search. Algorithms Anne Berry, Geneviève Simonet
2016	J	`jnl`	Computing a clique tree with algorithm MLS (Maximal Label Search). CoRR Anne Berry, Geneviève Simonet
2016	J	`jnl`	Computing the atom graph of a graph and the union join graph of a hypergraph. CoRR Anne Berry, Geneviève Simonet
2015	J	`jnl`	Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. Discret. Appl. Math. Anne Berry, Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray
2015	J	`jnl`	The Dilworth Number of Auto-Chordal Bipartite Graphs. Graphs Comb. Anne Berry, Andreas Brandstädt, Konrad Engel
2014	J	`jnl`	Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation. Ann. Math. Artif. Intell. Anne Berry, Alain Gutierrez, Marianne Huchard, Amedeo Napoli, Alain Sigayret
2014	J	`jnl`	Organizing the atoms of the clique separator decomposition into an atom tree. Discret. Appl. Math. Anne Berry, Romain Pogorelcnik, Geneviève Simonet
2013	C	`conf`	Dismantlable Lattices in the Mirror. ICFCA Anne Berry, Alain Sigayret
2013	J	`jnl`	MosaicFinder: identification of fused gene families in sequence similarity networks. Bioinform. Pierre-Alain Jachiet, Romain Pogorelcnik, Anne Berry, Philippe Lopez, Eric Bapteste
2013	J	`jnl`	The Dilworth Number of Auto-Chordal-Bipartite Graphs. CoRR Anne Berry, Andreas Brandstädt, Konrad Engel
2013	B	`conf`	The Normal Graph Conjecture for Classes of Sparse Graphs. WG Anne Berry, Annegret K. Wagler
2012	C	`conf`	A Peep through the Looking Glass: Articulation Points in Lattices. ICFCA Anne Berry, Alain Sigayret
2012	—	`conf`	Hermes: an Efficient Algorithm for Building Galois Sub-hierarchies. CLA Anne Berry, Marianne Huchard, Amedeo Napoli, Alain Sigayret
2012	B	`conf`	Triangulation and Clique Separator Decomposition of Claw-Free Graphs. WG Anne Berry, Annegret K. Wagler
2011	J	`jnl`	A General Label Search to investigate classical graph search algorithms. Discret. Appl. Math. Richard Krueger, Geneviève Simonet, Anne Berry
2011	J	`jnl`	A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph. Inf. Process. Lett. Anne Berry, Romain Pogorelcnik
2011	—	`conf`	Vertical Decomposition of a Lattice Using Clique Separators. CLA Anne Berry, Romain Pogorelcnik, Alain Sigayret
2010	J	`jnl`	An Introduction to Clique Minimal Separator Decomposition. Algorithms Anne Berry, Romain Pogorelcnik, Geneviève Simonet
2010	J	`jnl`	Graph Extremities Defined by Search Algorithms. Algorithms Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Geneviève Simonet
2009	J	`jnl`	Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings. SIAM J. Discret. Math. Anne Berry, Richard Krueger, Geneviève Simonet
2008	J	`jnl`	Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree. Theor. Comput. Sci. Anne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet
2007	J	`jnl`	A local approach to concept generation. Ann. Math. Artif. Intell. Anne Berry, Jean Paul Bordat, Alain Sigayret
2007	J	`jnl`	Clustering Gene Expression Data Using Graph Separators. Silico Biol. Bangaly Kaba, Nicolas Pinet, Gaëlle Lelandais, Alain Sigayret, Anne Berry
2007	J	`jnl`	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. Anne Berry, Eric SanJuan, Maurice Pouzet, Martin Charles Golumbic
2007	C	`conf`	Performances of Galois Sub-hierarchy-building Algorithms. ICFCA Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret
2007	J	`jnl`	Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. SIAM J. Discret. Math. Anne Berry, Martin Charles Golumbic, Marina Lipshteyn
2006	J	`jnl`	A vertex incremental approach for maintaining chordality. Discret. Math. Anne Berry, Pinar Heggernes, Yngve Villanger
2006	J	`jnl`	A wide-range algorithm for minimal triangulation from an arbitrary ordering. J. Algorithms Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger
2006	J	`jnl`	Generalized domination in closure systems. Discret. Appl. Math. Anne Berry, Eric SanJuan, Alain Sigayret
2006	J	`jnl`	Maximal sub-triangulation in pre-processing phylogenetic data. Soft Comput. Anne Berry, Alain Sigayret, Christine Sinoquet
2006	J	`jnl`	Preface. Discret. Math. Anne Berry, Jean R. S. Blair, Geneviève Simonet
2006	C	`conf`	Very Fast Instances for Concept Generation. ICFCA Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad
2005	C	`conf`	Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice. ICFCA Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad
2005	J	`jnl`	Extremities and orderings defined by generalized graph search algorithms. Electron. Notes Discret. Math. Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Richard Krueger, Geneviève Simonet
2005	B	`conf`	Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny. WG Anne Berry, Alain Sigayret, Jeremy P. Spinrad
2005	B	`conf`	Ultimate Generalizations of LexBFS and LEX M. WG Anne Berry, Richard Krueger, Geneviève Simonet
2004	J	`jnl`	Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. Algorithmica Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton
2004	J	`jnl`	Representing a concept lattice by a graph. Discret. Appl. Math. Anne Berry, Alain Sigayret
2004	A*	`conf`	Two tricks to triangulate chordal probe graphs in polynomial time. SODA Anne Berry, Martin Charles Golumbic, Marina Lipshteyn
2003	B	`conf`	A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs. ISAAC Anne Berry, Pinar Heggernes, Yngve Villanger
2003	B	`conf`	The Minimum Degree Heuristic and the Minimal Triangulation Process. WG Anne Berry, Pinar Heggernes, Geneviève Simonet
2002	—	`conf`	Maintaining Class Membership Information. OOIS Workshops Anne Berry, Alain Sigayret
2002	B	`conf`	Maximum Cardinality Search for Computing Minimal Triangulations. WG Anne Berry, Jean R. S. Blair, Pinar Heggernes
2001	J	`jnl`	Asteroidal triples of moplexes. Discret. Appl. Math. Anne Berry, Jean Paul Bordat
2001	J	`jnl`	Moplex elimination orderings. Electron. Notes Discret. Math. Anne Berry, Jean Paul Bordat
2000	J	`jnl`	Generating All the Minimal Separators of a Graph. Int. J. Found. Comput. Sci. Anne Berry, Jean Paul Bordat, Olivier Cogis
2000	—	`conf`	Recognizing Weakly Triangulated Graphs by Edge Separability. SWAT Anne Berry, Jean Paul Bordat, Pinar Heggernes
2000	J	`jnl`	Recognizing Weakly Triangulated Graphs by Edge Separability. Nord. J. Comput. Anne Berry, Jean Paul Bordat, Pinar Heggernes
1999	A*	`conf`	A Wide-Range Efficient Algorithm for Minimal Triangulation. SODA Anne Berry
1999	B	`conf`	Generating All the Minimal Separators of a Graph. WG Anne Berry, Jean Paul Bordat, Olivier Cogis
1998	J	`jnl`	Separability Generalizes Dirac's Theorem. Discret. Appl. Math. Anne Berry, Jean Paul Bordat