Jean-Claude Bermond

254
Documents

Publications

Publications

Deposit thumbnail

New lower bounds on the cutwidth of graphs

Jean-Claude Bermond , Michel Cosnard , David Coudert , Frédéric Havet

Computers and Operations Research, 2025, 182, pp.107130. ⟨10.1016/j.cor.2025.107130⟩

Article dans une revue hal-05083322v1
Deposit thumbnail

Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation

Fabricio Benevides , Jean-Claude Bermond , Hicham Lesfari , Nicolas Nisse

European Journal of Combinatorics, 2024, 119, pp.18. ⟨10.1016/j.ejc.2023.103801⟩

Article dans une revue hal-04368240v1
Deposit thumbnail

Gossiping with interference in radio ring networks

Jean-Claude Bermond , Takako Kodate , Joseph Yu

Discrete Mathematics and Theoretical Computer Science, 2023, 25 (2), pp.#5. ⟨10.46298/dmtcs.9399⟩

Article dans une revue hal-04206040v4
Deposit thumbnail

Graphes et Télécommunications

Jean-Claude Bermond , Frédéric Giroire , Nicolas Nisse

Bibliothèque Tangente, 2021, Hors Serie 75 La recherche opérationnelle, Hors Serie 75, pp.120-125

Article dans une revue hal-03455881v1
Deposit thumbnail

Gossiping with Interference Constraints in Radio Chain Networks

Jean-Claude Bermond , Takako Kodate , Joseph Yu

Journal of Information Processing, 2020, 28, pp.889-902. ⟨10.2197/ipsjjip.28.889⟩

Article dans une revue hal-03129626v1
Deposit thumbnail

Distributed Link Scheduling in Wireless Networks

Jean-Claude Bermond , Dorian Mazauric , Vishal Misra , Philippe Nain

Discrete Mathematics, Algorithms and Applications, 2020, 12 (5), pp.1-38. ⟨10.1142/S1793830920500585⟩

Article dans une revue hal-01977266v2
Deposit thumbnail

On spectrum assignment in elastic optical tree-networks

Jean-Claude Bermond , Fatima Zahra Moataz

Discrete Applied Mathematics, 2019, 257, pp.40-52. ⟨10.1016/j.dam.2018.09.021⟩

Article dans une revue hal-01962617v1
Deposit thumbnail

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

Discrete Applied Mathematics, 2019, 270, pp.37-57. ⟨10.1016/j.dam.2019.07.023⟩

Article dans une revue hal-02264327v1
Deposit thumbnail

Round weighting problem and gathering in radio networks with symmetrical interference

Jean-Claude Bermond , Cristiana Gomes Huiban , Patricio Reyes

Discrete Mathematics, Algorithms and Applications, 2016, 8 (2), 1650035 57 p. ⟨10.1142/S179383091650035X⟩

Article dans une revue hal-01407591v1
Deposit thumbnail

Well Balanced Designs for Data Placement

Jean-Claude Bermond , Alain Jean-Marie , Dorian Mazauric , Joseph Yu

Journal of Combinatorial Designs, 2016, 24 (2), pp.55-76. ⟨10.1002/jcd.21506⟩

Article dans une revue hal-01223288v1
Deposit thumbnail

Finding disjoint paths in networks with star shared risk link groups

Jean-Claude Bermond , David Coudert , Gianlorenzo d'Angelo , Fatima Zahra Moataz

Theoretical Computer Science, 2015, 579, pp.74-87. ⟨10.1016/j.tcs.2015.02.012⟩

Article dans une revue hal-01132216v1
Deposit thumbnail

Data gathering and personalized broadcasting in radio grids with interference

Jean-Claude Bermond , Bi Li , Nicolas Nisse , Hervé Rivano , Min-Li Yu

Theoretical Computer Science, 2015, 562, pp.453-475. ⟨10.1016/j.tcs.2014.10.029⟩

Article dans une revue hal-01084996v1
Deposit thumbnail

Eulerian and Hamiltonian dicycles in directed hypergraphs

Julio Araujo , Jean-Claude Bermond , Guillaume Ducoffe

Discrete Mathematics, Algorithms and Applications, 2014, 06, pp.1450012. ⟨10.1142/S1793830914500128⟩

Article dans une revue hal-01104634v2
Deposit thumbnail

Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas

Jean-Claude Bermond , Luisa Gargano , Stéphane Pérennes , Adele Rescigno , Ugo Vaccaro

Theoretical Computer Science, 2013, 509, pp.122-139. ⟨10.1016/j.tcs.2013.03.017⟩

Article dans une revue hal-00905187v1
Deposit thumbnail

Gathering radio messages in the path

Jean-Claude Bermond , Ralf Klasing , Nelson Morales , Stéphane Pérennes , Patricio Reyes

Discrete Mathematics, Algorithms and Applications, 2013, 5 (1), pp.1-28. ⟨10.1142/S1793830913500043⟩

Article dans une revue hal-00907494v1
Deposit thumbnail

Directed acyclic graphs with the unique dipath property

Jean-Claude Bermond , Michel Cosnard , Stéphane Pérennes

Theoretical Computer Science, 2013, 504, pp.5-11. ⟨10.1016/j.tcs.2012.06.015⟩

Article dans une revue hal-00869501v1
Deposit thumbnail

Weighted improper colouring

Julio Araujo , Jean-Claude Bermond , Frédéric Giroire , Frédéric Havet , Dorian Mazauric et al.

Journal of Discrete Algorithms, 2012, 16, pp.53-66. ⟨10.1016/j.jda.2012.07.001⟩

Article dans une revue hal-00747755v1
Deposit thumbnail

Optimal Gathering in Radio Grids with Interference

Jean-Claude Bermond , Joseph Peters

Theoretical Computer Science, 2012, 457, pp.10-26. ⟨10.1016/j.tcs.2012.07.021⟩

Article dans une revue hal-00747751v1
Deposit thumbnail

Internet et la théorie des graphes

Jean-Claude Bermond , Joanna Moulierac

Textes et documents pour la classe, 2012, 1042, pp.32-33

Article dans une revue hal-00747752v1
Deposit thumbnail

GMPLS Label Space Minimization through Hypergraph Layouts

Jean-Claude Bermond , David Coudert , Joanna Moulierac , Stéphane Pérennes , Ignasi Sau et al.

Theoretical Computer Science, 2012, 444, pp.3-16. ⟨10.1016/j.tcs.2012.01.033⟩

Article dans une revue hal-00706260v1
Deposit thumbnail

The $\alpha$-Arboricity of Complete Uniform Hypergraphs

Jean-Claude Bermond , Y.M Chee , Nathann Cohen , X. Zhang

SIAM Journal on Discrete Mathematics, 2011, 25 (2), pp.600-610. ⟨10.1137/100806035⟩

Article dans une revue inria-00589689v1
Deposit thumbnail

Traffic grooming in bidirectional WDM ring networks

Jean-Claude Bermond , Xavier Muñoz , Ignasi Sau

Networks, 2011, 58 (1), pp.20-35. ⟨10.1002/net.20410⟩

Article dans une revue hal-00643800v1
Deposit thumbnail

DROP COST AND WAVELENGTH OPTIMAL TWO-PERIOD GROOMING WITH RATIO 4∗

Jean-Claude Bermond , Charles J. Colbourn , Lucia Gionfriddo , Gaetano Quattrocchi , Ignasi Sau

SIAM Journal on Discrete Mathematics, 2010, 24 (2), pp.400-419

Article dans une revue inria-00505516v1
Deposit thumbnail

Gathering with Minimum Completion Time in Sensor Tree Networks

Jean-Claude Bermond , Luisa Gargano , Adele Rescigno

Journal of Interconnection Networks, 2010, 11 (1-2), pp.1-33. ⟨10.1142/S0219265910002714⟩

Article dans une revue hal-00535816v1
Deposit thumbnail

Optimal gathering algorithms in multi-hop radio tree networks with interferences.

Jean-Claude Bermond , Min-Li Yu

Ad Hoc & Sensor Wireless Networks, 2010, 9 (1-2), pp.109-128

Article dans une revue inria-00505517v1
Deposit thumbnail

Improper colouring of weighted grid and hexagonal graphs

Jean-Claude Bermond , Frédéric Havet , Florian Huc , Claudia Linhares Sales

Discrete Mathematics, Algorithms and Applications, 2010, 2 (3), pp.395-411. ⟨10.1142/S1793830910000747⟩

Article dans une revue inria-00526530v1

Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4

Jean-Claude Bermond , Charles J. Colbourn , Lucia Gionfriddo , Gaetano Quattrocchi , Ignasi Sau

SIAM Journal on Discrete Mathematics, 2010, 24 (2), pp.400-419. ⟨10.1137/080744190⟩

Article dans une revue lirmm-00736478v1
Deposit thumbnail

Optimal Gathering Protocols on Paths under Interference Constraints

Jean-Claude Bermond , Ricardo Correa , Min-Li Yu

Discrete Mathematics, 2009, 309 (18), pp.5574-5587

Article dans une revue inria-00429084v1
Deposit thumbnail

Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring

Jean-Claude Bermond , David Coudert , Benjamin Lévêque

