Jean-Claude Bermond

Jean-Claude Bermond, Ralf Klasing, Nelson Morales, Stéphane Pérennes, Patricio Reyes: Gathering Radio Messages in the Path. Discrete Math., Alg. and Appl. 5(1) (2013)

Júlio Araujo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski: Weighted improper colouring. J. Discrete Algorithms 16: 53-66 (2012)

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

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

Jean-Claude Bermond, Fahir Ö. Ergincan, Michel Syska: Line Directed Hypergraphs. Cryptography and Security 2012: 25-34

Jean-Claude Bermond, Xavier Muñoz, Ignasi Sau: Traffic grooming in bidirectional WDM ring networks. Networks 58(1): 20-35 (2011)

Jean-Claude Bermond, Y. M. Chee, Nathann Cohen, X. Zhang: The α-Arboricity of Complete Uniform Hypergraphs. SIAM J. Discrete Math. 25(2): 600-610 (2011)

Júlio Araújo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, Remigiusz Modrzejewski: Weighted Improper Colouring. IWOCA 2011: 1-18

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

Jean-Claude Bermond, Min-Li Yu: Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences. Ad Hoc & Sensor Wireless Networks 9(1-2): 109-127 (2010)

Jean-Claude Bermond, Frédéric Havet, Florian Huc, Cláudia Linhares Sales: Improper Coloring of Weighted Grid and Hexagonal Graphs. Discrete Math., Alg. and Appl. 2(3): 395-412 (2010)

Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno: Gathering with Minimum Completion Time in Sensor Tree Networks. Journal of Interconnection Networks 11(1-2): 1-33 (2010)

Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau: Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. SIAM J. Discrete Math. 24(2): 400-419 (2010)

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

Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu: Optimal gathering protocols on paths under interference constraints. Discrete Mathematics 309(18): 5574-5587 (2009)

Jean-Claude Bermond, Nicolas Nisse, Patricio Reyes, Hervé Rivano: Minimum Delay Data Gathering in Radio Networks. ADHOC-NOW 2009: 69-82

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

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

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

Jean-Claude Bermond, David Coudert, Benjamin Lévêque: Approximations for All-to-All Uniform Traffic Grooming on Unidirectional Rings. Journal of Interconnection Networks 9(4): 471-486 (2008)

Jean-Claude Bermond, Min-Li Yu: Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences. ADHOC-NOW 2008: 204-217

Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno: Gathering with Minimum Delay in Tree Sensor Networks. SIROCCO 2008: 262-276

Jean-Claude Bermond, Min-Li Yu: Vertex disjoint routings of cycles over tori. Networks 49(3): 217-225 (2007)

Jean-Claude Bermond, Afonso Ferreira, Stéphane Pérennes, Joseph G. Peters: Neighborhood Broadcasting in Hypercubes. SIAM J. Discrete Math. 21(4): 823-843 (2007)

Jean-Claude Bermond, Laurent Braud, David Coudert: Traffic grooming on the path. Theor. Comput. Sci. 384(2-3): 139-151 (2007)

Jean-Claude Bermond, Michel Cosnard: Minimum number of wavelengths equals load in a DAG without internal cycle. IPDPS 2007: 1-10

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

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

Jean-Claude Bermond, Jérôme Galtier, Ralf Klasing, Nelson Morales, Stephane Perennes: Hardness and Approximation of Gathering in Static Radio Networks. Parallel Processing Letters 16(2): 165-184 (2006)

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

Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu: Gathering Algorithms on Paths Under Interference Constraints. CIAC 2006: 115-126

Jean-Claude Bermond, Nelson Morales, Stéphane Pérennes, Jérôme Galtier, Ralf Klasing: Hardness and approximation of Gathering in static radio networks. PerCom Workshops 2006: 75-79

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

Jean-Claude Bermond, Laurent Braud, David Coudert: Traffic Grooming on the Path. SIROCCO 2005: 34-48

Jean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu: Grooming in unidirectional rings: K₄-e designs. Discrete Mathematics 284(1-3): 57-62 (2004)

Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes: The Power of Small Coalitions in Graphs. Discrete Applied Mathematics 127(3): 399-414 (2003)

Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes: Deadlock Prevention by Acyclic Orientations. Discrete Applied Mathematics 129(1): 31-47 (2003)

R. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu: On Hamilton cycle decompositions of the tensor product of complete graphs. Discrete Mathematics 268(1-3): 49-58 (2003)

Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes: Hierarchical Ring Network design. Theory Comput. Syst. 36(6): 663-682 (2003)

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

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

Jean-Claude Bermond, David Coudert: Traffic grooming in unidirectional WDM ring networks using design theory. ICC 2003: 1402-1406

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

Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes: Hierarchical Ring Network Design. SIROCCO 2002: 1-16

Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela: A Broadcasting Protocol in Line Digraphs. J. Parallel Distrib. Comput. 61(8): 1013-1032 (2001)

Jean-Claude Bermond, Lilian Chacon, David Coudert, François Tillerot: Cycle Covering. SIROCCO 2001: 21-34

Jean-Claude Bermond, David Coudert, Lilian Chacon, François Tillerot: A note on cycle covering. SPAA 2001: 310-311

Jean-Claude Bermond, Susan Marshall, Min-Li Yu: Improved Bounds for Gossiping in Mesh Bus Networks. Journal of Interconnection Networks 1(1): 1-19 (2000)

Jean-Claude Bermond, Johny Bond, Carole Martin, Aleksandar Pekec, Fred S. Roberts: Optimal Orientations of Annular Networks. Journal of Interconnection Networks 1(1): 21-46 (2000)

Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro: Efficient collective communication in optical networks. Theor. Comput. Sci. 233(1-2): 165-189 (2000)

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

Cyril Gavoille, Jean-Claude Bermond, André Raspaud (Eds.): SIROCCO'99, 6th International Colloquium on Structural Information & Communication Complexity, Lacanau-Ocean, France, 1-3 July, 1999. Carleton Scientific 1999

Jean-Claude Bermond, Olivier Delmas, Éric Darrot, Stephane Perennes: Hamilton Circuits in the Directed Wrapped Butterfly Network. Discrete Applied Mathematics 84(1-3): 21-42 (1998)

Jean-Claude Bermond, Luisa Gargano, Stephane Perennes: Optimal Sequential Gossiping by Short Messages. Discrete Applied Mathematics 86(2-3): 145-155 (1998)

Jean-Claude Bermond, Éric Darrot, Olivier Delmas, Stephane Perennes: Hamilton Cycle Decomposition of the Butterfly Network. Parallel Processing Letters 8(3): 371-385 (1998)

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

Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes: Directed Virtual Path Layouts in ATM Networks. DISC 1998: 75-88

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

Jean-Claude Bermond, Zhen Liu, Michel Syska: Mean eccentricities of de Bruijn networks. Networks 30(3): 187-203 (1997)

Jean-Claude Bermond, Robin W. Dawes, Fahir Ö. Ergincan: De Bruijn and Kautz bus networks. Networks 30(3): 205-218 (1997)

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

Jean-Claude Bermond, Fahir Ö. Ergincan: Bus Interconnection Networks. Discrete Applied Mathematics 68(1-2): 1-15 (1996)

Jean-Claude Bermond, Claudine Peyrat, I. Sakho, Maurice Tchuente: Parallelization of the {Gaussian} Elimination Algorithm on Systolic Arrays. J. Parallel Distrib. Comput. 33(1): 69-75 (1996)

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

Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro: Efficient Collective Communication in Optical Networks. ICALP 1996: 574-585

Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes: Tight Bounds on the Size of 2-Monopolies. SIROCCO 1996: 170-179

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

Jean-Claude Bermond, Pierre Fraigniaud, Joseph G. Peters: Antepenultimate broadcasting. Networks 26(3): 125-137 (1995)

Jean-Claude Bermond, Takako Kodate, Stephane Perennes: Gossiping in Cayley Graphs by Packets. Combinatorics and Computer Science 1995: 301-315

Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro: Fast Gossiping by Short Messages. ICALP 1995: 135-146

Jean-Claude Bermond, David Peleg: The Power of Small Coalitions in Graphs. SIROCCO 1995: 173-184

Jean-Claude Bermond, Stephane Perennes: Efficient Broadcasting Protocols on the de Bruijn and Similar Networks. SIROCCO 1995: 199-209

