Jean‐Claude Bermond

Author

Jean‐Claude Bermond

Centre National de la Recherche Scientifique

Also Known As

BERMOND, Jean-Claude, Bermond, Jean-Claude, Hsu, D., Hutchison, David, J-C Bermond, J-C. Bermond, J. C. Bermond, J.C. Bermond, JEAN-CLAUDE BERMOND, JEAN–CLAUDE BERMOND

221

Publications

1.8K

Citations

H-Index

Concepts

All Affiliations

Centre National de la Recherche Scientifique Institut national de recherche en sciences et technologies du numérique Université Côte d'Azur Laboratoire d'Informatique, Signaux et Systèmes de Sophia Antipolis University of Salerno

About

Jean‐Claude Bermond is an author at Centre National de la Recherche Scientifique specializing in engineering, network analysis, and combinatorial optimization.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	18	25	786
2	Business	8	8	199
3	Education	6	6	234
4	Arts	1	1	50
5	Natural Sciences	1	1	22

Jean‐Claude Bermond

Publications

1.3K

Citations

H-Index

Page 1

	Year	Citations
Graph Problems arising from Wavelength-routing in All-optical Networks Bruno Beauquier, Jean‐Claude Bermond, Luisa Gargano, HAL (Le Centre pour la Communication Scientifique Directe)	1997	147
De Bruijn and Kautz networks : a competitor for the hypercube? Jean‐Claude Bermond, Claudine Peyrat HAL (Le Centre pour la Communication Scientifique Directe)	1989	130
Graph decompositions and G-designs Jean‐Claude Bermond, Dominique Sotteau HAL (Le Centre pour la Communication Scientifique Directe) Mathematical ProgrammingEngineeringGraph TheoryAlgebraic Graph TheoryStructural Graph Theory	1976	68
Sparse broadcast graphs Jean‐Claude Bermond, Pavol Hell, Arthur L. Liestman, Discrete Applied Mathematics Graph SparsityNetwork ScienceGraph TheoryEngineeringRandom Graph	1992	66
Efficient collective communication in optical networks Jean‐Claude Bermond, Luisa Gargano, S. Pérennes, Theoretical Computer Science Free-space Optical NetworkNetwork ScienceEngineeringOptical NetworksPassive Optical Network	2000	57
Broadcasting in Bounded Degree Graphs Jean‐Claude Bermond, Pavol Hell, Arthur L. Liestman, SIAM Journal on Discrete Mathematics EngineeringPlanar GraphNetwork AnalysisEducationComputational Complexity	1992	52
On hamiltonian walks Jean‐Claude Bermond HAL (Le Centre pour la Communication Scientifique Directe) Hamiltonian TheoryHamiltonian WalksHamiltonian System	1976	51
Fast Gossiping by Short Messages Jean‐Claude Bermond, Luisa Gargano, Adele A. Rescigno, SIAM Journal on Computing EngineeringNetwork AnalysisComputational ComplexityCommunication ComplexityCommunication	1998	50
Antepenultimate broadcasting Jean‐Claude Bermond, Pierre Fraigniaud, Joseph G. Peters Networks Graph SparsityNetwork ScienceGraph TheoryEngineeringNetwork Algorithm	1995	49
Broadcasting and Gossiping in de Bruijn Networks Jean‐Claude Bermond, Pierre Fraigniaud SIAM Journal on Computing Cluster ComputingEngineeringNetwork AnalysisDe Bruijn NetworksCommunication	1994	48

Page 1