SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Jean-Claude Bermond: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Jean-Claude Bermond, Michel Cosnard, David Coudert, Stéphane Pérennes
Optimal Solution of the Maximum All Request Path Grooming Problem. [Citation Graph (0, 0)][DBLP]
AICT/ICIW, 2006, pp:28- [Conf]
Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu
Gathering Algorithms on Paths Under Interference Constraints. [Citation Graph (0, 0)][DBLP]
CIAC, 2006, pp:115-126 [Conf]
Jean-Claude Bermond, Takako Kodate, Stephane Perennes
Gossiping in Cayley Graphs by Packets. [Citation Graph (0, 0)][DBLP]
Combinatorics and Computer Science, 1995, pp:301-315 [Conf]
Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela
Induced Broadcasting Algorithms in Iterated Line Digraphs. [Citation Graph (0, 0)][DBLP]
Euro-Par, Vol. I, 1996, pp:313-324 [Conf]
Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro
Efficient Collective Communication in Optical Networks. [Citation Graph (0, 0)][DBLP]
ICALP, 1996, pp:574-585 [Conf]
Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
Fast Gossiping by Short Messages. [Citation Graph (0, 0)][DBLP]
ICALP, 1995, pp:135-146 [Conf]
Jean-Claude Bermond, Jean-Michel Fourneau
Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
ICPP (1), 1988, pp:187-190 [Conf]
Jean-Claude Bermond, Takako Kodate, Stephane Perennes, Alexis Bonnecaze, Patrick Solé
Broadcasting in Hypercubes in the Circuit Switched Model. [Citation Graph (0, 0)][DBLP]
IPDPS, 2000, pp:21-26 [Conf]
Jean-Claude Bermond, Nelson Morales, Stéphane Pérennes, Jérôme Galtier, Ralf Klasing
Hardness and approximation of Gathering in static radio networks. [Citation Graph (0, 0)][DBLP]
PerCom Workshops, 2006, pp:75-79 [Conf]
Jean-Claude Bermond, Laurent Braud, David Coudert
Traffic Grooming on the Path. [Citation Graph (0, 0)][DBLP]
SIROCCO, 2005, pp:34-48 [Conf]
Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes
Tight Bounds on the Size of 2-Monopolies. [Citation Graph (0, 0)][DBLP]
SIROCCO, 1996, pp:170-179 [Conf]
Jean-Claude Bermond, Lilian Chacon, David Coudert, François Tillerot
Cycle Covering. [Citation Graph (0, 0)][DBLP]
SIROCCO, 2001, pp:21-34 [Conf]
Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes
Hierarchical Ring Network Design. [Citation Graph (0, 0)][DBLP]
SIROCCO, 2002, pp:1-16 [Conf]
Jean-Claude Bermond, David Peleg
The Power of Small Coalitions in Graphs. [Citation Graph (0, 0)][DBLP]
SIROCCO, 1995, pp:173-184 [Conf]
Jean-Claude Bermond, Stephane Perennes
Efficient Broadcasting Protocols on the de Bruijn and Similar Networks. [Citation Graph (0, 0)][DBLP]
SIROCCO, 1995, pp:199-209 [Conf]
Jean-Claude Bermond, David Coudert, Lilian Chacon, François Tillerot
A note on cycle covering. [Citation Graph (0, 0)][DBLP]
SPAA, 2001, pp:310-311 [Conf]
Jean-Claude Bermond, Jean-Claude König, Michel Raynal
General and Efficient Decentralized Consensus Protocols. [Citation Graph (0, 0)][DBLP]
WDAG, 1987, pp:41-56 [Conf]
Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes
Directed Virtual Path Layouts in ATM Networks. [Citation Graph (0, 0)][DBLP]
DISC, 1998, pp:75-88 [Conf]
Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
WG, 1997, pp:52-64 [Conf]
Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
Longest paths in digraphs. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1981, v:1, n:4, pp:337-341 [Journal]
Jean-Claude Bermond
Foreword. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1992, v:37, n:, pp:1- [Journal]
Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes
The Power of Small Coalitions in Graphs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2003, v:127, n:3, pp:399-414 [Journal]
Jean-Claude Bermond, Olivier Delmas, Éric Darrot, Stephane Perennes
Hamilton Circuits in the Directed Wrapped Butterfly Network. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:21-42 [Journal]
Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater
Table of Large (Delta, D)-Graphs. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1992, v:37, n:, pp:575-577 [Journal]
Jean-Claude Bermond, Fahir Ö. Ergincan
Bus Interconnection Networks. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1996, v:68, n:1-2, pp:1-15 [Journal]
Jean-Claude Bermond, Luisa Gargano, Stephane Perennes
Optimal Sequential Gossiping by Short Messages. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1998, v:86, n:2-3, pp:145-155 [Journal]
Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
Deadlock Prevention by Acyclic Orientations. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2003, v:129, n:1, pp:31-47 [Journal]
R. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu
On Hamilton cycle decompositions of the tensor product of complete graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2003, v:268, n:1-3, pp:49-58 [Journal]
Jean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu
Grooming in unidirectional rings: K₄-e designs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2004, v:284, n:1-3, pp:57-62 [Journal]
Jean-Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stephane Perennes
A Note on the Dimensionality of Modified Knö;del Graphs. [Citation Graph (0, 0)][DBLP]
Int. J. Found. Comput. Sci., 1997, v:8, n:2, pp:109-0 [Journal]
Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater
Tables of Large Graphs with Given Degree and Diameter. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1982, v:15, n:1, pp:10-13 [Journal]
Jean-Claude Bermond, Jean-Michel Fourneau, Alain Jean-Marie
Equivalence of Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1987, v:26, n:1, pp:45-50 [Journal]
Jean-Claude Bermond, Yves Kodratoff
Une Heuristique pour le Calcul de l'Indice de Transitivité d'un Tournoi. [Citation Graph (0, 0)][DBLP]
ITA, 1976, v:10, n:1, pp:83-92 [Journal]
Jean-Claude Bermond, Charles Delorme, G. Farhi
Large graphs with given degree and diameter. II. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1984, v:36, n:1, pp:32-48 [Journal]
Jean-Claude Bermond, Odile Favaron, Maryvonne Mahéo
Hamiltonian decomposition of Cayley graphs of degree 4. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1989, v:46, n:2, pp:142-153 [Journal]
Jean-Claude Bermond, Anne Germa, Dominique Sotteau
Resolvable Decomposition of K_n. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1979, v:26, n:2, pp:179-185 [Journal]
Jean-Claude Bermond, Bill Jackson, François Jaeger
Shortest coverings of graphs with cycles. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1983, v:35, n:3, pp:297-308 [Journal]
Jean-Claude Bermond, V. Faber
Decomposition of the complete directed graph into k-circuits. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1976, v:21, n:2, pp:146-155 [Journal]
Jean-Claude Bermond, Johny Bond, Carole Martin, Aleksandar Pekec, Fred S. Roberts
Optimal Orientations of Annular Networks. [Citation Graph (0, 0)][DBLP]
Journal of Interconnection Networks, 2000, v:1, n:1, pp:21-46 [Journal]
Jean-Claude Bermond, Susan Marshall, Min-Li Yu
Improved Bounds for Gossiping in Mesh Bus Networks. [Citation Graph (0, 0)][DBLP]
Journal of Interconnection Networks, 2000, v:1, n:1, pp:1-19 [Journal]
Jean-Claude Bermond, Francesc Comellas, D. Frank Hsu
Distributed Loop Computer Networks: A Survey. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 1995, v:24, n:1, pp:2-10 [Journal]
Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater
Strategies for Interconnection Networks: Some Methods from Graph Theory. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 1986, v:3, n:4, pp:433-449 [Journal]
Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela
A Broadcasting Protocol in Line Digraphs. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 2001, v:61, n:8, pp:1013-1032 [Journal]
Jean-Claude Bermond, Claudine Peyrat, I. Sakho, Maurice Tchuente
Parallelization of the {Gaussian} Elimination Algorithm on Systolic Arrays. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 1996, v:33, n:1, pp:69-75 [Journal]
Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes
Hierarchical Ring Network design. [Citation Graph (0, 0)][DBLP]
Theory Comput. Syst., 2003, v:36, n:6, pp:663-682 [Journal]
Jean-Claude Bermond, Stéphan Ceroi
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. [Citation Graph (0, 0)][DBLP]
Networks, 2003, v:41, n:2, pp:83-86 [Journal]
Jean-Claude Bermond, Éric Darrot, Olivier Delmas
Design of fault-tolerant networks for satellites (TWTA redundancy). [Citation Graph (0, 0)][DBLP]
Networks, 2002, v:40, n:4, pp:202-207 [Journal]
Jean-Claude Bermond, Robin W. Dawes, Fahir Ö. Ergincan
De Bruijn and Kautz bus networks. [Citation Graph (0, 0)][DBLP]
Networks, 1997, v:30, n:3, pp:205-218 [Journal]
Jean-Claude Bermond, Zhen Liu, Michel Syska
Mean eccentricities of de Bruijn networks. [Citation Graph (0, 0)][DBLP]
Networks, 1997, v:30, n:3, pp:187-203 [Journal]
Jean-Claude Bermond, F. Havet, Csaba D. Tóth
Fault tolerant on-board networks with priorities. [Citation Graph (0, 0)][DBLP]
Networks, 2006, v:47, n:1, pp:9-25 [Journal]
Jean-Claude Bermond, Philippe Michallon, Denis Trystram
Broadcasting in wraparound meshes with parallel monodirectional links. [Citation Graph (0, 0)][DBLP]
Parallel Computing, 1992, v:18, n:6, pp:639-648 [Journal]
Jean-Claude Bermond, Pavol Hell, Jean-Jacques Quisquater
Construction of Large Packet Radio Networks. [Citation Graph (0, 0)][DBLP]
Parallel Processing Letters, 1992, v:2, n:, pp:3-12 [Journal]
Jean-Claude Bermond, Éric Darrot, Olivier Delmas, Stephane Perennes
Hamilton Cycle Decomposition of the Butterfly Network. [Citation Graph (0, 0)][DBLP]
Parallel Processing Letters, 1998, v:8, n:3, pp:371-385 [Journal]
Jean-Claude Bermond, Jérôme Galtier, Ralf Klasing, Nelson Morales, Stephane Perennes
Hardness and Approximation of Gathering in Static Radio Networks. [Citation Graph (0, 0)][DBLP]
Parallel Processing Letters, 2006, v:16, n:2, pp:165-184 [Journal]
Jean-Claude Bermond, Pierre Fraigniaud
Broadcasting and Gossiping in de Bruijn Networks. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1994, v:23, n:1, pp:212-225 [Journal]
Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
Fast Gossiping by Short Messages. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1998, v:27, n:4, pp:917-941 [Journal]
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. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 2005, v:19, n:2, pp:523-542 [Journal]
Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters
Broadcasting in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1992, v:5, n:1, pp:10-24 [Journal]
Jean-Claude Bermond, Claudine Peyrat
Induced Subgraphs of the Power of a Cycle. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1989, v:2, n:4, pp:452-455 [Journal]
Jean-Claude Bermond, Jean-Michel Fourneau
Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1989, v:64, n:2, pp:191-201 [Journal]
Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro
Efficient collective communication in optical networks. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:233, n:1-2, pp:165-189 [Journal]
Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes
Directed virtual path layouts in ATM networks. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2003, v:291, n:1, pp:3-28 [Journal]
Jean-Claude Bermond, Michel Cosnard
Minimum number of wavelengths equals load in a DAG without internal cycle. [Citation Graph (0, 0)][DBLP]
IPDPS, 2007, pp:1-10 [Conf]
Jean-Claude Bermond, Frédéric Giroire, Stéphane Pérennes
Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions. [Citation Graph (0, 0)][DBLP]
SIROCCO, 2007, pp:261-273 [Conf]
Jean-Claude Bermond, Jean-Luc Fouquet, Michel Habib, Bernard Péroche
On linear k-arboricity. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1984, v:52, n:2-3, pp:123-132 [Journal]
Jean-Claude Bermond, Michel Las Vergnas
Regular factors in nearly regular graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1984, v:50, n:, pp:9-13 [Journal]
Jean-Claude Bermond, K. Berrada, Johny Bond
Extensions of networks with given diameter. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1989, v:75, n:1-3, pp:31-40 [Journal]
Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat
Connectivity of kautz networks. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1993, v:114, n:1-3, pp:51-62 [Journal]
Jean-Claude Bermond, Laurent Braud, David Coudert
Traffic grooming on the path. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2007, v:384, n:2-3, pp:139-151 [Journal]
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences. [Citation Graph (, )][DBLP]
Minimum Delay Data Gathering in Radio Networks. [Citation Graph (, )][DBLP]
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks. [Citation Graph (, )][DBLP]
MPLS Label Stacking on the Line Network. [Citation Graph (, )][DBLP]
A distributed scheduling algorithm for wireless networks with constant overhead and arbitrary binary interference. [Citation Graph (, )][DBLP]
Gathering with Minimum Delay in Tree Sensor Networks. [Citation Graph (, )][DBLP]
Designing Hypergraph Layouts to GMPLS Routing Strategies. [Citation Graph (, )][DBLP]
Sparse broadcast graphs. [Citation Graph (, )][DBLP]
Optimal gathering protocols on paths under interference constraints. [Citation Graph (, )][DBLP]

Search in 0.007secs, Finished in 0.011secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP