J Bermond

1.4k total citations
22 papers, 690 citations indexed

About

J Bermond is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, J Bermond has authored 22 papers receiving a total of 690 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computer Networks and Communications, 12 papers in Computational Theory and Mathematics and 8 papers in Electrical and Electronic Engineering. Recurrent topics in J Bermond's work include Interconnection Networks and Systems (9 papers), Advanced Graph Theory Research (7 papers) and graph theory and CDMA systems (5 papers). J Bermond is often cited by papers focused on Interconnection Networks and Systems (9 papers), Advanced Graph Theory Research (7 papers) and graph theory and CDMA systems (5 papers). J Bermond collaborates with scholars based in France, United States and Austria. J Bermond's co-authors include Francesc Comellas, D. Frank Hsu, Claudine Peyrat, Charles Delorme, Vance Faber, Dominique Sotteau, Jean‐Luc Fouquet, Michel Habib, Bernard Péroche and Olivier Delmas and has published in prestigious journals such as Annals of the New York Academy of Sciences, Journal of Parallel and Distributed Computing and Networks.

In The Last Decade

J Bermond

22 papers receiving 633 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
J Bermond France 12 363 348 328 171 131 22 690
Dominique Sotteau France 13 280 0.8× 344 1.0× 363 1.1× 116 0.7× 177 1.4× 34 611
Jean‐Claude Bermond France 16 396 1.1× 226 0.6× 282 0.9× 73 0.4× 78 0.6× 64 608
Arthur T. White United States 16 150 0.4× 624 1.8× 337 1.0× 335 2.0× 410 3.1× 52 1.1k
C. A. Rodger United States 18 154 0.4× 478 1.4× 763 2.3× 103 0.6× 432 3.3× 125 1.0k
Sylvain Gravier France 14 150 0.4× 374 1.1× 142 0.4× 91 0.5× 109 0.8× 65 491
Ronald D. Dutton United States 15 127 0.3× 460 1.3× 54 0.2× 156 0.9× 81 0.6× 45 583
C. Balbuena Spain 16 466 1.3× 491 1.4× 244 0.7× 200 1.2× 246 1.9× 109 791
Geoffrey Exoo United States 12 171 0.5× 424 1.2× 191 0.6× 238 1.4× 267 2.0× 61 609
Bjarne Toft Denmark 12 117 0.3× 610 1.8× 187 0.6× 129 0.8× 319 2.4× 33 762
Balakrishnan Krishnamurthy United States 10 592 1.6× 311 0.9× 403 1.2× 60 0.4× 15 0.1× 16 870

Countries citing papers authored by J Bermond

Since Specialization
Citations

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

Fields of papers citing papers by J Bermond

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of J Bermond

This figure shows the co-authorship network connecting the top 25 collaborators of J Bermond. A scholar is included among the top collaborators of J 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 J Bermond. J 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, J, et al.. (2012). Weighted improper colouring. Journal of Discrete Algorithms. 16. 53–66. 11 indexed citations
2.
Bermond, J, Yeow Meng Chee, Nathann Cohen, & Xiaofeng Zhang. (2011). The α-Arboricity of Complete Uniform Hypergraphs. SIAM Journal on Discrete Mathematics. 25(2). 600–610. 3 indexed citations
3.
Bermond, J, et al.. (2006). Optimal Solution of the Maximum All Request Path Grooming Problem. HAL (Le Centre pour la Communication Scientifique Directe). 4. 28–28. 6 indexed citations
4.
Bermond, J, et al.. (1998). Hamilton circuits in the directed wrapped Butterfly network. Discrete Applied Mathematics. 84(1-3). 21–42. 16 indexed citations
5.
Bermond, J, et al.. (1998). Hamilton Cycle Decomposition of the Butterfly Network. Parallel Processing Letters. 8(3). 371–385. 11 indexed citations
6.
Bermond, J, et al.. (1996). Parallelization of the Gaussian Elimination Algorithm on Systolic Arrays. Journal of Parallel and Distributed Computing. 33(1). 69–75. 3 indexed citations
7.
Bermond, J, et al.. (1993). Connectivity of kautz networks. Discrete Mathematics. 114(1-3). 51–62. 9 indexed citations
8.
Bermond, J & Peter L. Hammer. (1992). Discrete Applied Mathematics Volume 37-38. 1 indexed citations
9.
Bermond, J, et al.. (1991). Minimal diameter double‐loop networks: Dense optimal families. Networks. 21(1). 1–9. 17 indexed citations
10.
Bermond, J, et al.. (1989). An Optimization Problem in Distributed Loop Computer Networks. Annals of the New York Academy of Sciences. 555(1). 45–55. 32 indexed citations
11.
Bermond, J, et al.. (1989). Large fault-tolerant interconnection networks. Graphs and Combinatorics. 5(1). 107–123. 83 indexed citations
12.
Bermond, J, et al.. (1984). Large graphs with given degree and diameter. II. Journal of Combinatorial Theory Series B. 36(1). 32–48. 54 indexed citations
13.
Bermond, J, Jean‐Luc Fouquet, Michel Habib, & Bernard Péroche. (1984). On linear k-arboricity. Discrete Mathematics. 52(2-3). 123–132. 40 indexed citations
14.
Bermond, J, A. Germa, & Dominique Sotteau. (1979). Resolvable decomposition of Kn∗. Journal of Combinatorial Theory Series A. 26(2). 179–185. 17 indexed citations
15.
Bermond, J, et al.. (1977). G-decomposition of Kn, where G has four vertices or less. Discrete Mathematics. 19(2). 113–120. 50 indexed citations
16.
Bermond, J, Marie-Claude Heydemann, & Dominique Sotteau. (1977). Line graphs of hypergraphs I. Discrete Mathematics. 18(3). 235–241. 18 indexed citations
17.
Bermond, J & Vance Faber. (1976). Decomposition of the complete directed graph into k-circuits. Journal of Combinatorial Theory Series B. 21(2). 146–155. 35 indexed citations
18.
Bermond, J, et al.. (1976). Une heuristique pour le calcul de l'indice de transitivité d'un tournoi. 10(R1). 83–92. 7 indexed citations
19.
Bermond, J. (1974). Some Ramsey numbers for directed graphs. Discrete Mathematics. 9(4). 313–321. 10 indexed citations
20.

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 Dominique Sotteau Breakdown of academic impact, for papers by Jean‐Claude Bermond Breakdown of academic impact, for papers by Arthur T. White Breakdown of academic impact, for papers by C. A. Rodger Breakdown of academic impact, for papers by Sylvain Gravier Breakdown of academic impact, for papers by Ronald D. Dutton Breakdown of academic impact, for papers by C. Balbuena Breakdown of academic impact, for papers by Geoffrey Exoo Breakdown of academic impact, for papers by Bjarne Toft Breakdown of academic impact, for papers by Balakrishnan Krishnamurthy
Rankless by CCL
2026