( en | de | ru )

 

Disambiguation of "Bermond, Jean-Claude"

Author of the publication

copydeleteadd this publication to your clipboard
Gathering Radio Messages in the Path.

, , , , and . Discret. Math. Algorithms Appl., (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jean-Claude Heilig

Jean-Claude Jaquet

Jean-Claude Nkurikiyinka

Jean-Claude Eischen

Jean-Claude Fernandez

 

Other publications of authors with the same name

Tables of Large Graphs with Given Degree and Diameter., , and . Inf. Process. Lett., 15 (1): 10-13 (1982)Improper Coloring of Weighted Grid and Hexagonal Graphs., , , and . Discret. Math. Algorithms Appl., 2 (3): 395-412 (2010)Girth in digraphs., , , and . J. Graph Theory, 4 (3): 337-341 (1980)The α-Arboricity of Complete Uniform Hypergraphs., , , and . SIAM J. Discret. Math., 25 (2): 600-610 (2011)Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4., , , , and . SIAM J. Discret. Math., 24 (2): 400-419 (2010)Hardness and Approximation of Gathering in Static Radio Networks., , , , and . Parallel Process. Lett., 16 (2): 165-184 (2006)Construction of Large Packet Radio Networks., , and . Parallel Process. Lett., (1992)Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences., and . ADHOC-NOW, volume 5198 of Lecture Notes in Computer Science, page 204-217. Springer, (2008)Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks., and . Theor. Comput. Sci., 64 (2): 191-201 (1989)Finding disjoint paths in networks with star shared risk link groups., , , and . Theor. Comput. Sci., (2015)