Journal of Interconnection Networks, 2008, 9 (4), pp.471-486. ⟨10.1142/S0219265908002394⟩

Article dans une revue inria-00429217v1
Deposit thumbnail

Neighbourhood Broadcasting in Hypercubes

Jean-Claude Bermond , Afonso Ferreira , Stéphane Pérennes , Joseph Peters

SIAM Journal on Discrete Mathematics, 2007, 21 (4), pp.823-843

Article dans une revue hal-00429191v1
Deposit thumbnail

Traffic Grooming on the Path

Jean-Claude Bermond , Laurent Braud , David Coudert

Theoretical Computer Science, 2007, Structural Information and Communication Complexity (SIROCCO 2005), 384 (2-3), pp.139-151. ⟨10.1016/j.tcs.2007.04.028⟩

Article dans une revue inria-00308716v1
Deposit thumbnail

Vertex disjoint routings of cycles over tori

Jean-Claude Bermond , Min-Li Yu

Networks, 2007, 49 (3), pp.217-225

Article dans une revue inria-00429086v1
Deposit thumbnail

Hardness and approximation of Gathering in static radio networks

Jean-Claude Bermond , Jérôme Galtier , Ralf Klasing , Nelson Morales , Stéphane Pérennes

Parallel Processing Letters, 2006, 16 (2), pp.165-183

Article dans une revue inria-00430158v1
Deposit thumbnail

Fault tolerant on board networks with priorities

Jean-Claude Bermond , Frédéric Havet , C.D. Toth

Networks, 2006, 47 (1), pp.9-25

Article dans une revue inria-00430156v1
Deposit thumbnail

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 et al.

SIAM Journal on Discrete Mathematics, 2005, 19 (2), pp.523-542. ⟨10.1137/S0895480104444314⟩

Article dans une revue inria-00429214v1
Deposit thumbnail

Grooming in unidirectional rings : $K_4 -e$ designs.

Jean-Claude Bermond , Charles J. Colbourn , Alan C H Ling , Min-Li Yu

Discrete Mathematics, 2004, 284 (1-3), pp.57-62

Article dans une revue inria-00505518v1
Deposit thumbnail

Deadlock prevention by acyclic orientations

Jean-Claude Bermond , Miriam Di Ianni , Michele Flammini , Stéphane Pérennès

Discrete Applied Mathematics, 2003, 129 (1), pp.31-47. ⟨10.1016/S0166-218X(02)00232-9⟩

Article dans une revue hal-03764730v1
Deposit thumbnail

On Hamilton cycle decompositions of the tensor product of complete graphs

Rangaswami Balakrishnan , Jean-Claude Bermond , Paul Paulraja , Min Li Yu

Discrete Mathematics, 2003, 268 (1-3), pp.49-58. ⟨10.1016/S0012-365X(02)00680-5⟩

Article dans une revue hal-03764835v1
Deposit thumbnail

On DRC-covering of Kn by cycles

Jean-Claude Bermond , David Coudert , Min-Li Yu

Journal of Combinatorial Designs, 2003, 11 (2), pp.100 - 112. ⟨10.1002/jcd.10040⟩

Article dans une revue istex inria-00429205v1
Deposit thumbnail

Directed virtual path layouts in ATM networks

Jean-Claude Bermond , Nausica Marlin , David Peleg , Stéphane Pérennes

Theoretical Computer Science, 2003, 291 (1), pp.3-28. ⟨10.1016/S0304-3975(01)00394-2⟩

Article dans une revue hal-03764856v1

Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio 3

Jean-Claude Bermond , Stephan Ceroi

Networks, 2003, 41 (2), pp.83-86

Article dans une revue lirmm-00269767v1
Deposit thumbnail

Design of fault-tolerant networks for satellites (TWTA redundancy)

Jean-Claude Bermond , Éric Darrot , Olivier Delmas

Networks, 2002, 40 (4), pp.202--207. ⟨10.1002/net.10044⟩

Article dans une revue istex hal-00307611v1
Deposit thumbnail

A Broadcasting protocol in Line Digraphs

Jean-Claude Bermond , Xavier Muñoz , Alberto Marchetti-Spaccamela

Journal of Parallel and Distributed Computing, 2001, 61 (8), pp.1013-1032. ⟨10.1006/jpdc.2001.1737⟩

Article dans une revue hal-03768202v1
Deposit thumbnail

Optimal orientations of annular networks

Jean-Claude Bermond , Johny Bond , Carole Martin , Aleksandar Pekeč , Fred Roberts

Journal of Interconnection Networks, 2000, 01, pp.21-46. ⟨10.1142/S0219265900000032⟩

Article dans une revue hal-03764808v1
Deposit thumbnail

Efficient collective communication in optical networks

Jean-Claude Bermond , Luisa Gargano , Stéphane Pérennes , Adele Rescigno , Ugo Vaccaro

Theoretical Computer Science, 2000, 233 (1-2), pp.165-189. ⟨10.1016/S0304-3975(98)00018-8⟩

Article dans une revue hal-03764750v1
Deposit thumbnail

Improved bounds for gossiping in mesh bus networks

Jean-Claude Bermond , Susan Marshall , Min-Li Yu

Journal of Interconnection Networks, 2000, 01 (1), pp.1-19. ⟨10.1142/S0219265900000020⟩

Article dans une revue hal-03764772v1
Deposit thumbnail

Symmetric flows and broadcasting in hypercubes

Jean-Claude Bermond , Alexis Bonnecaze , Takako Kodate , Stéphane Pérennes , Patrick Solé

Annales de l'Institut Fourier, 1999, 49, pp.787-807

Article dans une revue hal-03762659v1
Deposit thumbnail

Hamilton Cycle Decomposition of the Butterfly Network

Jean-Claude Bermond , Eric Darrot , Olivier Delmas , Stéphane Pérennes

Parallel Processing Letters, 1998, 8 (3), pp.371-385. ⟨10.1142/S0129626498000389⟩

Article dans une revue hal-00407366v1
Deposit thumbnail

Optimal Sequential Gossiping by Short Messages

Jean-Claude Bermond , Luisa Gargano , Stéphane Pérennes

Discrete Applied Mathematics, 1998, 86, pp.145-155

Article dans une revue hal-03762654v1
Deposit thumbnail

Fast Gossiping by Short Messages

Jean-Claude Bermond , Luisa Gargano , Adele Rescigno , Ugo Vaccaro

SIAM Journal on Computing, 1998, 27 (4), pp.917-941. ⟨10.1137/S0097539795283619⟩

Article dans une revue hal-03224084v1
Deposit thumbnail

Hamilton circuits in the directed wrapped Butterfly network

Jean-Claude Bermond , Eric Darrot , Olivier Delmas , Stéphane Pérennes

Discrete Applied Mathematics, 1998, 84 (1-3), pp.21-42. ⟨10.1016/S0166-218X(97)00095-4⟩

Article dans une revue hal-00407356v1
Deposit thumbnail

A NOTE ON THE DIMENSIONALITY OF MODIFIED KNÖDEL GRAPHS

Jean-Claude Bermond , Hovhannes Harutyunyan , Arthur L. Liestman , Stéphane Perennes

International Journal on Fundations of Computer Science, 1997, 8, pp.109-116

Article dans une revue hal-03762653v1
Deposit thumbnail

Mean eccentricities of de Bruijn networks

Jean-Claude Bermond , Zhen Liu , Michel Syska Article dans une revue hal-03220046v1
Deposit thumbnail

De Bruijn and Kautz Bus networks

Jean-Claude Bermond , Robin Dawes , Fahir Ö. Ergincan Article dans une revue istex hal-03210219v1
Deposit thumbnail

Parallelization of the Gaussian Elimination Algorithm on Systolic Arrays

Jean-Claude Bermond , Claudine Peyrat , I. Sakho , Maurice Tchuenté

Journal of Parallel and Distributed Computing, 1996, 33 (1), pp.69-75. ⟨10.1006/jpdc.1996.0025⟩

Article dans une revue istex hal-03013456v1
Deposit thumbnail

Bus interconnection networks

Jean-Claude Bermond , Fahir Ö. Ergincan

Discrete Applied Mathematics, 1996, 68 (1-2), pp.1-15. ⟨10.1016/0166-218X(95)00046-T⟩

Article dans une revue istex hal-03216209v1
Deposit thumbnail

Antepenultimate broadcasting

Jean-Claude Bermond , Pierre Fraigniaud , Joseph Peters

Networks, 1995, 26 (3), pp.125-137. ⟨10.1002/net.3230260302⟩

Article dans une revue istex hal-03210206v1
Deposit thumbnail

Distributed Loop Computer-Networks: A Survey

Jean-Claude Bermond , Francesco Comellas , D.Frank Hsu

Journal of Parallel and Distributed Computing, 1995, 24 (1), pp.2-10. ⟨10.1006/jpdc.1995.1002⟩

Article dans une revue hal-03013440v1
Deposit thumbnail

Broadcasting and Gossiping in de Bruijn Networks

Jean-Claude Bermond , Pierre Fraigniaud

SIAM Journal on Computing, 1994, 23 (1), pp.212-225. ⟨10.1137/S0097539791197852⟩

Article dans une revue hal-03203473v1
Deposit thumbnail

