Jean-Claude Bermond
254
Documents
Publications
Publications
|
|
Maximizing the number of requests in oriented trees with a grooming factor2025
Pré-publication, Document de travail
hal-05008883
v1
|
|
|
Grabbing olives on linear pizzas and pissaladières2022
Pré-publication, Document de travail
hal-03623938
v1
|
|
|
Gossiping with interference in radio chain networks2019
Pré-publication, Document de travail
hal-02424017
v1
|
|
|
Optimal Gathering in Radio Grids with Interference2011
Pré-publication, Document de travail
inria-00610038
v1
|
|
|
Gathering with Minimum Delay in Sensor Networks2008
Pré-publication, Document de travail
inria-00256896
v1
|
|
|
On locally hamiltonian graphs1980
Pré-publication, Document de travail
hal-02426796
v1
|
|
|
Groupage sur le chemin pour borner la largeur de coupeAlgoTel 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-04076999
v2
|
|
|
Grabbing Olives on Linear Pizzas and PissaladièresThe 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-03675756
v1
|
|
|
Gossiping with interference in radio chain networks (upper bound algorithms)JCDCG-3 - 22th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, Sep 2019, Tokyo, Japan
Communication dans un congrès
hal-02316854
v1
|
|
|
Gossiping with interference in radio chain networks21th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, Sep 2018, Manila, Philippines
Communication dans un congrès
hal-01960744
v1
|
|
|
How long does it take for all users in a social network to choose their communities?FUN 2018 - 9th International Conference on Fun with Algorithms, 2018, La Maddalena, Italy
Communication dans un congrès
hal-01780627
v1
|
|
|
Gossiping with interference in radio ring networks20th Anniversary of Japan Conference on Discrete and Computational Geometry, Graphs, and Games, Aug 2017, TOKYO, Japan
Communication dans un congrès
hal-01963492
v1
|
|
|
Bin Packing with Colocations14th 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-01435614
v1
|
|
|
SRLG-Diverse Routing with the Star PropertyDesign of Reliable Communication Networks, DRCN, Mar 2013, Budapest, Hungary
Communication dans un congrès
hal-00794638
v1
|
|
|
Diverse Routing with Star SRLGs15è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-00817992
v1
|
|
|
Diverse Routing in Networks with Star SRLGsACM CoNEXT Student Workshop, Dec 2012, Nice, France. pp.1-2
Communication dans un congrès
hal-00747757
v1
|
|
|
Optimal Time Data Gathering in Wireless Networks with Omni-Directional AntennasSIROCCO2011, Lecture Notes in Computer Science - LNCS, 6796, Springer Verlag, Jun 2011, Gdansk, Poland. pp.306-317
Communication dans un congrès
inria-00589687
v1
|
|
|
Weighted Improper Colouring22th International Workshop, IWOCA 2011, Jul 2011, Victoria, Canada
Communication dans un congrès
inria-00635882
v1
|
|
|
On the average path length of deterministic and stochastics recursive networks2nd 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-00532890
v1
|
|
|
A Distributed Scheduling Algorithm for Wireless Networks with Constant Overhead and Arbitrary Binary Interference.Sigmetrics 2010, Columbia University, Jun 2010, New York, United States
Communication dans un congrès
inria-00505519
v1
|
|
|
MPLS label stacking on the line networkIFIP Networking, May 2009, Aachen, Germany. pp.809-820, ⟨10.1007/978-3-642-01399-7⟩
Communication dans un congrès
hal-00371115
v2
|
|
|
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks.INFOCOM 2009, IEEE, Apr 2009, Rio de janeiro, Brazil. pp.1431-1439
Communication dans un congrès
inria-00505520
v1
|
|
|
Algorithmes distribués d'ordonnancement dans les réseaux sans-fil.JDIR 2009, Feb 2009, Belfort, France
Communication dans un congrès
inria-00505521
v1
|
|
|
Designing Hypergraph Layouts to GMPLS Routing StrategiesSIROCCO, May 2009, Piran, Slovenia
Communication dans un congrès
inria-00428685
v1
|
|
|
Minimum delay Data Gathering in Radio NetworksADHOC-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-00505522
v1
|
|
|
Fast Data Gathering in Radio Grid NetworksAlgoTel, 2009, Carry-Le-Rouet, France
Communication dans un congrès
inria-00376040
v1
|
|
|
Gathering with minimum delay in tree sensor networksSIROCCO 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-00505523
v1
|
|
|
Optimal gathering algorithms in multi-hop radio tree networks with interferences.AD-HocNow 08, Sep 2008, Nice, France. pp.204-217
Communication dans un congrès
hal-00512281
v1
|
|
|
Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés9è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-00176955
v1
|
|
|
Minimum number of wavelengths equals load in a DAG without internal cycleIPDPS07, Mar 2007, Long beach, CA, United States. pp.1-10
Communication dans un congrès
hal-00512284
v1
|
|
|
Design of Minimal Fault Tolerant On-Board Networks : Practical constructionsSIROCCO07, Jun 2007, Castiglioncello, Italy. pp.261-273
Communication dans un congrès
hal-00512282
v1
|
|
|
Hardness and approximation of Gathering in static radio networksFAWN06 - 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-00344619
v1
|
|
|
Traffic Grooming in Bidirectional WDM Ring NetworksInternational 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-00429168
v1
|
|
|
Design of Minimal Fault Tolerant Networks: Asymptotic BoundsAlgotel06, May 2006, Tregastel, France. pp.169-174
Communication dans un congrès
hal-00512287
v1
|
|
|
Gathering algorithms on paths under interference constraintsCTAC06, May 2006, Roma, Italy. pp.115-126
Communication dans un congrès
hal-00512286
v1
|
|
|
Optimal Solution of the Maximum All Request Path Grooming ProblemAdvanced International Conference on Telecommunications (AICT), Feb 2006, Le Gosier, Guadeloupe, France. ⟨10.1109/AICT-ICIW.2006.144⟩
Communication dans un congrès
inria-00429167
v1
|
|
|
Gathering in specific radio networksAlgoTel'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-00344620
v1
|
|
|
Efficient Gathering in Radio Grids with InterferenceAlgotel, May 2005, Hyères, France. pp.103-106
Communication dans un congrès
hal-03768377
v1
|
|
|
Traffic Grooming on the Path12th 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-00429172
v1
|
|
|
Groupage par tubesConférence Algotel, May 2003, Banyuls, France. pp.27-32
Communication dans un congrès
hal-03768373
v1
|
|
|
Réseaux de télécommunication minimaux embarqués tolérants aux pannes5è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-00307610
v1
|
|
|
Traffic Grooming in Unidirectional WDM Ring Networks using Design TheoryIEEE 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-00429174
v1
|
|
|
Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case7th IFIP Working Conference on Optical Network Design & Modelling (ONDM), 2003, Budapest, Hungary. pp.1135-1153
Communication dans un congrès
inria-00429175
v1
|
|
|
Hierarchical Ring Network Design, Proceedings in Informatics13, CarletonScientific9th International Colloquium on Structural Information and Communication Complexity, SIROCCO9, Jun 2002, Andros, Greece
Communication dans un congrès
hal-03844396
v1
|
|
|
Cycle Covering8th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Jun 2001, Vall de Nuria, Spain. pp.21-34
Communication dans un congrès
inria-00429183
v1
|
|
|
Design of fault tolerant on board networks with priorities3e 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-03844221
v1
|
|
|
A note on cycle coveringACM Symposium on Parallel Algorithms and Architectures (SPAA), 2001, Hersonissos, Greece. pp.310-311, ⟨10.1145/378580.378716⟩
Communication dans un congrès
inria-00429182
v1
|
|
|
Broadcasting in Hypercubes under Circuit Switched ModelIPDPS 2000 - Proceedings International Parallel and Distributed Processing Symposium, May 2000, Cancun, Mexico. pp.21-26
Communication dans un congrès
hal-03768121
v1
|
|
|
Conception d'un réseau WDM protégé par sous-réseaux2è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-00429292
v1
|
|
|
Virtual path layouts with low congestion or low diameter in ATM networksActes 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-03844137
v1
|
|
|
Directed virtual path layouts in ATM networks. Lecture Notes in Computer Science, 1499Proc. Conference DISC98, Sep 1998, Andros, Greece. pp.75-88
Communication dans un congrès
hal-03843995
v1
|
|
|
Virtual path layouts in simple ATM networksProc. Conference IFIP ATM '98, Jul 1998, Ilkley, United Kingdom
Communication dans un congrès
hal-03844032
v1
|
|
|
Deadlock prevention by acyclic orientationsProceedings 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-03832690
v1
|
|
|
Graph Problems arising from Wavelength-routing in All-optical NetworksWOCS 1997 - 2nd Workshop on Optics and Computer Science - 11th International Parallel Processing Symposium, Apr 1997, Geneve, Switzerland
Communication dans un congrès
hal-03764663
v1
|
|
|
Tight bounds on the size of 2-monopoliesConference SIROCCO96, International Informatics Series 6, Carleton University, Jun 1996, Siena, Italy. pp.170-179
Communication dans un congrès
hal-03832700
v1
|
|
|
Gossiping in Cayley Graphs by PacketsProceedings 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-03762695
v1
|
|
|
The SLOOP project: Simulations, Parallel Object-Oriented Languages, Interconnection Networks2nd Euroean School of Computer Science, ESPPE,, Apr 1996, Alpe d'Huez, France. pp.85-88
Communication dans un congrès
hal-03762698
v1
|
|
|
Induced broadcasting algorithms in iterated line digraphsProc. Conference EUROPAR96, Aug 1996, Lyon, France. pp.313-324
Communication dans un congrès
hal-03838874
v1
|
|
|
Efficient Broadcasting Protocols on the de Bruijn and similar NetworksProceedings Conference Sirocco1995, International Informatics Series 2, Carleton University Press, 199-209, Jun 1995, Olympie, Greece
Communication dans un congrès
hal-03762629
v1
|
|
|
Dense bus networks of diameter 2Interconnection 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-03220060
v1
|
|
|
The Power of Small Coalitions in GraphsProceedings Conference Sirocco1995, International Informatics Series 2, Carleton University Press, 173-184, Jun 1995, Olympie, Greece
Communication dans un congrès
hal-03762634
v1
|
|
|
Fast gossiping by short messages, Lecture Notes in Computer Science 14422nd ICALP Conference, Jul 1995, Szeged, Hungary. pp.135-146
Communication dans un congrès
hal-03220089
v1
|
|
|
Broadcasting and NP-completenessProceedings Graph Theory Day 22, Nov 1991, New-York, United States. pp.8-14
Communication dans un congrès
hal-03210114
v1
|
|
|
De Bruijn and Kautz networks : a competitor for the hypercube?First European Workshop on Hypercube and Distributed Computers, Oct 1989, Rennes, France. pp 279-283
Communication dans un congrès
hal-03013384
v1
|
|
|
General and efficient decentralized consensus protocols IIInternational Workshop on Parallel & Distributed Algorithms, Oct 1988, Bonas, France. pp.189-210
Communication dans un congrès
hal-03189950
v1
|
|
|
Decomposition into cycles I: Hamilton decompositionsWorkshop on Cycles and Rays, 1987, Montreal, Canada. pp.9-18
Communication dans un congrès
hal-03013446
v1
|
|
|
General and efficient decentralized consensus protocolsProceedings International workshop, Jul 1987, Amsterdam, Netherlands. pp.41-56
Communication dans un congrès
hal-02973251
v1
|
|
|
Interconnection networks with each node on two busesInternational workshop on Parallel algorithms and architectures, North Holland, 1986, Luminy, France
Communication dans un congrès
hal-02500473
v1
|
|
|
A graph theoretical characterization of minimal deadlocks in Petri netsGraph theory with applications to algorithms and computer science, Wiley, 1985, Kalamazoo,MI, United States. pp.73-87
Communication dans un congrès
hal-02447228
v1
|
|
|
Large hypergraphs of diameter oneGraph theory and Combinatorics, Academic Press, 1984, Cambridge, United Kingdom. pp.19-28
Communication dans un congrès
hal-02447161
v1
|
|
|
The Diameter of Graphs: a surveyCongressus Numerantium, vol32, 1981, Boca raton, United States. pp.3-27
Communication dans un congrès
hal-02426939
v1
|
|
|
Regards sur les numérotations de graphesProceedings Coll. Cerisy, 1980, Cerisy, France. pp.171-176
Communication dans un congrès
hal-02426800
v1
|
|
|
Graceful graphs, radio antennae and French windmillsProceedings 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-02340680
v1
|
|
|
Le problème des ouvroirs (Hypergraph gossip problem)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-02322709
v1
|
|
|
Cycle and circuit designs: odd caseBeitrage zur Graphentheorie and deren Anwendungen, Proc. Coll Oberhof, 1977, 1978, Illmenau, Germany. pp.11-32
Communication dans un congrès
hal-02361437
v1
|
|
|
Indice chromatique de produits de graphesColloque Algèbre appliquée et Combinatoire, 1978, Grenoble, France. pp.106-108
Communication dans un congrès
hal-02340658
v1
|
|
|
Systèmes de triplets et différences associéesProbè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-02322623
v1
|
|
|
On a combinatorial problem of antennas in radio astronomyCombinatorics, Fifth Hungarian Colloquium 1976, Colloquia Mathematica Societatis Janos Bolyai 18,, 1978, Kesthely, Hungary. pp.135-149
Communication dans un congrès
hal-02322841
v1
|
|
|
On maximal systems of quadruplesGraphs, Hypergraphs and Block Systems, 1976, 1978, Zielona Gora, Poland. pp.13-19
Communication dans un congrès
hal-02361454
v1
|
|
|
Hypergraphes hamiltoniensProblè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-02321860
v1
|
|
|
On hamiltonian walks5th British Combinatorial Conference, 1975, Congressus Numerantium 15, Utilitas Math Pub., 1976, Aberdeen, United Kingdom. pp.41-51
Communication dans un congrès
hal-02361388
v1
|
Unsolved problems5th British Combinatorial Conference, 1975, Congressus Numerantium 15, Utilitas Math Pub., 1976, Aberdeen, United Kingdom. pp.695-696
Communication dans un congrès
hal-02447750
v1
|
|
|
|
Graph decompositions and G-designs5th British Combinatorial Conference, 1975, Congressus Numerantium 15, Utilitas Math Pub., 1976, Aberdeen, United Kingdom. pp.53-72
Communication dans un congrès
hal-02361407
v1
|
|
|
The circuit - hypergraph of a tournamentInfinite 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-02366962
v1
|
|
|
Decomposition of Kn* into k-circuits and balanced G-designsRecent 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-02366963
v1
|
ProblemsRecent 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-02450423
v1
|
|
|
|
Graphe représentatif de l'hypergraphe h-parti completHypergraph Seminar 1972, Springer Verlag Lecture Notes 411, 1974, Columbus, Ohio, États-Unis. pp.34-53
Communication dans un congrès
hal-02371597
v1
|
|
|
Line Directed HypergraphsCryptoquater2011 ,Festchrift Jean-jacques,, Springer verlag, pp.1-11, 2011, Lecture Notes in Computer Science, 6805
Chapitre d'ouvrage
hal-00643785
v1
|
|
|
GroomingCharles 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-00429215
v1
|
|
|
Communication dans les réseaux de processeursCommunications dans les réseaux de processeurs, Masson, 1994
Chapitre d'ouvrage
hal-03220071
v1
|
|
|
Routage "wormhole" et canaux virtuelsAlgorithmique parrakèle, Masson, pp.149-158, 1992
Chapitre d'ouvrage
hal-03210127
v1
|
|
|
Graphs and Interconnection networks: diameter and vulnerability,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-02447135
v1
|
|
|
Hamiltonian GraphsSelected topics in graph theory, chapter 6, Academic Press, pp.127-167, 1979
Chapitre d'ouvrage
hal-02352666
v1
|
|
|
EditorialDiscrete Mathematics, 206, pp.1, 1999, ⟨10.1016/S0012-365X(98)00386-0⟩
N°spécial de revue/special issue
hal-03844185
v1
|
|
|
Foreword37-38, pp.1, 1992, ⟨10.1016/0166-218X(92)90119-U⟩
Ouvrages
hal-03220042
v1
|
|
|
Cycles dans les graphes et G-configurationsMathématique discrète [cs.DM]. University Paris 11, 1975
HDR
tel-02376958
v1
|
Chargement...
Chargement...