Jean‐Claude Bermond

1.8k total citations
64 papers, 608 citations indexed

About

Jean‐Claude Bermond is a scholar working on Computer Networks and Communications, Electrical and Electronic Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Jean‐Claude Bermond has authored 64 papers receiving a total of 608 indexed citations (citations by other indexed papers that have themselves been cited), including 43 papers in Computer Networks and Communications, 31 papers in Electrical and Electronic Engineering and 18 papers in Computational Theory and Mathematics. Recurrent topics in Jean‐Claude Bermond's work include Interconnection Networks and Systems (24 papers), Cooperative Communication and Network Coding (17 papers) and Advanced Optical Network Technologies (15 papers). Jean‐Claude Bermond is often cited by papers focused on Interconnection Networks and Systems (24 papers), Cooperative Communication and Network Coding (17 papers) and Advanced Optical Network Technologies (15 papers). Jean‐Claude Bermond collaborates with scholars based in France, Canada and Austria. Jean‐Claude Bermond's co-authors include Joseph G. Peters, Pierre Fraigniaud, Luisa Gargano, Arthur L. Liestman, David Coudert, Stéphane Pérennès, Adele A. Rescigno, Pavol Hell, Ugo Vaccaro and Min‐Li Yu and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Networks.

In The Last Decade

Jean‐Claude Bermond

60 papers receiving 563 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Jean‐Claude Bermond France 16 396 282 226 78 73 64 608
S.A. Choudum India 10 208 0.5× 145 0.5× 235 1.0× 101 1.3× 81 1.1× 37 392
Toru Hasunuma Japan 8 151 0.4× 91 0.3× 160 0.7× 23 0.3× 37 0.5× 27 241
Geoffrey Exoo United States 12 171 0.4× 191 0.7× 424 1.9× 267 3.4× 238 3.3× 61 609
Toru Araki Japan 12 270 0.7× 128 0.5× 192 0.8× 19 0.2× 47 0.6× 32 372
Matthias Kriesell Germany 11 170 0.4× 121 0.4× 365 1.6× 107 1.4× 101 1.4× 56 415
Dan Archdeacon United States 15 70 0.2× 194 0.7× 443 2.0× 209 2.7× 161 2.2× 55 603
Paul M. Weichsel United States 10 69 0.2× 101 0.4× 224 1.0× 128 1.6× 182 2.5× 21 454
Genghua Fan China 17 159 0.4× 193 0.7× 667 3.0× 450 5.8× 273 3.7× 63 781
Herbert Fleischner Austria 14 133 0.3× 153 0.5× 498 2.2× 183 2.3× 183 2.5× 64 616
Paul Bonsma Germany 9 164 0.4× 42 0.1× 218 1.0× 31 0.4× 27 0.4× 27 279

Countries citing papers authored by Jean‐Claude Bermond

Since Specialization
Citations

This map shows the geographic impact of Jean‐Claude Bermond'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 Jean‐Claude Bermond with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jean‐Claude Bermond more than expected).

Fields of papers citing papers by Jean‐Claude Bermond

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jean‐Claude Bermond. 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 Jean‐Claude Bermond. The network helps show where Jean‐Claude Bermond may publish in the future.

Co-authorship network of co-authors of Jean‐Claude Bermond

This figure shows the co-authorship network connecting the top 25 collaborators of Jean‐Claude Bermond. A scholar is included among the top collaborators of Jean‐Claude Bermond 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 Jean‐Claude Bermond. Jean‐Claude Bermond 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.
Bermond, Jean‐Claude, et al.. (2023). Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation. European Journal of Combinatorics. 119. 103801–103801. 1 indexed citations
2.
Bermond, Jean‐Claude, et al.. (2023). Groupage sur le chemin pour borner la largeur de coupe. SPIRE - Sciences Po Institutional REpository.
3.
Bermond, Jean‐Claude, et al.. (2015). Finding disjoint paths in networks with star shared risk link groups. Theoretical Computer Science. 579. 74–87. 6 indexed citations
4.
Bermond, Jean‐Claude, et al.. (2014). Data gathering and personalized broadcasting in radio grids with interference. Theoretical Computer Science. 562. 453–475. 4 indexed citations
5.
Bermond, Jean‐Claude, Michel Cosnard, & Stéphane Pérennès. (2012). Directed acyclic graphs with the unique dipath property. Theoretical Computer Science. 504. 5–11. 3 indexed citations
6.
Bermond, Jean‐Claude & Joseph G. Peters. (2012). Optimal gathering in radio grids with interference. Theoretical Computer Science. 457. 10–26. 3 indexed citations
7.
Bermond, Jean‐Claude, David Coudert, Joanna Mouliérac, et al.. (2012). GMPLS label space minimization through hypergraph layouts. Theoretical Computer Science. 444. 3–16. 1 indexed citations
8.
Bermond, Jean‐Claude, et al.. (2007). Traffic grooming on the path. Theoretical Computer Science. 384(2-3). 139–151. 8 indexed citations
9.
Bermond, Jean‐Claude & Min‐Li Yu. (2007). Vertex disjoint routings of cycles over tori. Networks. 49(3). 217–225. 2 indexed citations
10.
Bermond, Jean‐Claude, Charles J. Colbourn, Alan C. H. Ling, & Min‐Li Yu. (2004). Grooming in unidirectional rings: K4−e designs. Discrete Mathematics. 284(1-3). 57–62. 24 indexed citations
11.
Bermond, Jean‐Claude, David Coudert, & Xavier Muñoz. (2003). Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case. HAL (Le Centre pour la Communication Scientifique Directe). 1135–1153. 21 indexed citations
12.
Bermond, Jean‐Claude, et al.. (2003). The power of small coalitions in graphs. Discrete Applied Mathematics. 127(3). 399–414. 3 indexed citations
13.
Bermond, Jean‐Claude, et al.. (2002). Deadlock prevention by acyclic orientations. Discrete Applied Mathematics. 129(1). 31–47. 1 indexed citations
14.
Bermond, Jean‐Claude, Luisa Gargano, & Stéphane Pérennès. (1998). Optimal sequential gossiping by short messages. Discrete Applied Mathematics. 86(2-3). 145–155. 10 indexed citations
15.
Bermond, Jean‐Claude, et al.. (1996). Hamilton Circuits in the Directed Butterfly Network. OpenGrey (Institut de l'Information Scientifique et Technique). 1 indexed citations
16.
Bermond, Jean‐Claude, et al.. (1996). Bus interconnection networks. Discrete Applied Mathematics. 68(1-2). 1–15. 15 indexed citations
17.
Bermond, Jean‐Claude, Pavol Hell, & Jean-Jacques Quisquater. (1992). CONSTRUCTION OF LARGE PACKET RADIO NETWORKS. Parallel Processing Letters. 2(1). 3–12. 5 indexed citations
18.
Bermond, Jean‐Claude & Jean-Michel Fourneau. (1989). Independent connections: an easy characterization of baseline-equivalent multistage interconnection networks. Theoretical Computer Science. 64(2). 191–201.
19.
Bermond, Jean‐Claude, et al.. (1979). Hamiltonian Cycles in Strong Products of Graphs. Canadian Mathematical Bulletin. 22(3). 305–309. 8 indexed citations
20.
Bermond, Jean‐Claude. (1976). On hamiltonian walks. HAL (Le Centre pour la Communication Scientifique Directe). 41–51. 30 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

Rankless by CCL
2026