On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs

Jean-Claude Bermond , Pavol Hell

Journal of Graph Theory, 1993, 17 (5), pp.647-655. ⟨10.1002/jgt.3190170512⟩

Article dans une revue istex hal-03200908v1
Deposit thumbnail

La théorie des graphes

Jean-Claude Bermond , Emmanuel Lazard , Dominique Sotteau , Michel Syska

Le Courrier du CNRS, 1993, 80, pp.54-55

Article dans une revue hal-03210214v1
Deposit thumbnail

Connectivity of kautz networks

Jean-Claude Bermond , Nathalie Homobono , Claudine Peyrat

Discrete Mathematics, 1993, 114 (1-3), pp.51-62. ⟨10.1016/0012-365X(93)90355-W⟩

Article dans une revue hal-03200904v1
Deposit thumbnail

Broadcasting in wraparound meshes with parallel monodirectional links

Jean-Claude Bermond , Philippe Michallon , Denis Trystram

Parallel Computing, 1992, 18 (6), pp.639-648. ⟨10.1016/0167-8191(92)90004-Q⟩

Article dans une revue hal-03203497v1
Deposit thumbnail

Table of large ($Δ$,$D$)-graphs

Jean-Claude Bermond , Charles Delorme , Jean-Jacques Quisquater

Discrete Applied Mathematics, 1992, 37-38 (1), pp.575-577. ⟨10.1016/0166-218X(92)90160-C⟩

Article dans une revue hal-02435543v1
Deposit thumbnail

CONSTRUCTION OF LARGE PACKET RADIO NETWORKS

Jean-Claude Bermond , Pavol Hell , Jean-Jacques Quisquater

Parallel Processing Letters, 1992, 02 (01), pp.3-12. ⟨10.1142/S012962649200012X⟩

Article dans une revue hal-03200906v1
Deposit thumbnail

Sparse broadcast graphs

Jean-Claude Bermond , Pavol Hell , Arthur Liestman , Joseph Peters

Discrete Applied Mathematics, 1992, 36 (2), pp.97-130. ⟨10.1016/0166-218X(92)90226-Z⟩

Article dans une revue hal-03189948v1
Deposit thumbnail

Broadcasting in Bounded Degree Graphs

Jean-Claude Bermond , Pavol Hell , Arthur Liestman , Joseph Peters

SIAM Journal on Discrete Mathematics, 1992, 5 (1), pp.10-24. ⟨10.1137/0405002⟩

Article dans une revue hal-03189954v1
Deposit thumbnail

Minimal diameter double-loop networks: Dense optimal families

Jean-Claude Bermond , Dvora Tzvieli

Networks, 1991, 21 (1), pp.1-9. ⟨10.1002/net.3230210102⟩

Article dans une revue istex hal-03013377v1
Deposit thumbnail

Un protocole distribué pour la 2-connexité

Jean-Claude Bermond , Jean-Claude König

Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, 1991, 10 (4), pp.269-274

Article dans une revue hal-03200907v1
Deposit thumbnail

On Resolvable Mixed Path Designs

Jean-Claude Bermond , Katherine Heinrich , Min-Li Yu

European Journal of Combinatorics, 1990, 11 (4), pp.313-318. ⟨10.1016/S0195-6698(13)80132-1⟩

Article dans une revue hal-03189957v1
Deposit thumbnail

Existence of Resolvable Path Designs

Jean-Claude Bermond , Katherine Heinrich , Min-Li Yu

European Journal of Combinatorics, 1990, 11 (3), pp.205-211. ⟨10.1016/S0195-6698(13)80120-5⟩

Article dans une revue hal-02974661v1
Deposit thumbnail

Large fault-tolerant interconnection networks

Jean-Claude Bermond , Nathalie Homobono , Claudine Peyrat

Graphs and Combinatorics, 1989, 5 (1), pp.107-123. ⟨10.1007/BF01788663⟩

Article dans une revue istex hal-02508728v1
Deposit thumbnail

An Optimization Problem in Distributed Loop Computer Networks

Jean-Claude Bermond , G. Illiades , Claudine Peyrat

Annals of the New York Academy of Sciences, 1989, 555 (1 Combinatorial), pp.45-55. ⟨10.1111/j.1749-6632.1989.tb22436.x⟩

Article dans une revue istex hal-02493602v1
Deposit thumbnail

Extensions of networks with given diameter

Jean-Claude Bermond , Karima Berrada , J. Bond

Discrete Mathematics, 1989, 75 (1-3), pp.31-40. ⟨10.1016/0012-365X(89)90075-7⟩

Article dans une revue hal-02973248v1
Deposit thumbnail

Hamiltonian decomposition of Cayley graphs of degree 4

Jean-Claude Bermond , Odile Favaron , Maryvonne Maheo

Journal of Combinatorial Theory, Series B, 1989, 46 (2), pp.142-153. ⟨10.1016/0095-8956(89)90040-3⟩

Article dans une revue hal-02500476v1
Deposit thumbnail

Induced Subgraphs of the Power of a Cycle

Jean-Claude Bermond , Claudine Peyrat

SIAM Journal on Discrete Mathematics, 1989, 2 (4), pp.452-455. ⟨10.1137/0402039⟩

Article dans une revue hal-03200902v1
Deposit thumbnail

Independent connections: an easy characterization of baseline-equivalent multistage interconnection networks

Jean-Claude Bermond , Jean-Michel Fourneau

Theoretical Computer Science, 1989, 64 (2), pp.191-201. ⟨10.1016/0304-3975(89)90061-3⟩

Article dans une revue hal-03013436v1
Deposit thumbnail

Combinatorial Designs and Hypergraphs of Diameter One

Jean-Claude Bermond , Johny Bond

Annals of the New York Academy of Sciences, 1989, 576 (1 Graph Theory), pp.51-62. ⟨10.1111/j.1749-6632.1989.tb16382.x⟩

Article dans une revue istex hal-02493603v1
Deposit thumbnail

Research problems

Jean-Claude Bermond

Discrete Mathematics, 1988, 71 (3), pp.275-276. ⟨10.1016/0012-365X(88)90107-0⟩

Article dans une revue hal-03203456v1
Deposit thumbnail

A graph theoretical approach to equivalence of multistage interconnection networks

Jean-Claude Bermond , Jean-Michel Fourneau , Alain Jean-Marie

Discrete Applied Mathematics, 1988, 22 (3), pp.201-214. ⟨10.1016/0166-218X(88)90096-0⟩

Article dans une revue hal-02493599v1
Deposit thumbnail

Broascasting in de Bruijn networks

Jean-Claude Bermond , Claudine Peyrat

Congressus Numerantium, 1988, 66, pp.283-292

Article dans une revue hal-03013393v1
Deposit thumbnail

Equivalence of multistage interconnection networks

Jean-Claude Bermond , Jean-Michel Fourneau , Alain Jean-Marie

Information Processing Letters, 1987, 26 (1), pp.45-50. ⟨10.1016/0020-0190(87)90035-4⟩

Article dans une revue istex hal-02481509v1
Deposit thumbnail

On regular packings and coverings

Jean-Claude Bermond , Johny Bond , Dominique Sotteau

Annals of Discrete Mathematics, 1987, 34, pp.81-99. ⟨10.1016/S0304-0208(08)72877-9⟩

Article dans une revue hal-02508731v1
Deposit thumbnail

Research problem (Hamilton powers of graphs)

Jean-Claude Bermond , Madeleine Paoli

Discrete Mathematics, 1986, 62 (3), pp.329-331. ⟨10.1016/0012-365X(86)90223-2⟩

Article dans une revue hal-02493594v1
Deposit thumbnail

Strategies for interconnection networks: Some methods from graph theory

Jean-Claude Bermond , Charles Delorme , Jean-Jacques Quisquater

Journal of Parallel and Distributed Computing, 1986, 3 (4), pp.433-449. ⟨10.1016/0743-7315(86)90008-0⟩

Article dans une revue istex hal-02453396v1
Deposit thumbnail

Regular factors in nearly regular graphs

Jean-Claude Bermond , Michel Las Vergnas

Discrete Mathematics, 1984, 50, pp.9-13. ⟨10.1016/0012-365X(84)90030-X⟩

Article dans une revue hal-02426790v1
Deposit thumbnail

On linear k-arboricity

Jean-Claude Bermond , Jean-Luc Fouquet , Michel Habib , Bernard Peroche

Discrete Mathematics, 1984, 52 (2-3), pp.123-132. ⟨10.1016/0012-365X(84)90075-X⟩

Article dans une revue hal-02437859v1
Deposit thumbnail

Large graphs with given degree and diameter. II

Jean-Claude Bermond , Charles Delorme , Guy Farhi

Journal of Combinatorial Theory, Series B, 1984, 36 (1), pp.32-48. ⟨10.1016/0095-8956(84)90012-1⟩

Article dans une revue hal-02426941v1
Deposit thumbnail

Shortest coverings of graphs with cycles

Jean-Claude Bermond , Bill Jackson , François Jaeger

Journal of Combinatorial Theory, Series B, 1983, 35 (3), pp.297-308. ⟨10.1016/0095-8956(83)90056-4⟩