Jean-Claude Bermond, Pierre Fraigniaud: Broadcasting and Gossiping in de Bruijn Networks. SIAM J. Comput. 23(1): 212-225 (1994)

Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat: Connectivity of kautz networks. Discrete Mathematics 114(1-3): 51-62 (1993)

Jean-Claude Bermond, Pavol Hell: On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs. Journal of Graph Theory 17(5): 647-655 (1993)

Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters: Sparse broadcast graphs. Discrete Applied Mathematics 36(2): 97-130 (1992)

Jean-Claude Bermond: Foreword. Discrete Applied Mathematics 37/38: 1 (1992)

Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater: Table of Large (Delta, D)-Graphs. Discrete Applied Mathematics 37/38: 575-577 (1992)

Jean-Claude Bermond, Philippe Michallon, Denis Trystram: Broadcasting in wraparound meshes with parallel monodirectional links. Parallel Computing 18(6): 639-648 (1992)

Jean-Claude Bermond, Pavol Hell, Jean-Jacques Quisquater: Construction of Large Packet Radio Networks. Parallel Processing Letters 2: 3-12 (1992)

Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters: Broadcasting in Bounded Degree Graphs. SIAM J. Discrete Math. 5(1): 10-24 (1992)

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

Jean-Claude Bermond, K. Berrada, Johny Bond: Extensions of networks with given diameter. Discrete Mathematics 75(1-3): 31-40 (1989)

Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat: Large fault-tolerant interconnection networks. Graphs and Combinatorics 5(1): 107-123 (1989)

Jean-Claude Bermond, Odile Favaron, Maryvonne Mahéo: Hamiltonian decomposition of Cayley graphs of degree 4. J. Comb. Theory, Ser. B 46(2): 142-153 (1989)

Jean-Claude Bermond, Claudine Peyrat: Induced Subgraphs of the Power of a Cycle. SIAM J. Discrete Math. 2(4): 452-455 (1989)

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

Jean-Claude Bermond, Michel Raynal (Eds.): Distributed Algorithms, 3rd International Workshop, Nice, France, September 26-28, 1989, Proceedings. Lecture Notes in Computer Science 392, Springer 1989, isbn 3-540-51687-5

Jean-Claude Bermond, Jean-Michel Fourneau: Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks. ICPP (1) 1988: 187-190

Jean-Claude Bermond, Jean-Michel Fourneau, Alain Jean-Marie: Equivalence of Multistage Interconnection Networks. Inf. Process. Lett. 26(1): 45-50 (1987)

Jean-Claude Bermond, Jean-Claude König, Michel Raynal: General and Efficient Decentralized Consensus Protocols. WDAG 1987: 41-56

Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater: Strategies for Interconnection Networks: Some Methods from Graph Theory. J. Parallel Distrib. Comput. 3(4): 433-449 (1986)

Jean-Claude Bermond, Michel Las Vergnas: Regular factors in nearly regular graphs. Discrete Mathematics 50: 9-13 (1984)

Jean-Claude Bermond, Jean-Luc Fouquet, Michel Habib, Bernard Péroche: On linear k-arboricity. Discrete Mathematics 52(2-3): 123-132 (1984)

Jean-Claude Bermond, Charles Delorme, G. Farhi: Large graphs with given degree and diameter. II. J. Comb. Theory, Ser. B 36(1): 32-48 (1984)

Jean-Claude Bermond, Bill Jackson, François Jaeger: Shortest coverings of graphs with cycles. J. Comb. Theory, Ser. B 35(3): 297-308 (1983)

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

Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau: Longest paths in digraphs. Combinatorica 1(4): 337-341 (1981)

Jean-Claude Bermond, Anne Germa, Dominique Sotteau: Resolvable Decomposition of K_n. J. Comb. Theory, Ser. A 26(2): 179-185 (1979)

Jean-Claude Bermond, Yves Kodratoff: Une Heuristique pour le Calcul de l'Indice de Transitivité d'un Tournoi. ITA 10(1): 83-92 (1976)

Jean-Claude Bermond, V. Faber: Decomposition of the complete directed graph into k-circuits. J. Comb. Theory, Ser. B 21(2): 146-155 (1976)