Distributed loop computer-networks: a survey JC Bermond, F Comellas, DF Hsu Journal of parallel and distributed computing 24 (1), 2-10, 1995 | 539 | 1995 |

De Bruijn and Kautz networks: a competitor for the hypercube? JC Bermond, C Peyrat First European Workshop on Hypercube and Distributed Computers, pp 279-283, 1989 | 269 | 1989 |

Graph problems arising from wavelength-routing in all-optical networks B Beauquier, JC Bermond, L Gargano, P Hell, S Pérennes, U Vaccaro | 233 | 1997 |

Cycles in digraphs–a survey JC Bermond, C Thomassen Journal of Graph Theory 5 (1), 1-43, 1981 | 221 | 1981 |

Strategies for interconnection networks: some methods from graph theory JC Bermond, C Delorme, JJ Quisquater Journal of Parallel and Distributed Computing 3 (4), 433-449, 1986 | 217 | 1986 |

Decomposition into cycles I: Hamilton decompositions B Alspach, JC Bermond, D Sotteau Cycles and rays, 9-18, 1990 | 182 | 1990 |

Hamiltonian decomposition of Cayley graphs of degree 4 JC Bermond, O Favaron, M Maheo Journal of Combinatorial Theory, Series B 46 (2), 142-153, 1989 | 169 | 1989 |

Graceful graphs, radio antennae and French windmills JC Bermond Proceedings One day Combinatorics Conference, Research Notes in Mathematics …, 1979 | 164 | 1979 |

G-decomposition of Kn, where G has four vertices or less JC Bermond, J Schönheim Discrete Mathematics 19 (2), 113-120, 1977 | 161 | 1977 |

Large fault-tolerant interconnection networks JC Bermond, N Homobono, C Peyrat Graphs and Combinatorics 5 (1), 107-123, 1989 | 144 | 1989 |

Decomposition of complete graphs into isomorphic subgraphs with five vertices JC Bermond, C Huang, A Rosa, D Sotteau | 138 | 1980 |

Graph decompositions and G-designs JC Bermond, D Sotteau 5th British Combinatorial Conference, 1975, Congressus Numerantium 15 …, 1976 | 137 | 1976 |

Shortest coverings of graphs with cycles JC Bermond, B Jackson, F Jaeger Journal of Combinatorial Theory, Series B 35 (3), 297-308, 1983 | 133 | 1983 |

Efficient collective communication in optical networks JC Bermond, L Gargano, S Perennes, AA Rescigno, U Vaccaro International Colloquium on Automata, Languages, and Programming, 574-585, 1996 | 126 | 1996 |

Graphs and Interconnection networks: diameter and vulnerability, London Math Society Lecture Notes Series 82 JC Bermond, J Bond, M Paoli, C Peyrat Surveys in combinatorics, 1-30, 1983 | 125 | 1983 |

Hamiltonian graphs JC Bermond | 115 | 1979 |

On hamiltonian walks JC Bermond 5th British Combinatorial Conference, 1975, Congressus Numerantium 15 …, 1976 | 94 | 1976 |

Hamiltonian decompositions of graphs, directed graphs and hypergraphs JC Bermond Annals of Discrete Mathematics 3, 21-28, 1978 | 89 | 1978 |

Interconnection networks JC Bermond Elsevier, 2016 | 83 | 2016 |

Hardness and approximation of gathering in static radio networks JC Bermond, J Galtier, R Klasing, N Morales, S Pérennes Parallel Processing Letters 16 (02), 165-183, 2006 | 81 | 2006 |