Anne Berry

1.1k total citations
32 papers, 420 citations indexed

About

Anne Berry is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Computer Networks and Communications. According to data from OpenAlex, Anne Berry has authored 32 papers receiving a total of 420 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computational Theory and Mathematics, 5 papers in Geometry and Topology and 4 papers in Computer Networks and Communications. Recurrent topics in Anne Berry's work include Advanced Graph Theory Research (20 papers), Graph Labeling and Dimension Problems (14 papers) and Complexity and Algorithms in Graphs (10 papers). Anne Berry is often cited by papers focused on Advanced Graph Theory Research (20 papers), Graph Labeling and Dimension Problems (14 papers) and Complexity and Algorithms in Graphs (10 papers). Anne Berry collaborates with scholars based in France, Norway and United States. Anne Berry's 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 and has published in prestigious journals such as Bioinformatics, Theoretical Computer Science and Soft Computing.

In The Last Decade

Anne Berry

30 papers receiving 394 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Anne Berry France 12 294 95 90 58 47 32 420
J. Flum Germany 5 572 1.9× 197 2.1× 227 2.5× 32 0.6× 23 0.5× 10 714
Benjamin Rossman United States 10 250 0.9× 115 1.2× 215 2.4× 55 0.9× 20 0.4× 34 427
Søren Riis United Kingdom 12 199 0.7× 119 1.3× 242 2.7× 42 0.7× 23 0.5× 54 531
Arash Rafiey Canada 10 176 0.6× 78 0.8× 53 0.6× 19 0.3× 17 0.4× 35 303
Vincent Vajnovszki France 8 181 0.6× 81 0.9× 176 2.0× 19 0.3× 22 0.5× 25 349
René Peeters Netherlands 5 86 0.3× 69 0.7× 127 1.4× 34 0.6× 24 0.5× 8 295
M. Dowd United States 7 107 0.4× 185 1.9× 102 1.1× 53 0.9× 17 0.4× 27 277
David Gillman United States 8 62 0.2× 67 0.7× 105 1.2× 21 0.4× 28 0.6× 12 244
Nadia Creignou France 13 576 2.0× 357 3.8× 285 3.2× 66 1.1× 14 0.3× 46 763

Countries citing papers authored by Anne Berry

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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 of co-authors of Anne Berry

This figure shows the co-authorship network connecting the top 25 collaborators of Anne Berry. A scholar is included among the top collaborators of Anne Berry based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Anne Berry. Anne Berry is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
2.
Berry, Anne, et al.. (2017). Computing a Clique Tree with the Algorithm Maximal Label Search. Algorithms. 10(1). 20–20. 2 indexed citations
3.
Berry, Anne, et al.. (2014). Organizing the atoms of the clique separator decomposition into an atom tree. Discrete Applied Mathematics. 177. 1–13. 6 indexed citations
4.
Berry, Anne, Andreas Brandstädt, Vassilis Giakoumakis, & Frédéric Maffray. (2014). Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. Discrete Applied Mathematics. 184. 50–61. 6 indexed citations
5.
Berry, Anne, et al.. (2012). Hermes: an efficient algorithm for building Galois sub-hierarchies. HAL (Le Centre pour la Communication Scientifique Directe). 21–32. 3 indexed citations
6.
Berry, Anne, et al.. (2011). Vertical decomposition of a lattice using clique separators. 15–29. 2 indexed citations
7.
Berry, Anne & Romain Pogorelcnik. (2011). A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph. Information Processing Letters. 111(11). 508–511. 15 indexed citations
8.
Berry, Anne, et al.. (2008). Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree. Theoretical Computer Science. 409(3). 601–616. 5 indexed citations
9.
Berry, Anne, et al.. (2007). Comparison of Performances of Galois Subhierarchy-building Algorithms. 4390. 166–180. 1 indexed citations
10.
Lelandais, Gaëlle, et al.. (2007). Clustering Gene Expression Data Using Graph Separators. In Silico Biology. 7(4-5). 433–452. 13 indexed citations
11.
Berry, Anne, et al.. (2006). Preface. Discrete Mathematics. 306(3). 293–293. 3 indexed citations
12.
Berry, Anne, Pinar Heggernes, & Yngve Villanger. (2006). A vertex incremental approach for maintaining chordality. Discrete Mathematics. 306(3). 318–336. 20 indexed citations
13.
Berry, Anne, et al.. (2005). Generalized domination in closure systems. Discrete Applied Mathematics. 154(7). 1064–1084. 4 indexed citations
14.
Berry, Anne, et al.. (2005). Maximal sub-triangulation in pre-processing phylogenetic data. Soft Computing. 10(5). 461–468. 6 indexed citations
15.
Berry, Anne, et al.. (2004). Two tricks to triangulate chordal probe graphs in polynomial time. Symposium on Discrete Algorithms. 962–969. 9 indexed citations
16.
Berry, Anne, et al.. (2004). Representing a concept lattice by a graph. Discrete Applied Mathematics. 144(1-2). 27–42. 40 indexed citations
17.
Berry, Anne, et al.. (2004). A wide-range algorithm for minimal triangulation from an arbitrary ordering. Journal of Algorithms. 58(1). 33–66. 31 indexed citations
18.
Berry, Anne, et al.. (2001). Asteroidal triples of moplexes. Discrete Applied Mathematics. 111(3). 219–229. 2 indexed citations
19.
Berry, Anne. (1999). A wide-range efficient algorithm for minimal triangulation. Symposium on Discrete Algorithms. 860–861. 21 indexed citations
20.
Berry, Anne, et al.. (1998). Separability generalizes Dirac's theorem. Discrete Applied Mathematics. 84(1-3). 43–53. 31 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by J. Flum Breakdown of academic impact, for papers by Benjamin Rossman Breakdown of academic impact, for papers by Søren Riis Breakdown of academic impact, for papers by Arash Rafiey Breakdown of academic impact, for papers by Vincent Vajnovszki Breakdown of academic impact, for papers by René Peeters Breakdown of academic impact, for papers by M. Dowd Breakdown of academic impact, for papers by David Gillman Breakdown of academic impact, for papers by Nadia Creignou
Rankless by CCL
2026