Jean-Claude Bermond

132 papers A* 4A 3B 15C 2Misc 2Journal 90Unranked 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
Maximizing the number of requests in oriented trees with a grooming factor.
Discret. Appl. Math.
Jean-Claude Bermond, Michel Cosnard
2025 J jnl
New lower bounds on the cutwidth of graphs.
Comput. Oper. Res.
Jean-Claude Bermond, Michel Cosnard, David Coudert, Frédéric Havet
2024 J jnl
Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation.
Eur. J. Comb.
Fabrício Benevides, Jean-Claude Bermond, Hicham Lesfari, Nicolas Nisse
2023 J jnl
Gossiping with interference in radio ring networks.
Discret. Math. Theor. Comput. Sci.
Jean-Claude Bermond, Takako Kodate, Joseph Yu
2022 Misc conf
Grabbing Olives on Linear Pizzas and Pissaladières.
FUN
Jean-Claude Bermond, Frédéric Havet, Michel Cosnard
2020 J jnl
Distributed link scheduling in wireless networks.
Discret. Math. Algorithms Appl.
Jean-Claude Bermond, Dorian Mazauric, Vishal Misra, Philippe Nain
2020 J jnl
Gossiping with Interference Constraints in Radio Chain Networks.
J. Inf. Process.
Jean-Claude Bermond, Takako Kodate, Joseph Yu
2019 J jnl
How long does it take for all users in a social network to choose their communities?
Discret. Appl. Math.
Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric
2019 J jnl
On spectrum assignment in elastic optical tree-networks.
Discret. Appl. Math.
Jean-Claude Bermond, Fatima Zahra Moataz
2018 Misc conf
How long does it take for all users in a social network to choose their communities?.
FUN
Jean-Claude Bermond, Augustin Chaintreau, Guillaume Ducoffe, Dorian Mazauric
2016 B conf
Bin Packing with Colocations.
WAOA
Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos
2016 J jnl
Round weighting problem and gathering in radio networks with symmetrical interference.
Discret. Math. Algorithms Appl.
Jean-Claude Bermond, Cristiana Gomes Huiban, Patricio Reyes
2015 J jnl
Data gathering and personalized broadcasting in radio grids with interference.
Theor. Comput. Sci.
Jean-Claude Bermond, Bi Li, Nicolas Nisse, Hervé Rivano, Min-Li Yu
2015 J jnl
Finding disjoint paths in networks with star shared risk link groups.
Theor. Comput. Sci.
Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz
2014 J jnl
Eulerian and Hamiltonian dicycles in Directed hypergraphs.
Discret. Math. Algorithms Appl.
Júlio Araújo, Jean-Claude Bermond, Guillaume Ducoffe
2013 J jnl
Directed acyclic graphs with the unique dipath property.
Theor. Comput. Sci.
Jean-Claude Bermond, Michel Cosnard, Stéphane Pérennes
2013 J jnl
Gathering Radio Messages in the Path.
Discret. Math. Algorithms Appl.
Jean-Claude Bermond, Ralf Klasing, Nelson Morales, Stéphane Pérennes, Patricio Reyes
2013 J jnl
Optimal time data gathering in wireless networks with multidirectional antennas.
Theor. Comput. Sci.
Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele A. Rescigno, Ugo Vaccaro
2013 — conf
SRLG-diverse routing with the star property.
DRCN
Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz
2012 — conf
Diverse routing in networks with star SRLGs.
StudentWorkshop@CoNEXT
Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz
2012 J jnl
GMPLS label space minimization through hypergraph layouts.
Theor. Comput. Sci.
Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado
2012 — conf
Line Directed Hypergraphs.
Cryptography and Security
Jean-Claude Bermond, Fahir Ö. Ergincan, Michel Syska
2012 J jnl
Optimal gathering in radio grids with interference.
Theor. Comput. Sci.
Jean-Claude Bermond, Joseph G. Peters
2012 J jnl
Weighted improper colouring.
J. Discrete Algorithms
Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski
2011 B conf
Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas.
SIROCCO
Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele A. Rescigno, Ugo Vaccaro
2011 J jnl
The α-Arboricity of Complete Uniform Hypergraphs.
SIAM J. Discret. Math.
Jean-Claude Bermond, Yeow Meng Chee, Nathann Cohen, Xiande Zhang
2011 J jnl
Traffic grooming in bidirectional WDM ring networks.
Networks
Jean-Claude Bermond, Xavier Muñoz, Ignasi Sau
2011 C conf
Weighted Improper Colouring.
IWOCA
Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski
2010 A* conf
A distributed scheduling algorithm for wireless networks with constant overhead and arbitrary binary interference.
SIGMETRICS
Jean-Claude Bermond, Dorian Mazauric, Vishal Misra, Philippe Nain
2010 J jnl
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4.
SIAM J. Discret. Math.
Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau
2010 J jnl
Gathering with Minimum Completion Time in Sensor Tree Networks.
J. Interconnect. Networks
Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno
2010 J jnl
Improper Coloring of Weighted Grid and Hexagonal Graphs.
Discret. Math. Algorithms Appl.
Jean-Claude Bermond, Frédéric Havet, Florian Huc, Cláudia Linhares Sales
2010 — conf
On the Average Path Length of Deterministic and Stochastics Recursive Networks.
CompleNet
Philippe J. Giabbanelli, Dorian Mazauric, Jean-Claude Bermond
2010 J jnl
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences.
Ad Hoc Sens. Wirel. Networks
Jean-Claude Bermond, Min-Li Yu
2009 B conf
Designing Hypergraph Layouts to GMPLS Routing Strategies.
SIROCCO
Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado
2009 A* conf
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks.
INFOCOM
Eitan Altaian, Philippe Nain, Jean-Claude Bermond
2009 B conf
MPLS Label Stacking on the Line Network.
Networking
Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Hervé Rivano, Ignasi Sau, Fernando Solano Donado
2009 — conf
Minimum Delay Data Gathering in Radio Networks.
ADHOC-NOW
Jean-Claude Bermond, Nicolas Nisse, Patricio Reyes, Hervé Rivano
2009 J jnl
Optimal gathering protocols on paths under interference constraints.
Discret. Math.
Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu
2008 J jnl
Approximations for All-to-All Uniform Traffic Grooming on Unidirectional Rings.
J. Interconnect. Networks
Jean-Claude Bermond, David Coudert, Benjamin Lévêque
2008 B conf
Gathering with Minimum Delay in Tree Sensor Networks.
SIROCCO
Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno
2008 — conf
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences.
ADHOC-NOW
Jean-Claude Bermond, Min-Li Yu
2007 B conf
Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions.
SIROCCO
Jean-Claude Bermond, Frédéric Giroire, Stéphane Pérennes
2007 A conf
Minimum number of wavelengths equals load in a DAG without internal cycle.
IPDPS
Jean-Claude Bermond, Michel Cosnard
2007 J jnl
Neighborhood Broadcasting in Hypercubes.
SIAM J. Discret. Math.
Jean-Claude Bermond, Afonso Ferreira, Stéphane Pérennes, Joseph G. Peters
2007 J jnl
Traffic grooming on the path.
Theor. Comput. Sci.
Jean-Claude Bermond, Laurent Braud, David Coudert
2007 J jnl
Vertex disjoint routings of cycles over tori.
Networks
Jean-Claude Bermond, Min-Li Yu
2006 J jnl
Fault tolerant on-board networks with priorities.
Networks
Jean-Claude Bermond, Frédéric Havet, Csaba D. Tóth
2006 C conf
Gathering Algorithms on Paths Under Interference Constraints.
CIAC
Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu
2006 J jnl
Hardness and Approximation of Gathering in Static Radio Networks.
Parallel Process. Lett.
Jean-Claude Bermond, Jérôme Galtier, Ralf Klasing, Nelson Morales, Stephane Perennes
2006 — conf
Hardness and approximation of Gathering in static radio networks.
PerCom Workshops
Jean-Claude Bermond, Nelson Morales, Stéphane Pérennes, Jérôme Galtier, Ralf Klasing
2006 — conf
Optimal Solution of the Maximum All Request Path Grooming Problem.
AICT/ICIW
Jean-Claude Bermond, Michel Cosnard, David Coudert, Stéphane Pérennes
2005 J jnl
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio
SIAM J. Discret. Math.
Jean-Claude Bermond, Charles J. Colbourn, David Coudert, Gennian Ge, Alan C. H. Ling, Xavier Muñoz
2005 B conf
Traffic Grooming on the Path.
SIROCCO
Jean-Claude Bermond, Laurent Braud, David Coudert
2004 J jnl
Grooming in unidirectional rings:
Discret. Math.
Jean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu
2003 J jnl
Deadlock Prevention by Acyclic Orientations.
Discret. Appl. Math.
Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
2003 J jnl
Directed virtual path layouts in ATM networks.
Theor. Comput. Sci.
Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes
2003 J jnl
Hierarchical Ring Network design.
Theory Comput. Syst.
Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes
2003 J jnl
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3.
Networks
Jean-Claude Bermond, Stéphan Ceroi
2003 J jnl
On Hamilton cycle decompositions of the tensor product of complete graphs.
Discret. Math.
R. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu
2003 J jnl
The Power of Small Coalitions in Graphs.
Discret. Appl. Math.
Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes
2003 — conf
Traffic grooming in unidirectional WDM ring networks using design theory.
ICC
Jean-Claude Bermond, David Coudert
2002 J jnl
Design of fault-tolerant networks for satellites (TWTA redundancy).
Networks
Jean-Claude Bermond, Éric Darrot, Olivier Delmas
2002 B conf
Hierarchical Ring Network Design.
SIROCCO
Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes
2001 J jnl
A Broadcasting Protocol in Line Digraphs.
J. Parallel Distributed Comput.
Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela
2001 B conf
A note on cycle covering.
SPAA
Jean-Claude Bermond, David Coudert, Lilian Chacon, François Tillerot
2001 B conf
Cycle Covering.
SIROCCO
Jean-Claude Bermond, Lilian Chacon, David Coudert, François Tillerot
2000 A conf
Broadcasting in Hypercubes in the Circuit Switched Model.
IPDPS
Jean-Claude Bermond, Takako Kodate, Stephane Perennes, Alexis Bonnecaze, Patrick Solé
2000 J jnl
Efficient collective communication in optical networks.
Theor. Comput. Sci.
Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro
2000 J jnl
Improved Bounds for Gossiping in Mesh Bus Networks.
J. Interconnect. Networks
Jean-Claude Bermond, Susan Marshall, Min-Li Yu
2000 J jnl
Optimal Orientations of Annular Networks.
J. Interconnect. Networks
Jean-Claude Bermond, Johny Bond, Carole Martin, Aleksandar Sasa Pekec, Fred S. Roberts
1999 B ed.
SIROCCO'99, 6th International Colloquium on Structural Information & Communication Complexity, Lacanau-Ocean, France, 1-3 July, 1999
SIROCCO
Cyril Gavoille, Jean-Claude Bermond, André Raspaud
1998 A conf
Directed Virtual Path Layouts in ATM Networks.
DISC
Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes
1998 J jnl
Fast Gossiping by Short Messages.
SIAM J. Comput.
Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
1998 J jnl
Hamilton Circuits in the Directed Wrapped Butterfly Network.
Discret. Appl. Math.
Jean-Claude Bermond, Olivier Delmas, Éric Darrot, Stephane Perennes
1998 J jnl
Hamilton Cycle Decomposition of the Butterfly Network.
Parallel Process. Lett.
Jean-Claude Bermond, Éric Darrot, Olivier Delmas, Stephane Perennes
1998 J jnl
Optimal Sequential Gossiping by Short Messages.
Discret. Appl. Math.
Jean-Claude Bermond, Luisa Gargano, Stephane Perennes
1997 J jnl
A Note on the Dimensionality of Modified Knö;del Graphs.
Int. J. Found. Comput. Sci.
Jean-Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stephane Perennes
1997 B conf
Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract).
WG
Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
1997 J jnl
De Bruijn and Kautz bus networks.
Networks
Jean-Claude Bermond, Robin W. Dawes, Fahir Ö. Ergincan
1997 J jnl
Mean eccentricities of de Bruijn networks.
Networks
Jean-Claude Bermond, Zhen Liu, Michel Syska
1996 J jnl
Bus Interconnection Networks.
Discret. Appl. Math.
Jean-Claude Bermond, Fahir Ö. Ergincan
1996 A* conf
Efficient Collective Communication in Optical Networks.
ICALP
Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro
1996 — conf
Induced Broadcasting Algorithms in Iterated Line Digraphs.
Euro-Par, Vol. I
Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela
1996 J jnl
Parallelization of the {Gaussian} Elimination Algorithm on Systolic Arrays.
J. Parallel Distributed Comput.
Jean-Claude Bermond, Claudine Peyrat, I. Sakho, Maurice Tchuenté
1996 B conf
Tight Bounds on the Size of 2-Monopolies.
SIROCCO
Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes
1995 J jnl
Antepenultimate broadcasting.
Networks
Jean-Claude Bermond, Pierre Fraigniaud, Joseph G. Peters
1995 J jnl
Distributed Loop Computer Networks: A Survey.
J. Parallel Distributed Comput.
Jean-Claude Bermond, Francesc Comellas, D. Frank Hsu
1995 B conf
Efficient Broadcasting Protocols on the de Bruijn and Similar Networks.
SIROCCO
Jean-Claude Bermond, Stephane Perennes
1995 A* conf
Fast Gossiping by Short Messages.
ICALP
Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
1995 — conf
Gossiping in Cayley Graphs by Packets.
Combinatorics and Computer Science
Jean-Claude Bermond, Takako Kodate, Stephane Perennes
1995 B conf
The Power of Small Coalitions in Graphs.
SIROCCO
Jean-Claude Bermond, David Peleg
1994 J jnl
Broadcasting and Gossiping in de Bruijn Networks.
SIAM J. Comput.
Jean-Claude Bermond, Pierre Fraigniaud
1994 — conf
Dense bus networks of diameter 2.
Interconnection Networks and Mapping and Scheduling Parallel Computations
Jean-Claude Bermond, Johny Bond, Selma Djelloul
1993 J jnl
Connectivity of kautz networks.
Discret. Math.
Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat
1993 J jnl
On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs.
J. Graph Theory
Jean-Claude Bermond, Pavol Hell
1992 J jnl
Broadcasting in Bounded Degree Graphs.
SIAM J. Discret. Math.
Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters
1992 J jnl
Broadcasting in wraparound meshes with parallel monodirectional links.
Parallel Comput.
Jean-Claude Bermond, Philippe Michallon, Denis Trystram
1992 J jnl
Construction of Large Packet Radio Networks.
Parallel Process. Lett.
Jean-Claude Bermond, Pavol Hell, Jean-Jacques Quisquater
1992 J jnl
Foreword.
Discret. Appl. Math.
Jean-Claude Bermond
1992 J jnl
Sparse broadcast graphs.
Discret. Appl. Math.
Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters
1992 J jnl
Table of Large (
Discret. Appl. Math.
Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater
1991 J jnl
Minimal diameter double-loop networks: Dense optimal families.
Networks
Jean-Claude Bermond, Dvora Tzvieli
1990 J jnl
Existence of Resolvable Path Designs.
Eur. J. Comb.
Jean-Claude Bermond, Katherine Heinrich, Min-Li Yu
1990 J jnl
On Resolvable Mixed Path Designs.
Eur. J. Comb.
Jean-Claude Bermond, Katherine Heinrich, Min-Li Yu
1989 — ed.
Distributed Algorithms, 3rd International Workshop, Nice, France, September 26-28, 1989, Proceedings
WDAG
Jean-Claude Bermond, Michel Raynal
1989 J jnl
Extensions of networks with given diameter.
Discret. Math.
Jean-Claude Bermond, Karima Berrada, Johny Bond
1989 J jnl
Hamiltonian decomposition of Cayley graphs of degree 4.
J. Comb. Theory B
Jean-Claude Bermond, Odile Favaron, Maryvonne Mahéo
1989 J jnl
Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks.
Theor. Comput. Sci.
Jean-Claude Bermond, Jean-Michel Fourneau
1989 J jnl
Induced Subgraphs of the Power of a Cycle.
SIAM J. Discret. Math.
Jean-Claude Bermond, Claudine Peyrat
1989 J jnl
Large fault-tolerant interconnection networks.
Graphs Comb.
Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat
1988 — conf
Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks.
ICPP (1)
Jean-Claude Bermond, Jean-Michel Fourneau
1987 J jnl
Equivalence of Multistage Interconnection Networks.
Inf. Process. Lett.
Jean-Claude Bermond, Jean-Michel Fourneau, Alain Jean-Marie
1987 — conf
General and Efficient Decentralized Consensus Protocols.
WDAG
Jean-Claude Bermond, Jean-Claude König, Michel Raynal
1986 J jnl
Strategies for Interconnection Networks: Some Methods from Graph Theory.
J. Parallel Distributed Comput.
Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater
1984 J jnl
Large graphs with given degree and diameter. II.
J. Comb. Theory B
Jean-Claude Bermond, Charles Delorme, G. Farhi
1984 J jnl
On linear k-arboricity.
Discret. Math.
Jean-Claude Bermond, Jean-Luc Fouquet, Michel Habib, Bernard Péroche
1984 J jnl
Regular factors in nearly regular graphs.
Discret. Math.
Jean-Claude Bermond, Michel Las Vergnas
1983 J jnl
Shortest coverings of graphs with cycles.
J. Comb. Theory B
Jean-Claude Bermond, Bill Jackson, François Jaeger
1982 J jnl
Tables of Large Graphs with Given Degree and Diameter.
Inf. Process. Lett.
Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater
1981 J jnl
Cycles in digraphs- a survey.
J. Graph Theory
Jean-Claude Bermond, Carsten Thomassen
1981 J jnl
Longest paths in digraphs.
Comb.
Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
1980 J jnl
Girth in digraphs.
J. Graph Theory
Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
1980 J jnl
On the maximum number of edges in a hypergraph whose linegraph contains no cycle.
Discret. Math.
Jean-Claude Bermond, Peter Frankl, F. Sterboul
1979 J jnl
Resolvable Decomposition of K
J. Comb. Theory A
Jean-Claude Bermond, Anne Germa, Dominique Sotteau
1977 J jnl
G-decomposition of K
Discret. Math.
Jean-Claude Bermond, Johanan Schönheim
1977 J jnl
Line graphs of hypergraphs I.
Discret. Math.
Jean-Claude Bermond, Marie-Claude Heydemann, Dominique Sotteau
1976 J jnl
Decomposition of the complete directed graph into k-circuits.
J. Comb. Theory B
Jean-Claude Bermond, Vance Faber
1976 J jnl
Une Heuristique pour le Calcul de l'Indice de Transitivité d'un Tournoi.
RAIRO Theor. Informatics Appl.
Jean-Claude Bermond, Yves Kodratoff
1975 — book
Cycles dans les graphes et G-configurations.
Jean-Claude Bermond
1974 J jnl
An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits.
Discret. Math.
Jean-Claude Bermond
1974 J jnl
Some Ramsey numbers for directed graphs.
Discret. Math.
Jean-Claude Bermond