Recherche - Archive ouverte HAL Accéder directement au contenu

Filtrer vos résultats

250 résultats
Page :
triés par
Image document

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
Image document

On DRC-Covering of K_n by Cycles

 Jean-Claude Bermond , David Coudert , Min-Li Yu
[Research Report] RR-4299, INRIA. 2001
Rapport inria-00072288v1

Optimal Gathering Protocols on Paths under Interference Constraints

 Jean-Claude Bermond , Ricardo Correa , Min-Li Yu
[Research Report] 2007, pp.23
Rapport inria-00168162v1
Image document

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
Image document

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 inria-00321641v3
Image document

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
Image document

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
Image document

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
Image document

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 hal-00783198v2
Image document

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 hal-03161419v4
Image document

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
Image document

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
Image document

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, 2023, pp.18. ⟨10.1016/j.ejc.2023.103801⟩
Article dans une revue hal-04368240v1
Image document

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
Image document

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
Image document

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
Image document

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
Image document

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
Image document

De Bruijn and Kautz Bus networks

 Jean-Claude Bermond , Robin Dawes , Fahir Ö. Ergincan
Networks, 1997, 30 (3), pp.205-218. ⟨10.1002/(SICI)1097-0037(199710)30:3<205::AID-NET5>3.0.CO;2-P⟩
Article dans une revue istex hal-03210219v1
Image document

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
Image document

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
Image document

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

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
Image document

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
Image document

Distributed Call Scheduling in Wireless Networks

 Jean-Claude Bermond , Dorian Mazauric , Vishal Misra , Philippe Nain
[Research Report] RR-6763, INRIA. 2008
Rapport inria-00345669v3
Image document

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
Image document

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 inria-00070381v1
Image document

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
Image document

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
Image document

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
Page :