Some Ramsey numbers for directed graphs. - Jean-Claude Bermond (Discret. Math., 1974)

An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits. - Jean-Claude Bermond (Discret. Math., 1974)

Cycles dans les graphes et G-configurations. - Jean-Claude Bermond (1975)

Une Heuristique pour le Calcul de l'Indice de Transitivité d'un Tournoi. - Jean-Claude Bermond; Yves Kodratoff (RAIRO Theor. Informatics Appl., 1976)

Decomposition of the complete directed graph into k-circuits. - Jean-Claude Bermond; Vance Faber (J. Comb. Theory B, 1976)

Line graphs of hypergraphs I. - Jean-Claude Bermond; Marie-Claude Heydemann; Dominique Sotteau (Discret. Math., 1977)

G-decomposition of Kn, where G has four vertices or less. - Jean-Claude Bermond; Johanan Schönheim (Discret. Math., 1977)

Resolvable Decomposition of Kn. - Jean-Claude Bermond; Anne Germa; Dominique Sotteau (J. Comb. Theory A, 1979)

On the maximum number of edges in a hypergraph whose linegraph contains no cycle. - Jean-Claude Bermond; Peter Frankl; F. Sterboul (Discret. Math., 1980)

Girth in digraphs. - Jean-Claude Bermond; Anne Germa; Marie-Claude Heydemann; Dominique Sotteau (J. Graph Theory, 1980)

Longest paths in digraphs. - Jean-Claude Bermond; Anne Germa; Marie-Claude Heydemann; Dominique Sotteau (Comb., 1981)

Cycles in digraphs- a survey. - Jean-Claude Bermond; Carsten Thomassen (J. Graph Theory, 1981)

Tables of Large Graphs with Given Degree and Diameter. - Jean-Claude Bermond; Charles Delorme; Jean-Jacques Quisquater (Inf. Process. Lett., 1982)

Shortest coverings of graphs with cycles. - Jean-Claude Bermond; Bill Jackson; François Jaeger (J. Comb. Theory B, 1983)

On linear k-arboricity. - Jean-Claude Bermond; Jean-Luc Fouquet; Michel Habib; Bernard Péroche (Discret. Math., 1984)

Regular factors in nearly regular graphs. - Jean-Claude Bermond; Michel Las Vergnas (Discret. Math., 1984)

Large graphs with given degree and diameter. II. - Jean-Claude Bermond; Charles Delorme; G. Farhi (J. Comb. Theory B, 1984)

Strategies for Interconnection Networks: Some Methods from Graph Theory. - Jean-Claude Bermond; Charles Delorme; Jean-Jacques Quisquater (J. Parallel Distributed Comput., 1986)

General and Efficient Decentralized Consensus Protocols. - Jean-Claude Bermond; Jean-Claude König; Michel Raynal (WDAG, 1987)

Equivalence of Multistage Interconnection Networks. - Jean-Claude Bermond; Jean-Michel Fourneau; Alain Jean-Marie (Inf. Process. Lett., 1987)

Extensions of networks with given diameter. - Jean-Claude Bermond; Karima Berrada; Johny Bond (Discret. Math., 1989)

Large fault-tolerant interconnection networks. - Jean-Claude Bermond; Nathalie Homobono; Claudine Peyrat (Graphs Comb., 1989)

Hamiltonian decomposition of Cayley graphs of degree 4. - Jean-Claude Bermond; Odile Favaron; Maryvonne Mahéo (J. Comb. Theory B, 1989)

Induced Subgraphs of the Power of a Cycle. - Jean-Claude Bermond; Claudine Peyrat (SIAM J. Discret. Math., 1989)

Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks. - Jean-Claude Bermond; Jean-Michel Fourneau (Theor. Comput. Sci., 1989)

Existence of Resolvable Path Designs. - Jean-Claude Bermond; Katherine Heinrich; Min-Li Yu (Eur. J. Comb., 1990)

On Resolvable Mixed Path Designs. - Jean-Claude Bermond; Katherine Heinrich; Min-Li Yu (Eur. J. Comb., 1990)