Article dans une revue hal-02447197v1
Deposit thumbnail

Grands Graphes De Degré Et Diamètre Fixés

Jean-Claude Bermond , Charles Delorme , Jean-Jacques Quisquater

Annals of Discrete Mathematics, 1983, 17, pp.65-73. ⟨10.1016/S0304-0208(08)73374-7⟩

Article dans une revue hal-02435537v1
Deposit thumbnail

Sur Un Probleme Combinatoire D'Antennes En Radioastronomie II

Jean-Claude Bermond , G. Farhi

Annals of Discrete Mathematics, 1982, 12, pp.49-53. ⟨10.1016/S0304-0208(08)73490-X⟩

Article dans une revue hal-02424286v1
Deposit thumbnail

Tables of large graphs with given degree and diameter

Jean-Claude Bermond , Charles Delorme , Jean-Jacques Quisquater

Information Processing Letters, 1982, 15 (1), pp.10-13. ⟨10.1016/0020-0190(82)90076-X⟩

Article dans une revue istex hal-02437864v1
Deposit thumbnail

Large Graphs with Given Degree and Diameter III

Jean-Claude Bermond , Charles Delorme , Guy Farhi

Annals of Discrete Mathematics, 1982, 13, pp.23-31. ⟨10.1016/S0304-0208(08)73544-8⟩

Article dans une revue hal-02435539v1
Deposit thumbnail

Longest paths in digraphs

Jean-Claude Bermond , Anne Germa , Marie-Claude Heydemann , Dominique Sotteau

Combinatorica, 1981, 1, pp.337-341

Article dans une revue hal-02379952v1
Deposit thumbnail

Cycles in digraphs- a survey

Jean-Claude Bermond , Carsten Thomassen

Journal of Graph Theory, 1981, 5 (1), pp.1-43. ⟨10.1002/jgt.3190050102⟩

Article dans une revue istex hal-02424283v1
Deposit thumbnail

Sur le jeu des cavaliers

Jean-Claude Bermond

Bulletin Vert de l'association des professeurs de mathématiques de l'enseignement public, 1981, 328, pp.315-320

Article dans une revue hal-02426806v1
Deposit thumbnail

Decomposition of complete graphs into isomorphic subgraphs with five vertices

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

Ars Combinatoria, 1980, 10, pp.211-254

Article dans une revue hal-02333419v1
Deposit thumbnail

Girth in digraphs

Jean-Claude Bermond , A. Germa , Marie-Claude Heydemann , Dominique Sotteau

Journal of Graph Theory, 1980, 4 (3), pp.337-341. ⟨10.1002/jgt.3190040311⟩

Article dans une revue istex hal-02333830v1
Deposit thumbnail

Chemins et circuits dans les graphes orientés (présenté au Colloque franco-candiende combinatoire, Montréal 1979)

Jean-Claude Bermond , Anne Germa , Marie-Claude Heydemann , Dominique Sotteau

Annals of Discrete Mathematics, 1980, 8, pp.293-309

Article dans une revue hal-02379949v1
Deposit thumbnail

On the maximum number of edges in a hypergraph whose linegraph contains no cycle

Jean-Claude Bermond , Peter Frankl , Francois Sterboul

Discrete Mathematics, 1980, 30, pp.295-298. ⟨10.1016/0012-365X(80)90237-X⟩

Article dans une revue hal-02379954v1
Deposit thumbnail

On nonhamiltonian homgeneously traceable graphs

Jean-Claude Bermond , J.M.S. Simoes-Pereira , C.M Zamfirescu

Mathematica Japonica, 1979, 24, pp.423-426

Article dans une revue hal-02338390v1
Deposit thumbnail

Comparaison des puissances de graphes

Jean-Claude Bermond , Anton Marczyk

CRAS Compte Rendu Académie des Sciences, 1979, 288, pp.13-15

Article dans une revue hal-02340633v1
Deposit thumbnail

Resolvable decomposition of Kn∗

Jean-Claude Bermond , Anne Germa , Dominique Sotteau

Journal of Combinatorial Theory, Series A, 1979, 26 (2), pp.179-185. ⟨10.1016/0097-3165(79)90067-0⟩

Article dans une revue hal-02322256v1
Deposit thumbnail

Hamiltonian cycles in strong products of graphs

Jean-Claude Bermond , Anne Germa , Marie-Claude Heydemann

Canadian Mathematical Bulletin, 1979, 22, pp.305-309

Article dans une revue hal-02346304v1
Deposit thumbnail

Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs

Jean-Claude Bermond

Annals of Discrete Mathematics, 1978, 3, pp.21-28. ⟨10.1016/S0167-5060(08)70494-1⟩

Article dans une revue hal-02321683v1
Deposit thumbnail

Graphes représentatifs d'hypergraphes (Lecture at Colloque Mathématiques Discretes: Codes et Hypergraphes, Brussels, 1978)

Jean-Claude Bermond , Anne Germa , Marie-Claude Heydemann

Cahiers du Centre d'études de recherche opérationnelle, 1978, 20, pp.325-329

Article dans une revue hal-02342579v1
Deposit thumbnail

Balanced cycles and circuit designs: even cases

Jean-Claude Bermond , C. Huang , Dominique Sotteau

Ars Combinatoria, 1978, 5, pp.293-318

Article dans une revue hal-02321655v1
Deposit thumbnail

Hypergraph-designs

Jean-Claude Bermond , Anne Germa , Dominique Sotteau

Ars Combinatoria, 1977, 3, pp.47-66

Article dans une revue hal-02321713v1
Deposit thumbnail

On a Conjecture of Chvátal on m -Intersecting Hypergraphs

Jean-Claude Bermond , P. Frankl

Bulletin of the London Mathematical Society, 1977, 9 (3), pp.310-312. ⟨10.1112/blms/9.3.310⟩

Article dans une revue istex hal-02321636v1
Deposit thumbnail

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

Jean-Claude Bermond , Jochanan Schönheim

Discrete Mathematics, 1977, 19 (2), pp.113-120. ⟨10.1016/0012-365X(77)90027-9⟩

Article dans une revue hal-02358283v1
Deposit thumbnail

Line graphs of hypergraphs I

Jean-Claude Bermond , Marie-Claude Heydemann , Dominique Sotteau

Discrete Mathematics, 1977, 18 (3), pp.235-241. ⟨10.1016/0012-365X(77)90127-3⟩

Article dans une revue hal-02360671v1
Deposit thumbnail

Decomposition of the complete directed graph into k-circuits

Jean-Claude Bermond , Vance Faber

Journal of Combinatorial Theory, Series B, 1976, 21 (2), pp.146-155. ⟨10.1016/0095-8956(76)90055-1⟩

Article dans une revue hal-02366539v1
Deposit thumbnail

Une heuristique pour le calcul de l'indice de transitivité d'un tournoi

Jean-Claude Bermond , Yves Kodratoff

RAIRO Informatique Theorique, 1976, 10 (3), pp.83-92

Article dans une revue hal-02360666v1
Deposit thumbnail

Hypergraphes et configurations

Jean-Claude Bermond , Jean-Claude Meyer

Cahiers du Centre d'études de recherche opérationnelle, 1975, 17, pp.137-154

Article dans une revue hal-02366959v1
Deposit thumbnail

$1$-graphes réguliers minimaux de girth donné

Jean-Claude Bermond

Cahiers du Centre d'études de recherche opérationnelle, 1975, 17, pp.125-135

Article dans une revue hal-02366958v1
Deposit thumbnail

Some Ramsey numbers for directed graphs

Jean-Claude Bermond

Discrete Mathematics, 1974, 9 (4), pp.313-321. ⟨10.1016/0012-365X(74)90077-6⟩

Article dans une revue hal-02366537v1
Deposit thumbnail

Nombre Chromatique Total Du Graphe R-Parti Complet

Jean-Claude Bermond

Journal of the London Mathematical Society, 1974, s2-9 (2), pp.279-285. ⟨10.1112/jlms/s2-9.2.279⟩

Article dans une revue istex hal-02366538v1
Deposit thumbnail

An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits

Jean-Claude Bermond

Discrete Mathematics, 1974, 8 (4), pp.301-304. ⟨10.1016/0012-365X(74)90149-6⟩

Article dans une revue hal-02371586v1
Deposit thumbnail

Graphe représentaif des arêtes d'un multigraphe

Jean-Claude Bermond , Jean-Claude Meyer

Journal de Mathématiques Pures et Appliquées, 1973, 52 (9), pp.299-308

Article dans une revue hal-02373326v1
Deposit thumbnail

Pancyclisme du carré du graphe aux arêtes d'un graphe

Jean-Claude Bermond , Pierre Rosenstiehl

Cahier du C.E.R.O., 1973, 15 (3), pp.285-286

Article dans une revue hal-00259599v1
Deposit thumbnail

Arbres maximaux ayant au plus n sommets pendants

Jean-Claude Bermond

Comptes Rendus de l'Académie des Sciences, Paris, 1972, 274, pp.1878-1881

Article dans une revue hal-02373332v1
Deposit thumbnail

Ordres à distance minimum d'un tournoi et graphes partiels sans circuits maximaux

Jean-Claude Bermond

