J Bermond
Impact in
-
- Finite Group Theory Research
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
Papers in
-
- Interconnection Networks and Systems 9
- Distributed systems and fault tolerance 3
- Cooperative Communication and Network Coding 2
-
- Advanced Graph Theory Research 7
- Co-authors
- D. Frank Hsu (1 shared paper)Francesc Comellas (1 shared paper)Claudine Peyrat (4 shared papers)Charles Delorme (1 shared paper)Vance Faber (1 shared paper)Dominique Sotteau (2 shared papers)Michel Habib (1 shared paper)Bernard Péroche (1 shared paper)
- Journals
- Discrete Mathematics (6 papers)Journal of Parallel and Distributed Computing (2 papers)Networks (2 papers)Journal of Combinatorial Theory Series B (2 papers)SIAM Journal on Discrete Mathematics (1 paper)
- Partner nations
- FranceUnited StatesBrazil
In The Last Decade
J Bermond
22 papers receiving 630 citations
Peers
Comparison fields: 5 of 58
- Discrete Mathematics and Combinatorics 131
- Computational Theory and Mathematics 347
- Geometry and Topology 172
- Computer Networks and Communications 363
- Electrical and Electronic Engineering 326
Countries citing papers authored by J Bermond
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
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-authors
The 24 scholars most cited alongside J Bermond, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 22 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1995 | 253 | |
| 2 | 1989 | 82 | |
| 3 | 1984 | 53 | |
| 4 | 1977 | 50 | |
| 5 | 1984 | 40 | |
| 6 | 1976 | 34 | |
| 7 | 1989 | 32 | |
| 8 | 1977 | 18 | |
| 9 | 1991 | 17 | |
| 10 | 1979 | 17 | |
| 11 | 1998 | 16 | |
| 12 | 2012 | 11 | |
| 13 | 1998 | 11 | |
| 14 | 1974 | 10 | |
| 15 | 1974 | 10 | |
| 16 | 1993 | 9 | |
| 17 | 1976 | 7 | |
| 18 | 2006 | 6 | |
| 19 | 2005 | 4 | |
| 20 | 1996 | 3 |
About J Bermond
J Bermond is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics, Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics and Geometry and Topology, having authored 22 papers that have together received 687 indexed citations. Recurring topics across this work include Interconnection Networks and Systems (9 papers), Advanced Graph Theory Research (7 papers), graph theory and CDMA systems (5 papers), Graph theory and applications (3 papers), Distributed systems and fault tolerance (3 papers), Cooperative Communication and Network Coding (2 papers), Data Management and Algorithms (2 papers) and Finite Group Theory Research (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (131 citations), Computational Theory and Mathematics (347 citations), Geometry and Topology (172 citations), Computer Networks and Communications (363 citations) and Electrical and Electronic Engineering (326 citations). J Bermond has collaborated with scholars based in France, United States and Brazil. Frequent co-authors include D. Frank Hsu, Francesc Comellas, Claudine Peyrat, Charles Delorme, Vance Faber, Dominique Sotteau, Michel Habib, Bernard Péroche, Jean‐Luc Fouquet and Olivier Delmas. Their work appears in journals such as Discrete Mathematics, Journal of Parallel and Distributed Computing, Networks, Journal of Combinatorial Theory Series B and SIAM Journal on Discrete Mathematics.
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.