Search results for "Anne Berry"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Anne Berry, Romain Pogorelcnik	A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph.	Inf. Process. Lett.	2011	DBLP DOI BibTeX RDF
1	Richard Krueger, Geneviève Simonet, Anne Berry	A General Label Search to investigate classical graph search algorithms.	Discrete Applied Mathematics	2011	DBLP DOI BibTeX RDF
1	Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Geneviève Simonet	Graph Extremities Defined by Search Algorithms.	Algorithms	2010	DBLP DOI BibTeX RDF
1	Anne Berry, Romain Pogorelcnik, Geneviève Simonet	An Introduction to Clique Minimal Separator Decomposition.	Algorithms	2010	DBLP DOI BibTeX RDF
1	Anne Berry, Richard Krueger, Geneviève Simonet	Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings.	SIAM J. Discrete Math.	2009	DBLP DOI BibTeX RDF
1	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.	2008	DBLP DOI BibTeX RDF
1	Anne Berry, Martin Charles Golumbic, Marina Lipshteyn	Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs.	SIAM J. Discrete Math.	2007	DBLP DOI BibTeX RDF
1	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.	2007	DBLP DOI BibTeX RDF
1	Anne Berry, Jean Paul Bordat, Alain Sigayret	A local approach to concept generation.	Ann. Math. Artif. Intell.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 68W01, 06B99
1	Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret	Performances of Galois Sub-hierarchy-building Algorithms.	ICFCA	2007	DBLP DOI BibTeX RDF	Galois Sub-hierarchy, AOC-Poset, Performance Analysis
1	Anne Berry, Alain Sigayret, Christine Sinoquet	Maximal sub-triangulation in pre-processing phylogenetic data.	Soft Comput.	2006	DBLP DOI BibTeX RDF
1	Anne Berry, Pinar Heggernes, Yngve Villanger	A vertex incremental approach for maintaining chordality.	Discrete Mathematics	2006	DBLP DOI BibTeX RDF
1	Anne Berry, Jean R. S. Blair, Geneviève Simonet	Preface.	Discrete Mathematics	2006	DBLP DOI BibTeX RDF
1	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	2006	DBLP DOI BibTeX RDF
1	Anne Berry, Eric SanJuan, Alain Sigayret	Generalized domination in closure systems.	Discrete Applied Mathematics	2006	DBLP DOI BibTeX RDF
1	Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy Spinrad	Very Fast Instances for Concept Generation.	ICFCA	2006	DBLP DOI BibTeX RDF
1	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	2005	DBLP DOI BibTeX RDF
1	Anne Berry, Alain Sigayret, Jeremy Spinrad	Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny.	WG	2005	DBLP DOI BibTeX RDF
1	Anne Berry, Richard Krueger, Geneviève Simonet	Ultimate Generalizations of LexBFS and LEX M.	WG	2005	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton	Maximum Cardinality Search for Computing Minimal Triangulations of Graphs.	Algorithmica	2004	DBLP DOI BibTeX RDF	Minimal triangulations, Minimal elimination ordering, Minimal fill, Chordal graphs
1	Anne Berry, Alain Sigayret	Representing a concept lattice by a graph.	Discrete Applied Mathematics	2004	DBLP DOI BibTeX RDF
1	Anne Berry, Martin Charles Golumbic, Marina Lipshteyn	Two tricks to triangulate chordal probe graphs in polynomial time.	SODA	2004	DBLP DOI BibTeX RDF
1	Anne Berry, Pinar Heggernes, Geneviève Simonet	The Minimum Degree Heuristic and the Minimal Triangulation Process.	WG	2003	DBLP DOI BibTeX RDF
1	Anne Berry, Pinar Heggernes, Yngve Villanger	A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs.	ISAAC	2003	DBLP DOI BibTeX RDF
1	Anne Berry, Jean R. S. Blair, Pinar Heggernes	Maximum Cardinality Search for Computing Minimal Triangulations.	WG	2002	DBLP DOI BibTeX RDF
1	Anne Berry, Alain Sigayret	Maintaining Class Membership Information.	OOIS Workshops	2002	DBLP DOI BibTeX RDF
1	Anne Berry, Jean Paul Bordat	Moplex elimination orderings.	Electronic Notes in Discrete Mathematics	2001	DBLP DOI BibTeX RDF
1	Anne Berry, Jean Paul Bordat	Asteroidal triples of moplexes.	Discrete Applied Mathematics	2001	DBLP DOI BibTeX RDF
1	Anne Berry, Jean Paul Bordat, Olivier Cogis	Generating All the Minimal Separators of a Graph.	Int. J. Found. Comput. Sci.	2000	DBLP BibTeX RDF
1	Anne Berry, Jean Paul Bordat, Pinar Heggernes	Recognizing Weakly Triangulated Graphs by Edge Separability.	Nord. J. Comput.	2000	DBLP BibTeX RDF
1	Anne Berry, Jean Paul Bordat, Pinar Heggernes	Recognizing Weakly Triangulated Graphs by Edge Separability.	SWAT	2000	DBLP DOI BibTeX RDF
1	Anne Berry, Jean Paul Bordat, Olivier Cogis	Generating All the Minimal Separators of a Graph.	WG	1999	DBLP DOI BibTeX RDF	Minimal Separator, Graph, Enumeration Algorithm
1	Anne Berry	A Wide-Range Efficient Algorithm for Minimal Triangulation.	SODA	1999	DBLP DOI BibTeX RDF
1	Anne Berry, Jean Paul Bordat	Separability Generalizes Dirac's Theorem.	Discrete Applied Mathematics	1998	DBLP DOI BibTeX RDF

Publications of "Anne Berry" ( http://dblp.L3S.de/Authors/Anne_Berry )