Mathématiques et Sciences Humaines, 1972, 37, pp.5-25

Article dans une revue hal-02376945v1
Deposit thumbnail

Graphes orientés fortement k-connexes et graphes "k arc hamiltoniens

Jean-Claude Bermond

Comptes Rendus de l''Académie des Sciences, Paris, 1970, 271, pp.141-144

Article dans une revue hal-02373335v1
Deposit thumbnail

New lower bounds on the cutwidth of graphs

Jean-Claude Bermond , Michel Cosnard , David Coudert , Frédéric Havet

Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2024

Rapport hal-04774458v1
Deposit thumbnail

Maximum number of requests on a path with a given grooming factor

Jean-Claude Bermond , Michel Cosnard , David Coudert , Stephane Perennes

Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2024, pp.20

Rapport hal-04736088v1
Deposit thumbnail

Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation

Fabricio Benevides , Jean-Claude Bermond , Hicham Lesfari , Nicolas Nisse

[Research Report] Université Côte d'Azur. 2021

Rapport (rapport de recherche) hal-03161419v4
Deposit thumbnail

Bin packing with colocations

Jean-Claude Bermond , Nathann Cohen , David Coudert , Dimitrios Letsios , Ioannis Milis et al.

[Research Report] Inria; I3S. 2016

Rapport (rapport de recherche) hal-01381333v2
Deposit thumbnail

On Spectrum Assignment in Elastic Optical Tree-Networks

Jean-Claude Bermond , Fatima Zahra Moataz

[Research Report] Inria Sophia Antipolis; Université Nice Sophia Antipolis. 2015

Rapport (rapport de recherche) hal-01116321v4
Deposit thumbnail

Data Gathering and Personalized Broadcasting in Radio Grids with Interferences

Jean-Claude Bermond , Bi Li , Nicolas Nisse , Hervé Rivano , Min-Li Yu

[Research Report] RR-8218, INRIA. 2013

Rapport (rapport de recherche) hal-00783198v2
Deposit thumbnail

Diverse Routing with the star property

Jean-Claude Bermond , David Coudert , Gianlorenzo d'Angelo , Fatima Zahra Moataz

[Research Report] RR-8071, INRIA. 2012

Rapport (rapport de recherche) hal-00733869v1
Deposit thumbnail

Well Balanced Designs for Data Placement

Jean-Claude Bermond , Alain Jean-Marie , Dorian Mazauric , Joseph Yu

[Research Report] RR-7725, Inria. 2011

Rapport (rapport de recherche) inria-00618656v3
Deposit thumbnail

Weighted Improper Colouring

Julio Araujo , Jean-Claude Bermond , Frédéric Giroire , Frédéric Havet , Dorian Mazauric et al.

[Research Report] RR-7590, INRIA. 2011, pp.57

Rapport (rapport de recherche) inria-00583036v4
Deposit thumbnail

Improper colouring of weighted grid and hexagonal graphs

Jean-Claude Bermond , Frédéric Havet , Florian Huc , Claudia Linhares Sales

[Research Report] RR-7250, INRIA. 2010, pp.19

Rapport (rapport de recherche) inria-00472819v1
Deposit thumbnail

GMPLS Routing Strategies based on the Design of Hypergraph Layouts

Jean-Claude Bermond , David Coudert , Joanna Moulierac , Stéphane Pérennes , Ignasi Sau et al.

[Research Report] RR-6842, INRIA. 2009

Rapport (rapport de recherche) inria-00360576v1
Deposit thumbnail

Directed acyclic graphs with the unique dipath property

Jean-Claude Bermond , Michel Cosnard , Stéphane Pérennes

[Research Report] Inria. 2009, pp.19

Rapport (rapport de recherche) inria-00387085v2

Round Weighting Problem and gathering in wireless networks with symmetrical interference

Cristiana Gomes , Patricio Reyes , Jean-Claude Bermond

[Research Report] 2009, pp.50

Rapport (rapport de recherche) inria-00408502v1
Deposit thumbnail

GMPLS Label Space Minimization through Hypergraph Layouts

Jean-Claude Bermond , David Coudert , Joanna Moulierac , Stéphane Pérennes , Fernando Solano Donado

[Research Report] RR-7071, INRIA. 2009

Rapport (rapport de recherche) inria-00426681v1
Deposit thumbnail

Drop cost and wavelength optimal two-period grooming with ratio 4

Jean-Claude Bermond , Charles J. Colbourn , Lucia Gionfriddo , Gaetano Quattrocchi , Ignasi Sau

[Research Report] RR-7101, INRIA. 2009, pp.24

Rapport (rapport de recherche) inria-00432801v1
Deposit thumbnail

Fast Data Gathering in Radio Grid Networks

Jean-Claude Bermond , Nicolas Nisse , Patricio Reyes , Hervé Rivano

[Research Report] RR-6851, INRIA. 2009

Rapport (rapport de recherche) inria-00363908v4
Deposit thumbnail

Traffic Grooming in Bidirectional WDM Ring Networks

Jean-Claude Bermond , Xavier Muñoz

[Research Report] RR-7080, INRIA. 2009, pp.33

Rapport (rapport de recherche) inria-00429155v1
Deposit thumbnail

MPLS label stacking on the line network

Jean-Claude Bermond , David Coudert , Joanna Moulierac , Stéphane Pérennes , Hervé Rivano et al.

[Research Report] RR-6803, INRIA. 2009

Rapport (rapport de recherche) inria-00354267v1
Deposit thumbnail

Online Distributed Traffic Grooming on Path Networks

Jean-Claude Bermond , David Coudert , Joseph Peters

[Research Report] RR-6833, INRIA. 2009

Rapport (rapport de recherche) inria-00359810v2
Deposit thumbnail

Distributed Call Scheduling in Wireless Networks

Jean-Claude Bermond , Dorian Mazauric , Vishal Misra , Philippe Nain

[Research Report] RR-6763, INRIA. 2008

Rapport (rapport de recherche) inria-00345669v3
Deposit thumbnail

Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks

Eitan Altman , Philippe Nain , Jean-Claude Bermond

[Research Report] RR-6645, INRIA. 2008

Rapport (rapport de recherche) inria-00321641v3
Deposit thumbnail

Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring

Jean-Claude Bermond , David Coudert , Benjamin Lévêque

[Research Report] 2007, pp.11

Rapport (rapport de recherche) inria-00175795v1

Optimal Gathering Protocols on Paths under Interference Constraints

Jean-Claude Bermond , Ricardo Correa , Min-Li Yu

[Research Report] 2007, pp.23

Rapport (rapport de recherche) inria-00168162v1
Deposit thumbnail

Optimal Solution of the Maximum All Request Path Grooming Problem

Jean-Claude Bermond , Michel Cosnard , David Coudert , Stéphane Pérennes

[Research Report] RR-5627, INRIA. 2006, pp.12

Rapport (rapport de recherche) inria-00070381v1
Deposit thumbnail

Hardness and approximation of gathering in static radio networks

Jean-Claude Bermond , Jérôme Galtier , Ralf Klasing , Nelson Morales , Stéphane Pérennes

[Research Report] RR-5936, INRIA. 2006, pp.21

Rapport (rapport de recherche) inria-00081032v2
Deposit thumbnail

Traffic Grooming on the Path

Jean-Claude Bermond , Laurent Braud , David Coudert

[Research Report] RR-5645, INRIA. 2006, pp.29

Rapport (rapport de recherche) inria-00070363v1
Deposit thumbnail

Fault tolerant on-board networks with priorities

Jean-Claude Bermond , Frédéric Havet , Csaba Tóth

[Research Report] RR-5363, INRIA. 2004, pp.52

Rapport (rapport de recherche) inria-00070640v1
Deposit thumbnail

Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3

Jean-Claude Bermond , Stephan Ceroi

RR-4626, INRIA. 2002

Rapport inria-00071959v1
Deposit thumbnail

On DRC-Covering of K_n by Cycles

Jean-Claude Bermond , David Coudert , Min-Li Yu

[Research Report] RR-4299, INRIA. 2001

Rapport (rapport de recherche) inria-00072288v1
Deposit thumbnail

Directed Virtual Path Layouts in ATM Networks

Jean-Claude Bermond , Nausica Marlin , David Peleg , Stéphane Pérennes

RR-3665, INRIA. 1999

Rapport inria-00073007v1
Deposit thumbnail

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

Bruno Beauquier , Jean-Claude Bermond , Luisa Gargano , Pavol Hell , Stéphane Pérennes et al.

RR-3165, INRIA. 1997

Rapport inria-00073523v1
Deposit thumbnail

Hamilton Circuits in the Directed Butterfly Network

Jean-Claude Bermond , Eric Darrot , Olivier Delmas , Stéphane Pérennes

RR-2925, INRIA. 1996

Rapport inria-00073773v1
Deposit thumbnail

Hamilton Cycle Decomposition of the Butterfly Network

Jean-Claude Bermond , Eric Darrot , Olivier Delmas , Stéphane Pérennes

RR-2920, INRIA. 1996

Rapport inria-00073777v1
Deposit thumbnail

Mean eccentricities of de Bruijn networks

Jean-Claude Bermond , Zhen Liu , Michel Syska

[Research Report] RR-2114, INRIA. 1993