Minimal diameter double-loop networks: Dense optimal families. - Jean-Claude Bermond; Dvora Tzvieli (Networks, 1991)

Foreword. - Jean-Claude Bermond (Discret. Appl. Math., 1992)

Table of Large (Delta, D)-Graphs. - Jean-Claude Bermond; Charles Delorme; Jean-Jacques Quisquater (Discret. Appl. Math., 1992)

Sparse broadcast graphs. - Jean-Claude Bermond; Pavol Hell; Arthur L. Liestman; Joseph G. Peters (Discret. Appl. Math., 1992)

Broadcasting in wraparound meshes with parallel monodirectional links. - Jean-Claude Bermond; Philippe Michallon; Denis Trystram (Parallel Comput., 1992)

Construction of Large Packet Radio Networks. - Jean-Claude Bermond; Pavol Hell; Jean-Jacques Quisquater (Parallel Process. Lett., 1992)

Broadcasting in Bounded Degree Graphs. - Jean-Claude Bermond; Pavol Hell; Arthur L. Liestman; Joseph G. Peters (SIAM J. Discret. Math., 1992)

Connectivity of kautz networks. - Jean-Claude Bermond; Nathalie Homobono; Claudine Peyrat (Discret. Math., 1993)

On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs. - Jean-Claude Bermond; Pavol Hell (J. Graph Theory, 1993)

Dense bus networks of diameter 2. - Jean-Claude Bermond; Johny Bond; Selma Djelloul (Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994)

Broadcasting and Gossiping in de Bruijn Networks. - Jean-Claude Bermond; Pierre Fraigniaud (SIAM J. Comput., 1994)

Gossiping in Cayley Graphs by Packets. - Jean-Claude Bermond; Takako Kodate; Stephane Perennes (Combinatorics and Computer Science, 1995)

The Power of Small Coalitions in Graphs. - Jean-Claude Bermond; David Peleg (SIROCCO, 1995)

Efficient Broadcasting Protocols on the de Bruijn and Similar Networks. - Jean-Claude Bermond; Stephane Perennes (SIROCCO, 1995)

Distributed Loop Computer Networks: A Survey. - Jean-Claude Bermond; Francesc Comellas; D. Frank Hsu (J. Parallel Distributed Comput., 1995)

Antepenultimate broadcasting. - Jean-Claude Bermond; Pierre Fraigniaud; Joseph G. Peters (Networks, 1995)

Induced Broadcasting Algorithms in Iterated Line Digraphs. - Jean-Claude Bermond; Xavier Muñoz; Alberto Marchetti-Spaccamela (Euro-Par, Vol. I, 1996)

Tight Bounds on the Size of 2-Monopolies. - Jean-Claude Bermond; Johny Bond; David Peleg; Stephane Perennes (SIROCCO, 1996)

Bus Interconnection Networks. - Jean-Claude Bermond; Fahir Ö. Ergincan (Discret. Appl. Math., 1996)

Parallelization of the {Gaussian} Elimination Algorithm on Systolic Arrays. - Jean-Claude Bermond; Claudine Peyrat; I. Sakho; Maurice Tchuenté (J. Parallel Distributed Comput., 1996)

Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). - Jean-Claude Bermond; Miriam Di Ianni; Michele Flammini; Stephane Perennes (WG, 1997)

A Note on the Dimensionality of Modified Knö;del Graphs. - Jean-Claude Bermond; Hovhannes A. Harutyunyan; Arthur L. Liestman; Stephane Perennes (Int. J. Found. Comput. Sci., 1997)

De Bruijn and Kautz bus networks. - Jean-Claude Bermond; Robin W. Dawes; Fahir Ö. Ergincan (Networks, 1997)

Mean eccentricities of de Bruijn networks. - Jean-Claude Bermond; Zhen Liu; Michel Syska (Networks, 1997)

Hamilton Circuits in the Directed Wrapped Butterfly Network. - Jean-Claude Bermond; Olivier Delmas; Éric Darrot; Stephane Perennes (Discret. Appl. Math., 1998)

Optimal Sequential Gossiping by Short Messages. - Jean-Claude Bermond; Luisa Gargano; Stephane Perennes (Discret. Appl. Math., 1998)

