World's Best Scientists 2026 revealed!

Overview

Jean-Claude Bermond is affiliated with the French Institute for Research in Computer Science and Automation (INRIA) in France. Their research broadly focuses on areas within computer science, particularly computational theory and mathematics, as well as computer networks and communications.

The main fields of study associated with Jean-Claude Bermond's work include:

  • Computer Science

Within this domain, the subfields that Bermond has contributed to are:

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Mechanical Engineering
  • Electrical and Electronic Engineering
  • Mathematical Physics

The key research topics that appear frequently in Bermond's publications include:

  • Cooperative Communication and Network Coding
  • Modular Robots and Swarm Intelligence
  • Petri Nets in System Modeling
  • Advanced Wireless Network Optimization
  • Mobile Ad Hoc Networks
  • Stochastic Processes and Statistical Mechanics
  • Markov Chains and Monte Carlo Methods

Jean-Claude Bermond has been published in a variety of venues. These include:

  • Discrete Mathematics Algorithms and Applications
  • European Journal of Combinatorics
  • Journal of Information Processing
  • Discrete Mathematics & Theoretical Computer Science
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Recent scholarly papers authored or co-authored by Bermond are:

  • "Distributed link scheduling in wireless networks," 2020, Discrete Mathematics Algorithms and Applications
  • "Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation," 2023, European Journal of Combinatorics
  • "Gossiping with Interference Constraints in Radio Chain Networks," 2020, Journal of Information Processing
  • "Gossiping with interference in radio ring networks," 2023, Discrete Mathematics & Theoretical Computer Science
  • "Grabbing Olives on Linear Pizzas and Pissaladières," 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Frequent collaborators appear to include:

  • Michel Cosnard
  • Takako Kodate
  • Dorian Mazauric
  • Vishal Misra
  • Philippe Nain

Best Publications

  • Distributed loop computer networks: a survey

    J.-C. Bermond;F. Comellas;D. F. Hsu

  • De Bruijn and Kautz networks : a competitor for the hypercube?

    Jean-Claude Bermond;Claudine Peyrat

  • Cycles in digraphs– a survey

    Jean-Claude Bermond;Carsten Thomassen

  • Graph Problems Arising from Wavelength-Routing in All-Optical Networks

    Bruno Beauquier;Jean-Claude Bermond;Luisa Gargano;Pavol Hell

  • Strategies for interconnection networks: some methods from graph theory

    J.-C. Bermond;C. Delorme;J.-J. Quisquater

  • Decomposition into Cycles I: Hamilton Decompositions

    B. Alspach;J.-C. Bermond;D. Sotteau

  • Efficient collective communication in optical networks

    Jean-Claude Bermond;Luisa Gargano;Stephan Perennes;Adele A. Rescigno

  • Hamiltonian decomposition of Cayley graphs of degree 4

    J.-C. Bermond;O. Favaron;M. Maheo

  • G-decomposition of Kn, where G has four vertices or less

    Jean-Claude Bermond;Jochanan Schönheim

  • Shortest coverings of graphs with cycles

    Jean Claude Bermond;Bill Jackson;François Jaeger

  • Large fault-tolerant interconnection networks

    Jean-Claude Bermond;Nathalie Homobono;Claudine Peyrat

  • Decomposition of complete graphs into isomorphic subgraphs with five vertices

    Jean-Claude Bermond;Charlotte Huang;Alexander Rosa;Dominique Sotteau

  • Graph decompositions and G-designs

    Jean-Claude Bermond;Dominique Sotteau

  • Large graphs with given degree and diameter. II

    Jean-Claude Bermond;Charles Delorme;Guy Farhi

  • Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs

    J.-C. Bermond

  • Surveys in Combinatorics: GRAPHS AND INTERCONNECTION NETWORKS: DIAMETER AND VULNERABILITY

    Jean-Claude Bermond;Johny Bond;Madeleine Paoli;Claudine Peyrat

  • Interconnection Networks

    J. C. Bermond

  • Broadcasting and Gossiping in de Bruijn Networks

    Jean-Claude Bermond;Pierre Fraigniaud

  • On linear k-arboricity

    Jean-Claude Bermond;Jean-Luc Fouquet;Michel Habib;Bernard Péroche

  • Broadcasting in bounded degree graphs

    Jean-Claude Bermond;Pavol Hell;Arthur L. Liestman;Joseph G. Peters

Frequent Co-Authors

Ugo Vaccaro
Ugo Vaccaro University of Salerno
Pavol Hell
Pavol Hell Simon Fraser University
Jean-Jacques Quisquater
Jean-Jacques Quisquater Université Catholique de Louvain
David Peleg
David Peleg Weizmann Institute of Science
Philippe Nain
Philippe Nain French Institute for Research in Computer Science and Automation - INRIA
Vishal Misra
Vishal Misra Columbia University
Charles J. Colbourn
Charles J. Colbourn Arizona State University
Alberto Marchetti-Spaccamela
Alberto Marchetti-Spaccamela Sapienza University of Rome
Augustin Chaintreau
Augustin Chaintreau Columbia University
Béla Bollobás
Béla Bollobás University of Memphis

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Computer Science in the USA opens doors to a variety of related online degrees and growing career pathways in STEM fields. For students interested in environmentally focused technology, an environmental engineering bachelor's degree online can provide specialized training in sustainability, design, and environmental problem-solving.

Mechanical systems and robotics also intersect closely with computer science. An online mechanical engineering degree offers flexibility to develop hands-on technical skills that are in demand across industries like manufacturing and aerospace.

If you enjoy analytical thinking and theoretical foundations, pursuing an online bachelor's degree in physics can strengthen your quantitative abilities, opening up career paths in research, engineering, or tech-driven roles.

Data-driven decision making is increasingly vital in today's tech landscape. For those interested in big data and analytics, an affordable data science degree equips you with skills in programming, statistics, and data visualization, directly complementing a computer science background.

Best Scientists Citing Jean-Claude Bermond

Trending Scientists