Anne Berry
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
- Rough Sets and Fuzzy Logic
Papers in
-
- Advanced Graph Theory Research 20
- Graph Labeling and Dimension Problems 14
- Complexity and Algorithms in Graphs 10
- Rough Sets and Fuzzy Logic 7
- Advanced Algebra and Logic 2
- Co-authors
- Pinar HeggernesRomain PogorelcnikJean R. S. BlairBarry W. PeytonYngve VillangerMartin Charles GolumbicPhilippe LopezÉric Bapteste
- Journals
- Discrete Applied Mathematics (6 papers)Discrete Mathematics (2 papers)Algorithmica (1 paper)Bioinformatics (1 paper)Soft Computing (1 paper)
- Partner nations
- FranceNorwayUnited States
In The Last Decade
Anne Berry
30 papers receiving 394 citations
Peers
Comparison fields: 5 of 52
- Computational Theory and Mathematics 294
- Discrete Mathematics and Combinatorics 33
- Geometry and Topology 47
- Signal Processing 58
- Computer Networks and Communications 95
Countries citing papers authored by Anne Berry
This map shows the geographic impact of Anne Berry's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Anne Berry with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anne Berry more than expected).
Fields of papers citing papers by Anne Berry
This network shows the impact of papers produced by Anne Berry. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Anne Berry. The network helps show where Anne Berry may publish in the future.
Co-authorship network
The 17 scholars most cited alongside Anne Berry, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2021 | 0 | |
| 2 | 2017 | 2 | |
| 3 | 2014 | 6 | |
| 4 | 2014 | 6 | |
| 5 | Hermes: an efficient algorithm for building Galois sub-hierarchies | 2012 | 3 |
| 6 | Vertical decomposition of a lattice using clique separators | 2011 | 2 |
| 7 | 2011 | 15 | |
| 8 | 2008 | 5 | |
| 9 | Comparison of Performances of Galois Subhierarchy-building Algorithms | 2007 | 1 |
| 10 | 2007 | 13 | |
| 11 | 2006 | 3 | |
| 12 | 2006 | 20 | |
| 13 | 2005 | 4 | |
| 14 | 2005 | 6 | |
| 15 | 2004 | 9 | |
| 16 | 2004 | 40 | |
| 17 | 2004 | 31 | |
| 18 | 2001 | 2 | |
| 19 | A wide-range efficient algorithm for minimal triangulation | 1999 | 21 |
| 20 | 1998 | 31 |
About Anne Berry
Anne Berry is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Signal Processing and Computer Graphics and Computer-Aided Design, having authored 32 papers that have together received 420 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (20 papers), Graph Labeling and Dimension Problems (14 papers), Complexity and Algorithms in Graphs (10 papers), Rough Sets and Fuzzy Logic (7 papers), Graph theory and applications (5 papers), Data Management and Algorithms (4 papers), Advanced Algebra and Logic (2 papers) and Bioinformatics and Genomic Networks (2 papers). The work is most often cited by research in Computational Theory and Mathematics (294 citations), Discrete Mathematics and Combinatorics (33 citations), Geometry and Topology (47 citations), Signal Processing (58 citations) and Computer Networks and Communications (95 citations). Anne Berry has collaborated with scholars based in France, Norway and United States. Frequent co-authors include Pinar Heggernes, Romain Pogorelcnik, Jean R. S. Blair, Barry W. Peyton, Yngve Villanger, Martin Charles Golumbic, Philippe Lopez, Éric Bapteste, Marianne Huchard and Gaëlle Lelandais. Their work appears in journals such as Discrete Applied Mathematics, Discrete Mathematics, Algorithmica, Bioinformatics and Soft Computing.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.