Hamilton Cycle Decomposition of the Butterfly Network. - Jean-Claude Bermond; Éric Darrot; Olivier Delmas; Stephane Perennes (Parallel Process. Lett., 1998)

Fast Gossiping by Short Messages. - Jean-Claude Bermond; Luisa Gargano; Adele A. Rescigno; Ugo Vaccaro (SIAM J. Comput., 1998)

Broadcasting in Hypercubes in the Circuit Switched Model. - Jean-Claude Bermond; Takako Kodate; Stephane Perennes; Alexis Bonnecaze; Patrick Solé (IPDPS, 2000)

Optimal Orientations of Annular Networks. - Jean-Claude Bermond; Johny Bond; Carole Martin; Aleksandar Pekec; Fred S. Roberts (J. Interconnect. Networks, 2000)

Improved Bounds for Gossiping in Mesh Bus Networks. - Jean-Claude Bermond; Susan Marshall; Min-Li Yu (J. Interconnect. Networks, 2000)

Efficient collective communication in optical networks. - Jean-Claude Bermond; Luisa Gargano; Stephane Perennes; Adele A. Rescigno; Ugo Vaccaro (Theor. Comput. Sci., 2000)

Cycle Covering. - Jean-Claude Bermond; Lilian Chacon; David Coudert; François Tillerot (SIROCCO, 2001)

A note on cycle covering. - Jean-Claude Bermond; David Coudert; Lilian Chacon; François Tillerot (SPAA, 2001)

A Broadcasting Protocol in Line Digraphs. - Jean-Claude Bermond; Xavier Muñoz; Alberto Marchetti-Spaccamela (J. Parallel Distributed Comput., 2001)

Design of fault-tolerant networks for satellites (TWTA redundancy). - Jean-Claude Bermond; Éric Darrot; Olivier Delmas (Networks, 2002)

Traffic grooming in unidirectional WDM ring networks using design theory. - Jean-Claude Bermond; David Coudert (ICC, 2003)

The Power of Small Coalitions in Graphs. - Jean-Claude Bermond; Johny Bond; David Peleg; Stephane Perennes (Discret. Appl. Math., 2003)

Deadlock Prevention by Acyclic Orientations. - Jean-Claude Bermond; Miriam Di Ianni; Michele Flammini; Stephane Perennes (Discret. Appl. Math., 2003)

On Hamilton cycle decompositions of the tensor product of complete graphs. - R. Balakrishnan; Jean-Claude Bermond; P. Paulraja; Min-Li Yu (Discret. Math., 2003)

Hierarchical Ring Network design. - Jean-Claude Bermond; Sébastien Choplin; Stephane Perennes (Theory Comput. Syst., 2003)

Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. - Jean-Claude Bermond; Stéphan Ceroi (Networks, 2003)

Directed virtual path layouts in ATM networks. - Jean-Claude Bermond; Nausica Marlin; David Peleg; Stephane Perennes (Theor. Comput. Sci., 2003)

Grooming in unidirectional rings: K4-e designs. - Jean-Claude Bermond; Charles J. Colbourn; Alan C. H. Ling; Min-Li Yu (Discret. Math., 2004)

Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6. - Jean-Claude Bermond; Charles J. Colbourn; David Coudert; Gennian Ge; Alan C. H. Ling; Xavier Muñoz (SIAM J. Discret. Math., 2005)

Optimal Solution of the Maximum All Request Path Grooming Problem. - Jean-Claude Bermond; Michel Cosnard; David Coudert; Stéphane Pérennes (AICT/ICIW, 2006)

Gathering Algorithms on Paths Under Interference Constraints. - Jean-Claude Bermond; Ricardo C. Corrêa; Min-Li Yu (CIAC, 2006)

Fault tolerant on-board networks with priorities. - Jean-Claude Bermond; Frédéric Havet; Csaba D. Tóth (Networks, 2006)

Hardness and Approximation of Gathering in Static Radio Networks. - Jean-Claude Bermond; Jérôme Galtier; Ralf Klasing; Nelson Morales; Stephane Perennes (Parallel Process. Lett., 2006)