Rapport (rapport de recherche) inria-00074558v1
Deposit thumbnail

Couverture des arêtes d'un graphe par des graphes bipartis complets

Jean-Claude Bermond

[Rapport de recherche] 10, LRI - CNRS, University Paris-Sud. 1978, pp.1-3

Rapport (rapport de recherche) hal-02346309v1
Deposit thumbnail

Groupage sur le chemin pour borner la largeur de coupe

Jean-Claude Bermond , Michel Cosnard , David Coudert , Frédéric Havet

AlgoTel 2023 - 25èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2023, Cargese, France. pp.4

Communication dans un congrès hal-04076999v2
Deposit thumbnail

Grabbing Olives on Linear Pizzas and Pissaladières

Jean-Claude Bermond , Michel Cosnard , Frédéric Havet

The Eleventh International Conference on Fun with Algorithms (FUN 2022), May 2022, Island of Favignana, Italy. ⟨10.4230/LIPIcs.FUN.2022.12⟩

Communication dans un congrès hal-03675756v1
Deposit thumbnail

Gossiping with interference in radio chain networks (upper bound algorithms)

Jean-Claude Bermond , Takako Kodate , Joseph Yu

JCDCG-3 - 22th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, Sep 2019, Tokyo, Japan

Communication dans un congrès hal-02316854v1
Deposit thumbnail

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

FUN 2018 - 9th International Conference on Fun with Algorithms, 2018, La Maddalena, Italy

Communication dans un congrès hal-01780627v1
Deposit thumbnail

Gossiping with interference in radio chain networks

Jean-Claude Bermond , Takako Kodate , Joseph Yu

21th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, Sep 2018, Manila, Philippines

Communication dans un congrès hal-01960744v1
Deposit thumbnail

Gossiping with interference in radio ring networks

Jean-Claude Bermond , Takako Kodate , Joseph Yu

20th Anniversary of Japan Conference on Discrete and Computational Geometry, Graphs, and Games, Aug 2017, TOKYO, Japan

Communication dans un congrès hal-01963492v1
Deposit thumbnail

Bin Packing with Colocations

Jean-Claude Bermond , Nathann Cohen , David Coudert , Dimitrios Letsios , Ioannis Milis et al.

14th International Workshop on Approximation and Online Algorithms (WAOA), Aug 2016, Aarhus, Denmark. pp.40-51, ⟨10.1007/978-3-319-51741-4_4⟩

Communication dans un congrès hal-01435614v1
Deposit thumbnail

SRLG-Diverse Routing with the Star Property

Jean-Claude Bermond , David Coudert , Gianlorenzo d'Angelo , Fatima Zahra Moataz

Design of Reliable Communication Networks, DRCN, Mar 2013, Budapest, Hungary

Communication dans un congrès hal-00794638v1
Deposit thumbnail

Diverse Routing with Star SRLGs

Jean-Claude Bermond , David Coudert , Gianlorenzo d'Angelo , Fatima Zahra Moataz

15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.1-4

Communication dans un congrès hal-00817992v1
Deposit thumbnail

Diverse Routing in Networks with Star SRLGs

Jean-Claude Bermond , David Coudert , Gianlorenzo d'Angelo , Fatima Zahra Moataz

ACM CoNEXT Student Workshop, Dec 2012, Nice, France. pp.1-2

Communication dans un congrès hal-00747757v1
Deposit thumbnail

Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas

Jean-Claude Bermond , Luisa Gargano , Stéphane Pérennes , Adele Rescigno , Ugo Vaccaro

SIROCCO2011, Lecture Notes in Computer Science - LNCS, 6796, Springer Verlag, Jun 2011, Gdansk, Poland. pp.306-317

Communication dans un congrès inria-00589687v1
Deposit thumbnail

Weighted Improper Colouring

Julio Araujo , Jean-Claude Bermond , Frédéric Giroire , Frédéric Havet , Dorian Mazauric et al.

22th International Workshop, IWOCA 2011, Jul 2011, Victoria, Canada

Communication dans un congrès inria-00635882v1
Deposit thumbnail

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, Columbia University, Jun 2010, New York, United States

Communication dans un congrès inria-00505519v1
Deposit thumbnail

On the average path length of deterministic and stochastics recursive networks

Philippe Giabbanelli , Dorian Mazauric , Jean-Claude Bermond

2nd workshop on Complex networks (CompletNet), Communications in Computer and Information sciences, CCIS, Vol 116, Springer Verlag, 2010, Rio de Janeiro, Brazil. pp.1-12

Communication dans un congrès inria-00532890v1
Deposit thumbnail

Designing Hypergraph Layouts to GMPLS Routing Strategies

Jean-Claude Bermond , David Coudert , Joanna Moulierac , Stéphane Pérennes , Fernando Solano Donado

SIROCCO, May 2009, Piran, Slovenia

Communication dans un congrès inria-00428685v1
Deposit thumbnail

Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks.

Eitan Altman , Philippe Nain , Jean-Claude Bermond

INFOCOM 2009, IEEE, Apr 2009, Rio de janeiro, Brazil. pp.1431-1439

Communication dans un congrès inria-00505520v1
Deposit thumbnail

Algorithmes distribués d'ordonnancement dans les réseaux sans-fil.

Jean-Claude Bermond , Dorian Mazauric , Philippe Nain

JDIR 2009, Feb 2009, Belfort, France

Communication dans un congrès inria-00505521v1
Deposit thumbnail

MPLS label stacking on the line network

Jean-Claude Bermond , David Coudert , Joanna Moulierac , Stéphane Pérennes , Hervé Rivano et al.

IFIP Networking, May 2009, Aachen, Germany. pp.809-820, ⟨10.1007/978-3-642-01399-7⟩

Communication dans un congrès hal-00371115v2
Deposit thumbnail

Minimum delay Data Gathering in Radio Networks

Jean-Claude Bermond , Nicolas Nisse , Patricio Reyes , Hervé Rivano

ADHOC-NOW 2009 - 8th international conference on Ad Hoc Networks and Wireless, Sep 2009, Murcia, Spain. pp.69-82, ⟨10.1007/978-3-642-04383-3_6⟩

Communication dans un congrès inria-00505522v1
Deposit thumbnail

Fast Data Gathering in Radio Grid Networks

Jean-Claude Bermond , Nicolas Nisse , Patricio Reyes , Hervé Rivano

AlgoTel, 2009, Carry-Le-Rouet, France

Communication dans un congrès inria-00376040v1
Deposit thumbnail

Gathering with minimum delay in tree sensor networks

Jean-Claude Bermond , Luisa Gargano , Adele Rescigno

SIROCCO 2008,, Jun 2008, Villars-sur-Ollon, Switzerland. pp.262-276, ⟨10.1007/978-3-540-69355-0_22⟩

Communication dans un congrès istex inria-00505523v1
Deposit thumbnail

Optimal gathering algorithms in multi-hop radio tree networks with interferences.

Jean-Claude Bermond , Min-Li Yu

AD-HocNow 08, Sep 2008, Nice, France. pp.204-217

Communication dans un congrès hal-00512281v1
Deposit thumbnail

Minimum number of wavelengths equals load in a DAG without internal cycle

Jean-Claude Bermond , Michel Cosnard

IPDPS07, Mar 2007, Long beach, CA, United States. pp.1-10

Communication dans un congrès hal-00512284v1
Deposit thumbnail

Design of Minimal Fault Tolerant On-Board Networks : Practical constructions

Jean-Claude Bermond , Frédéric Giroire , Stéphane Pérennes

SIROCCO07, Jun 2007, Castiglioncello, Italy. pp.261-273

Communication dans un congrès hal-00512282v1
Deposit thumbnail

Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés

Jean-Claude Bermond , Frédéric Havet , Florian Huc , Claudia Linhares-Sales

9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.53-56

Communication dans un congrès inria-00176955v1
Deposit thumbnail

Hardness and approximation of Gathering in static radio networks

Jean-Claude Bermond , Jérôme Galtier , Ralf Klasing , Nelson Morales , Stéphane Pérennes

FAWN06 - First Annual IEEE International Workshop on "Foundation and Algorithms for Wireless Networking, Mar 2006, Pise, Italy. pp.75-79

Communication dans un congrès hal-00344619v1
Deposit thumbnail

Design of Minimal Fault Tolerant Networks: Asymptotic Bounds

Omid Amini , Jean-Claude Bermond , Frédéric Giroire , Florian Huc , Stéphane Pérennes

Algotel06, May 2006, Tregastel, France. pp.169-174

Communication dans un congrès hal-00512287v1
Deposit thumbnail

Traffic Grooming in Bidirectional WDM Ring Networks

Jean-Claude Bermond , David Coudert , Xavier Munoz , Ignasi Sau

International Conference on Transparent Optical Networks (ICTON), Jun 2006, Nottingham, United Kingdom. pp.19 - 22, ⟨10.1109/ICTON.2006.248390⟩

Communication dans un congrès inria-00429168v1
Deposit thumbnail

Gathering in specific radio networks

Jean-Claude Bermond , Jérôme Galtier , Ralf Klasing , Nelson Morales , Stéphane Pérennes

