The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Anne Berry: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.002secs, Finished in 0.305secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002