J.-C. Bermond

738 total citations
13 papers, 430 citations indexed

About

J.-C. Bermond is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics. According to data from OpenAlex, J.-C. Bermond has authored 13 papers receiving a total of 430 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Theory and Mathematics, 8 papers in Electrical and Electronic Engineering and 6 papers in Discrete Mathematics and Combinatorics. Recurrent topics in J.-C. Bermond's work include graph theory and CDMA systems (7 papers), Advanced Graph Theory Research (7 papers) and Graph theory and applications (5 papers). J.-C. Bermond is often cited by papers focused on graph theory and CDMA systems (7 papers), Advanced Graph Theory Research (7 papers) and Graph theory and applications (5 papers). J.-C. Bermond collaborates with scholars based in France, Belgium and Denmark. J.-C. Bermond's co-authors include Carsten Thomassen, Charles Delorme, J.-J. Quisquater, Maryvonne Mahéo, Odile Favaron, Jean-Jacques Quisquater, Péter Frankl, Claudine Peyrat, Min‐Li Yu and Marie-Claude Heydemann and has published in prestigious journals such as Annals of the New York Academy of Sciences, Bulletin of the London Mathematical Society and Journal of Parallel and Distributed Computing.

In The Last Decade

J.-C. Bermond

13 papers receiving 381 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
J.-C. Bermond France	8	264	246	176	171	93	13	430
Jean‐Claude Bermond France	16	226 0.9×	282 1.1×	78 0.4×	396 2.3×	73 0.8×	64	608
S.A. Choudum India	10	235 0.9×	145 0.6×	101 0.6×	208 1.2×	81 0.9×	37	392
Claudine Peyrat France	9	154 0.6×	102 0.4×	54 0.3×	227 1.3×	96 1.0×	15	317
Dan Pritikin United States	8	168 0.6×	73 0.3×	106 0.6×	79 0.5×	78 0.8×	24	263
Marie-Claude Heydemann France	9	181 0.7×	132 0.5×	44 0.3×	213 1.2×	94 1.0×	28	316
Zevi Miller United States	9	184 0.7×	67 0.3×	71 0.4×	63 0.4×	89 1.0×	29	261
Pranava K. Jha United States	12	253 1.0×	205 0.8×	55 0.3×	76 0.4×	56 0.6×	39	331
Yubao Guo Germany	10	260 1.0×	148 0.6×	85 0.5×	149 0.9×	65 0.7×	52	326
Michel Mollard France	12	214 0.8×	82 0.3×	63 0.4×	136 0.8×	138 1.5×	30	318
Stephen C. Locke United States	10	263 1.0×	96 0.4×	174 1.0×	60 0.4×	96 1.0×	32	314

Countries citing papers authored by J.-C. Bermond

Since Specialization

Citations

This map shows the geographic impact of J.-C. 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.-C. 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.-C. Bermond more than expected).

Fields of papers citing papers by J.-C. Bermond

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of J.-C. Bermond

This figure shows the co-authorship network connecting the top 25 collaborators of J.-C. Bermond. A scholar is included among the top collaborators of J.-C. 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.-C. Bermond. J.-C. Bermond is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

13 of 13 papers shown

Bermond, J.-C., Charles Delorme, & Jean-Jacques Quisquater. (1992). Table of large (Δ,D)-graphs. Discrete Applied Mathematics. 37-38. 575–577. 11 indexed citations

Bermond, J.-C., Katherine Heinrich, & Min‐Li Yu. (1990). Existence of Resolvable Path Designs. European Journal of Combinatorics. 11(3). 205–211. 13 indexed citations

Bermond, J.-C., Odile Favaron, & Maryvonne Mahéo. (1989). Hamiltonian decomposition of Cayley graphs of degree 4. Journal of Combinatorial Theory Series B. 46(2). 142–153. 96 indexed citations

Bermond, J.-C., et al.. (1989). Extensions of networks with given diameter. Discrete Mathematics. 75(1-3). 31–40. 2 indexed citations

Bermond, J.-C., et al.. (1989). Combinatorial Designs and Hypergraphs of Diameter One^a. Annals of the New York Academy of Sciences. 576(1). 51–62. 4 indexed citations

Bermond, J.-C. & Claudine Peyrat. (1989). Induced Subgraphs of the Power of a Cycle. SIAM Journal on Discrete Mathematics. 2(4). 452–455. 7 indexed citations

Bermond, J.-C., et al.. (1986). Interconnection network with each node on two buses. 155–167. 6 indexed citations

Bermond, J.-C., Charles Delorme, & J.-J. Quisquater. (1986). Strategies for interconnection networks: Some methods from graph theory. Journal of Parallel and Distributed Computing. 3(4). 433–449. 110 indexed citations

Bermond, J.-C., Charles Delorme, & Jean-Jacques Quisquater. (1982). Tables of large graphs wh given degree and diameter. Information Processing Letters. 15(1). 10–13. 29 indexed citations

10.

Bermond, J.-C. & Carsten Thomassen. (1981). Cycles in digraphs– a survey. Journal of Graph Theory. 5(1). 1–43. 127 indexed citations

11.

Bermond, J.-C., A. Germa, Marie-Claude Heydemann, & Dominique Sotteau. (1981). Longest paths in digraphs. COMBINATORICA. 1(4). 337–341. 6 indexed citations

12.

Bermond, J.-C., et al.. (1980). Girth in digraphs. Journal of Graph Theory. 4(3). 337–341. 8 indexed citations

13.

Bermond, J.-C. & Péter Frankl. (1977). On a Conjecture of Chvátal on m-Intersecting Hypergraphs. Bulletin of the London Mathematical Society. 9(3). 310–312. 11 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