AlgoTel'2006 - 8èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2006, Tregastel, France. pp.85-88

Communication dans un congrès hal-00344620v1
Deposit thumbnail

Optimal Solution of the Maximum All Request Path Grooming Problem

Jean-Claude Bermond , Michel Cosnard , David Coudert , Stéphane Pérennes

Advanced International Conference on Telecommunications (AICT), Feb 2006, Le Gosier, Guadeloupe, France. ⟨10.1109/AICT-ICIW.2006.144⟩

Communication dans un congrès inria-00429167v1
Deposit thumbnail

Gathering algorithms on paths under interference constraints

Jean-Claude Bermond , Ricardo Correa , Min-Li Yu

CTAC06, May 2006, Roma, Italy. pp.115-126

Communication dans un congrès hal-00512286v1
Deposit thumbnail

Efficient Gathering in Radio Grids with Interference

Jean-Claude Bermond , Joseph G. Peters

Algotel, May 2005, Hyères, France. pp.103-106

Communication dans un congrès hal-03768377v1
Deposit thumbnail

Traffic Grooming on the Path

Jean-Claude Bermond , Laurent Braud , David Coudert

12th International Colloquium on Structural Information and Communication Complexity (SIROCCO), May 2005, Mont Saint-Michel, France. pp.34-48, ⟨10.1007/11429647_5⟩

Communication dans un congrès inria-00429172v1
Deposit thumbnail

Groupage par tubes

Jean-Claude Bermond , Olivier de Rivoyre , Stéphane Pérennes , Michel Syska

Conférence Algotel, May 2003, Banyuls, France. pp.27-32

Communication dans un congrès hal-03768373v1
Deposit thumbnail

Réseaux de télécommunication minimaux embarqués tolérants aux pannes

Jean-Claude Bermond , Olivier Delmas , Frédéric Havet , Mickael Montassier , Stéphane Pérennes

5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (ALGOTEL 2003), May 2003, Banyuls, France. pp.27--32

Communication dans un congrès hal-00307610v1
Deposit thumbnail

Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory

Jean-Claude Bermond , David Coudert

IEEE International Conference on Communications (ICC '03)., May 2003, Anchorage, United States. pp.1402 - 1406, ⟨10.1109/ICC.2003.1204621⟩

Communication dans un congrès inria-00429174v1
Deposit thumbnail

Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case

Jean-Claude Bermond , David Coudert , Xavier Munoz

7th IFIP Working Conference on Optical Network Design & Modelling (ONDM), 2003, Budapest, Hungary. pp.1135-1153

Communication dans un congrès inria-00429175v1
Deposit thumbnail

Hierarchical Ring Network Design, Proceedings in Informatics13, CarletonScientific

Jean-Claude Bermond , Sébastien Choplin , Stéphane Pérennes

9th International Colloquium on Structural Information and Communication Complexity, SIROCCO9, Jun 2002, Andros, Greece

Communication dans un congrès hal-03844396v1
Deposit thumbnail

Cycle Covering

Jean-Claude Bermond , Lilian Chacon , David Coudert , Francois Tillerot

8th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Jun 2001, Vall de Nuria, Spain. pp.21-34

Communication dans un congrès inria-00429183v1
Deposit thumbnail

A note on cycle covering

Jean-Claude Bermond , David Coudert , Lilian Chacon , Francois Tillerot

ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2001, Hersonissos, Greece. pp.310-311, ⟨10.1145/378580.378716⟩

Communication dans un congrès inria-00429182v1
Deposit thumbnail

Design of fault tolerant on board networks with priorities

Jean-Claude Bermond , Frédéric Havet , David Tóth

3e rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001), May 2001, Saint-Jean-de-Luz, France. pp.95-98

Communication dans un congrès hal-03844221v1
Deposit thumbnail

Broadcasting in Hypercubes under Circuit Switched Model

Jean-Claude Bermond , Alexis Bonnecaze , Takako Kodate , Stéphane Pérennes , Patrick Solé

IPDPS 2000 - Proceedings International Parallel and Distributed Processing Symposium, May 2000, Cancun, Mexico. pp.21-26

Communication dans un congrès hal-03768121v1
Deposit thumbnail

Conception d'un réseau WDM protégé par sous-réseaux

Jean-Claude Bermond , Lilian Chacon , David Coudert , Francois Tillerot

2ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'00), Karell Bertet and Isabelle Chrisment and Eric Fleury, May 2000, La Rochelle, France. pp.83-88

Communication dans un congrès inria-00429292v1
Deposit thumbnail

Virtual path layouts with low congestion or low diameter in ATM networks

Jean-Claude Bermond , Nausica Marlin , David Peleg , Stéphane Pérennes

Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99), May 1999, Roscoff, France. pp.77-82

Communication dans un congrès hal-03844137v1
Deposit thumbnail

Virtual path layouts in simple ATM networks

Jean-Claude Bermond , Nausica Marlin , David Peleg , Stéphane Pérennes

Proc. Conference IFIP ATM '98, Jul 1998, Ilkley, United Kingdom

Communication dans un congrès hal-03844032v1
Deposit thumbnail

Directed virtual path layouts in ATM networks. Lecture Notes in Computer Science, 1499

Jean-Claude Bermond , Nausica Marlin , David Peleg , Stéphane Pérennes

Proc. Conference DISC98, Sep 1998, Andros, Greece. pp.75-88

Communication dans un congrès hal-03843995v1
Deposit thumbnail

Deadlock prevention by acyclic orientations

Jean-Claude Bermond , Myriam Di Ianni , Michele Flammini , Stéphane Pérennes

Proceedings 23th Int Workshop on Graph Theoretic Concepts in Computer Science WG97, Lecture Notes in Computer Science, vol 1335, Jun 1997, Berlin, Germany. pp.52-64

Communication dans un congrès hal-03832690v1
Deposit thumbnail

Graph Problems arising from Wavelength-routing in All-optical Networks

Bruno Beauquier , Jean-Claude Bermond , Luisa Gargano , Pavol Hell , Stéphane Pérennes et al.

WOCS 1997 - 2nd Workshop on Optics and Computer Science - 11th International Parallel Processing Symposium, Apr 1997, Geneve, Switzerland

Communication dans un congrès hal-03764663v1
Deposit thumbnail

Tight bounds on the size of 2-monopolies

Jean-Claude Bermond , Johny Bond , David Peleg , Stéphane Perennes

Conference SIROCCO96, International Informatics Series 6, Carleton University, Jun 1996, Siena, Italy. pp.170-179

Communication dans un congrès hal-03832700v1
Deposit thumbnail

Gossiping in Cayley Graphs by Packets

Jean-Claude Bermond , Takako Kodate , Stéphane Pérennes

Proceedings Conference Franco-Japonaise, Lecture Notes in Computer Science ,1120, Springer Verlag 1996,, Jul 1995, Brest, France. pp.301-315

Communication dans un congrès hal-03762695v1
Deposit thumbnail

The SLOOP project: Simulations, Parallel Object-Oriented Languages, Interconnection Networks

Françoise Baude , Belloncle Fabrice , Jean-Claude Bermond , Denis Caromel , Olivier Dalle et al.

2nd Euroean School of Computer Science, ESPPE,, Apr 1996, Alpe d'Huez, France. pp.85-88

Communication dans un congrès hal-03762698v1
Deposit thumbnail

Induced broadcasting algorithms in iterated line digraphs

Jean-Claude Bermond , Xavier Muñoz , Alberto Marchetti-Spaccamela

Proc. Conference EUROPAR96, Aug 1996, Lyon, France. pp.313-324

Communication dans un congrès hal-03838874v1
Deposit thumbnail

Efficient Broadcasting Protocols on the de Bruijn and similar Networks

Jean-Claude Bermond , Stéphane Pérennes

Proceedings Conference Sirocco1995, International Informatics Series 2, Carleton University Press, 199-209, Jun 1995, Olympie, Greece

Communication dans un congrès hal-03762629v1
Deposit thumbnail

Dense bus networks of diameter 2

Jean-Claude Bermond , Johny Bond , Selma Djelloul

Interconnection Networks and Mapping and Scheduling Parallel Computations Dimacs Ser Vol 21, 1995, New york, United States. pp.9-18, ⟨10.1090/dimacs/021⟩

Communication dans un congrès hal-03220060v1
Deposit thumbnail

The Power of Small Coalitions in Graphs

Jean-Claude Bermond , David Peleg

Proceedings Conference Sirocco1995, International Informatics Series 2, Carleton University Press, 173-184, Jun 1995, Olympie, Greece

Communication dans un congrès hal-03762634v1
Deposit thumbnail

Fast gossiping by short messages, Lecture Notes in Computer Science 144

Jean-Claude Bermond , Luisa Gargano , Adele Rescigno , Ugo Vaccaro

22nd ICALP Conference, Jul 1995, Szeged, Hungary. pp.135-146

Communication dans un congrès hal-03220089v1
Deposit thumbnail

Broadcasting and NP-completeness

Jean-Claude Bermond , Pierre Fraigniaud

Proceedings Graph Theory Day 22, Nov 1991, New-York, United States. pp.8-14

Communication dans un congrès hal-03210114v1
Deposit thumbnail

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

Jean-Claude Bermond , Claudine Peyrat