Minimum number of wavelengths equals load in a DAG without internal cycle. - Jean-Claude Bermond; Michel Cosnard (IPDPS, 2007)

Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions. - Jean-Claude Bermond; Frédéric Giroire; Stéphane Pérennes (SIROCCO, 2007)

Vertex disjoint routings of cycles over tori. - Jean-Claude Bermond; Min-Li Yu (Networks, 2007)

Neighborhood Broadcasting in Hypercubes. - Jean-Claude Bermond; Afonso Ferreira; Stéphane Pérennes; Joseph G. Peters (SIAM J. Discret. Math., 2007)

Traffic grooming on the path. - Jean-Claude Bermond; Laurent Braud; David Coudert (Theor. Comput. Sci., 2007)

Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences. - Jean-Claude Bermond; Min-Li Yu (ADHOC-NOW, 2008)

Gathering with Minimum Delay in Tree Sensor Networks. - Jean-Claude Bermond; Luisa Gargano; Adele A. Rescigno (SIROCCO, 2008)

Approximations for All-to-All Uniform Traffic Grooming on Unidirectional Rings. - Jean-Claude Bermond; David Coudert; Benjamin Lévêque (J. Interconnect. Networks, 2008)

Minimum Delay Data Gathering in Radio Networks. - Jean-Claude Bermond; Nicolas Nisse; Patricio Reyes; Hervé Rivano (ADHOC-NOW, 2009)

Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks. - Eitan Altaian; Philippe Nain; Jean-Claude Bermond (INFOCOM, 2009)

MPLS Label Stacking on the Line Network. - Jean-Claude Bermond; David Coudert; Joanna Moulierac; Stéphane Pérennes; Hervé Rivano; Ignasi Sau; Fernando Solano Donado (Networking, 2009)

Designing Hypergraph Layouts to GMPLS Routing Strategies. - Jean-Claude Bermond; David Coudert; Joanna Moulierac; Stéphane Pérennes; Ignasi Sau; Fernando Solano Donado (SIROCCO, 2009)

Optimal gathering protocols on paths under interference constraints. - Jean-Claude Bermond; Ricardo C. Corrêa; Min-Li Yu (Discret. Math., 2009)

On the Average Path Length of Deterministic and Stochastics Recursive Networks. - Philippe J. Giabbanelli; Dorian Mazauric; Jean-Claude Bermond (CompleNet, 2010)

A distributed scheduling algorithm for wireless networks with constant overhead and arbitrary binary interference. - Jean-Claude Bermond; Dorian Mazauric; Vishal Misra; Philippe Nain (SIGMETRICS, 2010)

Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences. - Jean-Claude Bermond; Min-Li Yu (Ad Hoc Sens. Wirel. Networks, 2010)

Improper Coloring of Weighted Grid and Hexagonal Graphs. - Jean-Claude Bermond; Frédéric Havet; Florian Huc; Cláudia Linhares Sales (Discret. Math. Algorithms Appl., 2010)

Gathering with Minimum Completion Time in Sensor Tree Networks. - Jean-Claude Bermond; Luisa Gargano; Adele A. Rescigno (J. Interconnect. Networks, 2010)

Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. - Jean-Claude Bermond; Charles J. Colbourn; Lucia Gionfriddo; Gaetano Quattrocchi; Ignasi Sau (SIAM J. Discret. Math., 2010)

Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas. - Jean-Claude Bermond; Luisa Gargano; Stéphane Pérennes; Adele A. Rescigno; Ugo Vaccaro (SIROCCO, 2011)

Traffic grooming in bidirectional WDM ring networks. - Jean-Claude Bermond; Xavier Muñoz; Ignasi Sau (Networks, 2011)

The α-Arboricity of Complete Uniform Hypergraphs. - Jean-Claude Bermond; Yeow Meng Chee; Nathann Cohen; Xiande Zhang (SIAM J. Discret. Math., 2011)

Line Directed Hypergraphs. - Jean-Claude Bermond; Fahir Ö. Ergincan; Michel Syska (Cryptography and Security, 2012)