First European Workshop on Hypercube and Distributed Computers, Oct 1989, Rennes, France. pp 279-283

Communication dans un congrès hal-03013384v1
Deposit thumbnail

General and efficient decentralized consensus protocols II

Jean-Claude Bermond , Jean-Claude König

International Workshop on Parallel & Distributed Algorithms, Oct 1988, Bonas, France. pp.189-210

Communication dans un congrès hal-03189950v1
Deposit thumbnail

General and efficient decentralized consensus protocols

Jean-Claude Bermond , Jean-Claude König , Michel Raynal

Proceedings International workshop, Jul 1987, Amsterdam, Netherlands. pp.41-56

Communication dans un congrès hal-02973251v1
Deposit thumbnail

Decomposition into cycles I: Hamilton decompositions

Brian Alspach , Jean-Claude Bermond , Dominique Sotteau

Workshop on Cycles and Rays, 1987, Montreal, Canada. pp.9-18

Communication dans un congrès hal-03013446v1
Deposit thumbnail

Interconnection networks with each node on two buses

Jean-Claude Bermond , Johny Bond , Claudine Peyrat

International workshop on Parallel algorithms and architectures, North Holland, 1986, Luminy, France

Communication dans un congrès hal-02500473v1
Deposit thumbnail

A graph theoretical characterization of minimal deadlocks in Petri nets

Jean-Claude Bermond , Gerard Memmi

Graph theory with applications to algorithms and computer science, Wiley, 1985, Kalamazoo,MI, United States. pp.73-87

Communication dans un congrès hal-02447228v1
Deposit thumbnail

Large hypergraphs of diameter one

Jean-Claude Bermond , Johny Bond , Jean-François Saclé

Graph theory and Combinatorics, Academic Press, 1984, Cambridge, United Kingdom. pp.19-28

Communication dans un congrès hal-02447161v1
Deposit thumbnail

The Diameter of Graphs: a survey

Jean-Claude Bermond , Bela Bollobas

Congressus Numerantium, vol32, 1981, Boca raton, United States. pp.3-27

Communication dans un congrès hal-02426939v1
Deposit thumbnail

Regards sur les numérotations de graphes

Jean-Claude Bermond

Proceedings Coll. Cerisy, 1980, Cerisy, France. pp.171-176

Communication dans un congrès hal-02426800v1
Deposit thumbnail

Graceful graphs, radio antennae and French windmills

Jean-Claude Bermond

Proceedings One day Combinatorics Conference, Research Notes in Mathematics, vol34, Pitman, 1979, Open university,Milton Keynes,1978, United Kingdom. pp.18-37

Communication dans un congrès hal-02340680v1
Deposit thumbnail

Cycle and circuit designs: odd case

Jean-Claude Bermond , Dominique Sotteau

Beitrage zur Graphentheorie and deren Anwendungen, Proc. Coll Oberhof, 1977, 1978, Illmenau, Germany. pp.11-32

Communication dans un congrès hal-02361437v1
Deposit thumbnail

Le problème des ouvroirs (Hypergraph gossip problem)

Jean-Claude Bermond

Colloque international CNRS 260 : Problèmes combinatoires et théorie des graphes, 1978, Orsay, Juillet 1976, France. pp.31-34

Communication dans un congrès hal-02322709v1
Deposit thumbnail

On a combinatorial problem of antennas in radio astronomy

Jean-Claude Bermond , Anton Kotzig , Jean Turgeon

Combinatorics, Fifth Hungarian Colloquium 1976, Colloquia Mathematica Societatis Janos Bolyai 18,, 1978, Kesthely, Hungary. pp.135-149

Communication dans un congrès hal-02322841v1
Deposit thumbnail

Systèmes de triplets et différences associées

Jean-Claude Bermond , Andries Evert Brouwer , Anne Germa

Probèmes combinatoires et théorie des graphes, Colloque international CNRS 260, 1978, Orsay, Juillet 1976, France. pp.35-38

Communication dans un congrès hal-02322623v1
Deposit thumbnail

Indice chromatique de produits de graphes

Jean-Claude Bermond , Anne Germa , Marie-Claude Heydemann

Colloque Algèbre appliquée et Combinatoire, 1978, Grenoble, France. pp.106-108

Communication dans un congrès hal-02340658v1
Deposit thumbnail

On maximal systems of quadruples

Jean-Claude Bermond , Jan Novak

Graphs, Hypergraphs and Block Systems, 1976, 1978, Zielona Gora, Poland. pp.13-19

Communication dans un congrès hal-02361454v1
Deposit thumbnail

Hypergraphes hamiltoniens

Jean-Claude Bermond , Anne Germa , Marie-Claude Heydemann , Dominique Sotteau

Problèmes combinatoires et théorie des graphes, Colloque International CNRS, 260, 1978, Orsay, Juillet 1976, France. pp.39-43

Communication dans un congrès hal-02321860v1
Deposit thumbnail

On hamiltonian walks

Jean-Claude Bermond

5th British Combinatorial Conference, 1975, Congressus Numerantium 15, Utilitas Math Pub., 1976, Aberdeen, United Kingdom. pp.41-51

Communication dans un congrès hal-02361388v1

Unsolved problems

Jean-Claude Bermond

5th British Combinatorial Conference, 1975, Congressus Numerantium 15, Utilitas Math Pub., 1976, Aberdeen, United Kingdom. pp.695-696

Communication dans un congrès hal-02447750v1
Deposit thumbnail

Graph decompositions and G-designs

Jean-Claude Bermond , Dominique Sotteau

5th British Combinatorial Conference, 1975, Congressus Numerantium 15, Utilitas Math Pub., 1976, Aberdeen, United Kingdom. pp.53-72

Communication dans un congrès hal-02361407v1
Deposit thumbnail

The circuit - hypergraph of a tournament

Jean-Claude Bermond

Infinite and finite sets, Colloq Kezsthely 1973, deidcated to P.Erdös on his 60th birthday Colloq. Math Soc Janos Bolyai, 1975, Keszthely, Hungary. pp.165-180

Communication dans un congrès hal-02366962v1
Deposit thumbnail

Decomposition of Kn* into k-circuits and balanced G-designs

Jean-Claude Bermond

Recent advances in graph theory, Proc Second Czecoslovak Symposium Prague 1974, Academia Prague, 1975, Prague, Czech Republic. pp.57-68

Communication dans un congrès hal-02366963v1

Problems

Jean-Claude Bermond

Recent advances in graph theory, Proc Second Czecoslovak Symposium Prague 1974, Academia Prague, 1975, Prague, Czech Republic. pp.541-544

Communication dans un congrès hal-02450423v1
Deposit thumbnail

Graphe représentatif de l'hypergraphe h-parti complet

Jean-Claude Bermond

Hypergraph Seminar 1972, Springer Verlag Lecture Notes 411, 1974, Columbus, Ohio, États-Unis. pp.34-53

Communication dans un congrès hal-02371597v1
Deposit thumbnail

Line Directed Hypergraphs

Jean-Claude Bermond , Fahir Ergincan , Michel Syska

Cryptoquater2011 ,Festchrift Jean-jacques,, Springer verlag, pp.1-11, 2011, Lecture Notes in Computer Science, 6805

Chapitre d'ouvrage hal-00643785v1
Deposit thumbnail

Grooming

Jean-Claude Bermond , David Coudert

Charles J. Colbourn and Jeffrey H. Dinitz. Handbook of Combinatorial Designs (2nd edition), 42, Chapman & Hall- CRC Press, pp.494-496, 2006, Discrete mathematics and Applications, 1584885068

Chapitre d'ouvrage inria-00429215v1
Deposit thumbnail

Communication dans les réseaux de processeurs

Jean-Claude Bermond , Pierre Fraigniaud , Anne Germa , Marie-Claude Heydemann , Emmanuel Lazard et al.

Communications dans les réseaux de processeurs, Masson, 1994

Chapitre d'ouvrage hal-03220071v1
Deposit thumbnail

Routage "wormhole" et canaux virtuels

Jean-Claude Bermond , Michel Syska

Algorithmique parrakèle, Masson, pp.149-158, 1992

Chapitre d'ouvrage hal-03210127v1
Deposit thumbnail

Graphs and Interconnection networks: diameter and vulnerability,

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

Surveys in Combinatorics, London Math Society Lecture Notes Series 82, 1, Cambridge University Press, pp.1-30, 1983, ⟨10.1017/CBO9781107325548⟩

Chapitre d'ouvrage hal-02447135v1
Deposit thumbnail

Hamiltonian Graphs

Jean-Claude Bermond

Selected topics in graph theory, chapter 6, Academic Press, pp.127-167, 1979

Chapitre d'ouvrage hal-02352666v1

Editorial

Jean-Claude Bermond , R. Balakrishnan , M.S. Jacobson , Paul Paulraja

Discrete Mathematics, 206, pp.1, 1999, ⟨10.1016/S0012-365X(98)00386-0⟩

N°spécial de revue/special issue hal-03844185v1
Deposit thumbnail

Cycles dans les graphes et G-configurations

Jean-Claude Bermond

Mathématique discrète [cs.DM]. University Paris 11, 1975

HDR tel-02376958v1