Diverse routing in networks with star SRLGs. - Jean-Claude Bermond; David Coudert; Gianlorenzo D'Angelo; Fatima Zahra Moataz (StudentWorkshop@CoNEXT, 2012)

Weighted improper colouring. - Júlio Araújo 001; Jean-Claude Bermond; Frédéric Giroire; Frédéric Havet; Dorian Mazauric; Remigiusz Modrzejewski (J. Discrete Algorithms, 2012)

GMPLS label space minimization through hypergraph layouts. - Jean-Claude Bermond; David Coudert; Joanna Moulierac; Stéphane Pérennes; Ignasi Sau; Fernando Solano Donado (Theor. Comput. Sci., 2012)

Optimal gathering in radio grids with interference. - Jean-Claude Bermond; Joseph G. Peters (Theor. Comput. Sci., 2012)

SRLG-diverse routing with the star property. - Jean-Claude Bermond; David Coudert; Gianlorenzo D'Angelo; Fatima Zahra Moataz (DRCN, 2013)

Gathering Radio Messages in the Path. - Jean-Claude Bermond; Ralf Klasing; Nelson Morales; Stéphane Pérennes; Patricio Reyes (Discret. Math. Algorithms Appl., 2013)

Directed acyclic graphs with the unique dipath property. - Jean-Claude Bermond; Michel Cosnard; Stéphane Pérennes (Theor. Comput. Sci., 2013)

Optimal time data gathering in wireless networks with multidirectional antennas. - Jean-Claude Bermond; Luisa Gargano; Stéphane Pérennes; Adele A. Rescigno; Ugo Vaccaro (Theor. Comput. Sci., 2013)

Eulerian and Hamiltonian dicycles in Directed hypergraphs. - Júlio Araújo 001; Jean-Claude Bermond; Guillaume Ducoffe (Discret. Math. Algorithms Appl., 2014)

Data gathering and personalized broadcasting in radio grids with interference. - Jean-Claude Bermond; Bi Li 004; Nicolas Nisse; Hervé Rivano; Min-Li Yu (Theor. Comput. Sci., 2015)

Finding disjoint paths in networks with star shared risk link groups. - Jean-Claude Bermond; David Coudert; Gianlorenzo D'Angelo; Fatima Zahra Moataz (Theor. Comput. Sci., 2015)

Bin Packing with Colocations. - Jean-Claude Bermond; Nathann Cohen; David Coudert; Dimitrios Letsios; Ioannis Milis; Stéphane Pérennes; Vassilis Zissimopoulos (WAOA, 2016)

Round weighting problem and gathering in radio networks with symmetrical interference. - Jean-Claude Bermond; Cristiana Gomes Huiban; Patricio Reyes (Discret. Math. Algorithms Appl., 2016)

How long does it take for all users in a social network to choose their communities? - Jean-Claude Bermond; Augustin Chaintreau; Guillaume Ducoffe; Dorian Mazauric (Discret. Appl. Math., 2019)

On spectrum assignment in elastic optical tree-networks. - Jean-Claude Bermond; Fatima Zahra Moataz (Discret. Appl. Math., 2019)

Distributed link scheduling in wireless networks. - Jean-Claude Bermond; Dorian Mazauric; Vishal Misra; Philippe Nain (Discret. Math. Algorithms Appl., 2020)

Gossiping with Interference Constraints in Radio Chain Networks. - Jean-Claude Bermond; Takako Kodate; Joseph Yu (J. Inf. Process., 2020)

Grabbing Olives on Linear Pizzas and Pissaladières. - Jean-Claude Bermond; Frédéric Havet; Michel Cosnard (FUN, 2022)

Gossiping with interference in radio ring networks. - Jean-Claude Bermond; Takako Kodate; Joseph Yu (Discret. Math. Theor. Comput. Sci., 2023)

Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation. - Fabrício Benevides; Jean-Claude Bermond; Hicham Lesfari; Nicolas Nisse (Eur. J. Comb., 2024)

New lower bounds on the cutwidth of graphs. - Jean-Claude Bermond; Michel Cosnard; David Coudert; Frédéric Havet (Comput. Oper. Res., 2025)