Publications of Jean-Claude Bermond

1. Jean-Claude Bermond, Michel Cosnard, and Stéphane Pérennes. Directed acyclic graphs with the unique dipath property. Theoretical Computer Science, 504:5-11, September 2013. [WWW ] [PDF ]
   Keywords: DAG (Directed acyclic graphs), load, wavelengths, dipaths, good labelings, conflict graphs, intersection graphs, chromatic number. [Abstract] [bibtex-entry]


2. J. Araujo, J-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski. Weighted improper colouring. Journal of Discrete Algorithms, 16:53-66, 2012.
   Note: Selected papers from the 22nd International Workshop on Combinatorial Algorithms (IWOCA 2011). [WWW ] [PDF ] [Abstract] [bibtex-entry]


3. J-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, and F. Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. Theoretical Computer Science (TCS), 444:3-16, July 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


4. J-C. Bermond and J. Moulierac. Internet et la théorie des graphes. Revue TDC Textes et documents pour la Classe : la révolution Internet, 1042:32-33, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


5. J-C. Bermond and J. Peters. Optimal Gathering in Radio Grids with Interference. Theoretical Computer Science, 457:10-26, October 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


6. J-C. Bermond, F. Ergincan, and M. Syska. Quisquater Festschrift, volume 6805 of Lecture Notes in Computer Science, chapter Line Directed Hypergraphs, pages 25-34. Springer-Verlag, Berlin Heidelberg, 2011. [PDF ] [Abstract] [bibtex-entry]


7. J.-C. Bermond, Y. M. Chee, N. Cohen, and X. Zhang. The $\alpha$-Arboricity of Complete Uniform Hypergraphs. SIAM Journal on Discrete Mathematics, 25(2):600-610, 2011. [PDF ] [Abstract] [bibtex-entry]


8. J-C. Bermond, X. Muñoz, and I. Sau. Traffic Grooming in Bidirectional WDM Ring Networks. Networks, 58(1):20-35, 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]


9. J-C. Bermond, C. J. Colbourn, L. Gionfriddo, G. Quattrocchi, and I. Sau. Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. SIAM Journal on Discrete Mathematics, 24(2):400-419, 2010. [PDF ] [Abstract] [bibtex-entry]


10. J-C. Bermond, L. Gargano, and A. A. Rescigno. Gathering with minimum completion time in sensor tree networks. JOIN, 11(1-2):1-33, 2010.
    Note: A preliminary version has been presented at Sirocco08. [PDF ] [Abstract] [bibtex-entry]


11. J-C. Bermond, F. Havet, F. Huc, and C. Linhares Sales. Improper colouring of weighted grid and hexagonal graphs. Discrete Mathematics, Algorithms and Applications, 2(3):395-411, 2010. [PDF ] [Abstract] [bibtex-entry]


12. J-C. Bermond and M-L. Yu. Optimal gathering algorithms in multi-hop radio tree networks with interferences. Ad Hoc and Sensor Wireless Networks, 9(1-2):109-128, 2010. [PDF ] [Abstract] [bibtex-entry]


13. J-C. Bermond, R. Correa, and M.-L. Yu. Optimal Gathering Protocols on Paths under Interference Constraints. Discrete Mathematics, 309(18):5574-5587, September 2009.
    Note: A preliminary version has been presented at CIAC06. [WWW ] [PDF ] [Abstract] [bibtex-entry]


14. J-C. Bermond, D. Coudert, and B. Lévêque. Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring. Journal of Interconnection Networks (JOIN), 9(4):471-486, December 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]


15. J-C. Bermond, L. Braud, and D. Coudert. Traffic Grooming on the Path. Theoretical Computer Science, 384(2-3):139-151, October 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]


16. J-C. Bermond, A. Ferreira, S. Pérennes, and J. Peters. Neighbourhood Broadcasting in Hypercubes. SIAM Journal on Discrete Mathematics, 21(4):823-843, 2007. [PDF ] [Abstract] [bibtex-entry]


17. J-C. Bermond and M.-L. Yu. Vertex disjoint routings of cycles over tori. Networks, 49(3):217-225, 2007. [PDF ] [bibtex-entry]


18. J-C. Bermond and D. Coudert. Handbook of Combinatorial Designs (2nd edition), volume 42 of Discrete mathematics and Applications, chapter VI.27, Grooming, pages 494-496. Chapman & Hall- CRC Press, editors C.J. Colbourn and J.H. Dinitz, November 2006. [WWW ] [PDF ] [Abstract] [bibtex-entry]


19. J-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes. Hardness and approximation of Gathering in static radio networks. Parallel Processing Letters, 16(2):165--183, 2006. [PDF ] [Abstract] [bibtex-entry]


20. J-C. Bermond, F. Havet, and D. Tóth. Fault tolerant on board networks with priorities. Networks, 47(1):9--25, 2006. [PDF ] [Abstract] [bibtex-entry]


21. J-C. Bermond, C. Colbourn, D. Coudert, G. Ge, A. Ling, and X. Muñoz. Traffic Grooming in Unidirectional WDM Rings With Grooming Ratio C=6. SIAM Journal on Discrete Mathematics, 19(2):523-542, 2005. [PDF ] [Abstract] [bibtex-entry]


22. J.-C. Bermond, C.J. Colbourn, A. Ling, and M.-L. Yu. Grooming in unidirectional rings : $K_4 -e$ designs. Discrete Mathematics, Lindner's Volume, 284(1-3):57--62, 2004. [PDF ] [bibtex-entry]


23. R. Balakhrishnan, J.-C. Bermond, P. Paulraja, and M.-L. Yu. On Hamilton cycle decompositions of the tensor product of complete graphs. Discrete Mathematics, 268:49--58, 2003. [PDF ] [bibtex-entry]


24. J.-C. Bermond, J. Bond, D. Peleg, and S. Pérennes. The power of small coalitions in graphs. Discrete Applied Mathematics, Editor's Choice, 127(3):399-414, 2003. [PDF ] [bibtex-entry]


25. J.-C. Bermond and S. Ceroi. Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. Networks, 41(2):83--86, 2003. [PDF ] [bibtex-entry]


26. J.-C. Bermond, S. Choplin, and S. Pérennes. Hierarchical ring networks design. Theory of Computing Systems, 36(6):663--682, 2003. [PDF ] [bibtex-entry]


27. J-C. Bermond, D. Coudert, and M-L. Yu. On DRC-Covering of $K_n$ by cycles. Journal of Combinatorial Designs, 11(2):100-112, 2003. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


28. J.-C. Bermond, M. Di Ianni, M. Flammini, and S. Pérennes. Acyclic orientations for deadlock prevention in usual networks. Discrete Applied Mathematics, 129(1):31--47, 2003. [PDF ] [bibtex-entry]


29. J.-C. Bermond, N. Marlin, D. Peleg, and S. Pérennes. Directed Virtual Path Layout in ATM networks. Theoretical Computer Science, 291(1):3--28, 2003. [PDF ] [bibtex-entry]


30. J.-C. Bermond, E. Darrot, and O. Delmas. Design of fault tolerant on-board networks in satellites. Networks, 40:202--207, 2002. [PDF ] [bibtex-entry]


31. J.-C. Bermond, X. Muñoz, and A. Marchetti-Spaccamela. A Broadcasting Protocol in Line Digraphs. Journal of Parallel and Distributed Computing, 61(8):1013--1032, August 2001. [PDF ] [bibtex-entry]


32. J.-C. Bermond, J. Bond, C. Martin, A. Pekec, and F. S. Roberts. Optimal orientation of annular networks. JOIN, 1(1):21-46, 2000. [PDF ] [bibtex-entry]


33. J.-C. Bermond, L. Gargano, S. Pérennes, A.A. Rescigno, and U. Vaccaro. Efficient Collective Communications in Optical Networks. Theoretical Computer Science, 233(1-2):165--189, 2000. [PDF ] [bibtex-entry]


34. J.-C. Bermond, S. Marshall, and M.L. Yu. Improved bounds for gossiping in mesh-bus networks. JOIN, 1(1):1-19, 2000. [PDF ] [bibtex-entry]


35. R. Balakhrishnan, J.-C. Bermond, and P. Paulraja. Combinatorics and Number Theory. In Editors Special Issues of Discrete Mathematics, volume 206, pages 1-220. North Holland, 1999. [bibtex-entry]


36. J.-C. Bermond, A. Bonnecaze, T. Kodate, S. Pérennes, and P. Solé. Symetric flows and broadcasting in hypercubes. Annales de l'Institut Fourier, 49:787-807, 1999. [PDF ] [bibtex-entry]


37. J.-C. Bermond, E. Darrot, O. Delmas, and S. Pérennes. Hamilton circuits in the directed wrapped butterfly network. Discrete Applied Mathematics, 84(1-3):21-42, 1998. [PDF ] [bibtex-entry]


38. J.-C. Bermond, E. Darrot, O. Delmas, and S. Pérennes. Hamilton cycle decomposition of the butterfly networks. Parallel Processing Letters, 8(3):371-385, 1998. [PDF ] [bibtex-entry]


39. J.-C. Bermond, L. Gargano, and S. Pérennes. Optimal sequential gossiping by short messages. Discrete Applied Mathematics, 86(2-3):145-155, 1998. [PDF ] [bibtex-entry]


40. J.-C. Bermond, L. Gargano, A.A. Rescigno, and U. Vaccaro. Fast gossiping by short messages. SIAM Journal on Computing, 27(4):917-941, 1998. [PDF ] [bibtex-entry]


41. J.-C. Bermond, R. Dawes, and F.O. Ergincan. De Bruijn and Kautz bus networks. Networks, 30:205-218, 1997. [PDF ] [bibtex-entry]


42. J.-C. Bermond, H.A. Harutyunyan, A.L. Liestman, and S. Pérennes. A note on the dimensionalityof modified Knödel Graphs. International Journal of Foundations of Computer Science, 8(2):109-116, 1997. [PDF ] [bibtex-entry]


43. J.-C. Bermond, Z. Liu, and M. Syska. Mean eccentricities of de Bruijn networks. Networks, 30:187-203, 1997. [PDF ] [bibtex-entry]


44. J.-C. Bermond and F.O. Ergincan. Bus Interconnection Networks. Discrete Applied Mathematics, 68:1-15, 1996. [PDF ] [bibtex-entry]


45. J.-C. Bermond, C. Peyrat, I. Sakho, and M. Tchuente. Parallelization of Gauss elimination algorithm on systolic arrays. Journal of Parallel and Distributed Computing, 33:69--75, 1996. [bibtex-entry]


46. J.-C. Bermond, F. Comellas, and D.F. Hsu. Distributed Loop Computer Networks: a survey. Journal of Parallel and Distributed Computing, 24:2--10, 1995. [bibtex-entry]


47. J.-C. Bermond, P. Fraigniaud, and J.G. Peters. Antepenultimate Broadcasting. Networks, 26(3):125--137, 1995. [bibtex-entry]


48. J.-C. Bermond and P. Fraigniaud. Broadcasting and Gossiping in de Bruijn Networks. SIAM Journal on Computing, 23(1):212--225, 1994. [bibtex-entry]


49. J.-C. Bermond and P. Hell. On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs. Journal of Graph theory, 17(5):647--655, 1993. [PDF ] [bibtex-entry]


50. J.-C. Bermond, E. Lazard, D. Sotteau, and M. Syska. La Théorie des graphes. Courrier du CNRS, la recherche en informatique, 80:54--55, 1993. [PDF ] [bibtex-entry]


51. J.-C. Bermond, N. Homobono N., and C. Peyrat. Connectivity of Kautz Networks. Discrete Mathematics, 114:51--62, 1993. [bibtex-entry]


52. J.-C. Bermond, C. Delorme, and J-J. Quisquater. Table of large $({\Delta},D)$-graphs. Discrete Applied Mathematics, 37/38:575--577, 1992. [bibtex-entry]


53. J.-C. Bermond, P. Hell, A. L. Liestman, and J. G. Peters. Broadcasting in bounded degree graphs. SIAM Journal on Discrete Mathematics, 5(1):10--24, 1992. [PDF ] [bibtex-entry]


54. J.-C. Bermond, P. Hell, A. L. Liestman, and J. G. Peters. Sparse broadcast graphs. Discrete Applied Mathematics, 36:97--130, 1992. [bibtex-entry]


55. J.-C. Bermond, P. Hell, and J.-J. Quisquater. Construction of large packet radio networks. Parallel Processing Letters, 2(1):3-12, 1992. [PDF ] [bibtex-entry]


56. J.-C. Bermond, P. Michallon, and D. Trystram. Broadcasting in wraparound meshes with parallel monodirectional links. Parallel Computing, 18:639--648, 1992. [bibtex-entry]


57. J.-C. Bermond and J.-C. Konig. Un protocole distribué pour la 2-connexité. TSI, 10(4):269--274, 1991. [bibtex-entry]


58. J.-C. Bermond and D. Tzvieli. Minimal diameter double loop networks, part II: dense optimal families. Networks, 21:1--9, 1991. [bibtex-entry]


59. J.-C. Bermond, K. Heinrich, and M.L. Yu. Existence of resolvable path designs. Journal Europeen de Combinatoire, 11:205--211, 1990. [bibtex-entry]


60. J.-C. Bermond, K. Heinrich, and M.L. Yu. On resolvable mixed path designs. Journal Europeen de Combinatoire, 11:313--318, 1990. [bibtex-entry]


61. J.-C. Bermond, K. Berrada, and J. Bond. Extensions of networks with given diameter. Discrete Math., 75(1-3):31--40, 1989.
    Note: Graph theory and combinatorics (In honor of P. Erdös' 75, Cambridge, 1988). [bibtex-entry]


62. J.-C. Bermond, O. Favaron, and M. Mahéo. Hamiltonian decomposition of Cayley graphs of degree $4$. J. Combin. Theory Ser. B, 46(2):142--153, 1989. [bibtex-entry]


63. J.-C. Bermond and J.-M. Fourneau. Independent connections: an easy characterization of baseline-equivalent multistage interconnection networks. Theoret. Comput. Sci., 64(2):191--201, 1989. [bibtex-entry]


64. J.-C. Bermond, N. Homobono, and C. Peyrat. Large fault-tolerant interconnection networks. Graphs Combin., 5(2):107--123, 1989. [bibtex-entry]


65. J.-C. Bermond and C. Peyrat. Induced subgraphs of the power of a cycle. SIAM J. Discrete Math., 2(4):452--455, 1989. [bibtex-entry]


66. J.-C. Bermond, J.-M. Fourneau, and A. Jean-Marie. A graph theoretical approach to equivalence of multistage interconnection networks. Discrete Appl. Math., 22(3):201--214, 1988/89. [bibtex-entry]


67. J.-C. Bermond and C. Peyrat. Broadcasting in de Bruijn networks. Congr. Numer., 66:283--292, 1988.
    Note: Nineteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Baton Rouge, LA, 1988). [bibtex-entry]


68. J.-C. Bermond, J. Bond, and D. Sotteau. On regular packings and coverings. Annals of Discrete mathematics, 34:81--100, 1987. [PDF ] [bibtex-entry]


69. J.-C. Bermond, J.-M. Fourneau, and A. Jean-Marie. Equivalence of multistage interconnection networks. Information Processing Letters, 26:45--50, 1987. [bibtex-entry]


70. J.-C. Bermond, C. Delorme, and J.-J. Quisquater. Strategies for interconnection networks: some methods from graph theory. J. Parallel Distributed Computing, 3(4):433--449, 1986. [WWW ] [bibtex-entry]


71. J.-C. Bermond and M. Paoli. Research problem: Hamilton powers of graphs. Discrete Mathematics, 62:329--331, 1986. [bibtex-entry]


72. J.-C. Bermond, C. Delorme, and G. Farhi. Large graphs with given degree and diameter. II. J. Combin. Theory Ser. B, 36(1):32--48, 1984. [bibtex-entry]


73. J.-C. Bermond, J.-L. Fouquet, M. Habib, and B. Péroche. On linear $k$-arboricity. Discrete Math., 52(2-3):123--132, 1984. [bibtex-entry]


74. J.-C. Bermond and M. Las Vergnas. Regular factors in nearly regular graphs. Discrete Math., 50(1):9--13, 1984. [bibtex-entry]


75. J.-C. Bermond, J. Bond, M. Paoli, and C. Peyrat. Graphs and interconnection networks: diameter and vulnerability. In Surveys in combinatorics (Southampton, 1983), volume 82 of London Math. Soc. Lecture Note Ser., pages 1--30. Cambridge Univ. Press, Cambridge, 1983. [bibtex-entry]


76. J.-C. Bermond, Bill Jackson, and François Jaeger. Shortest coverings of graphs with cycles. J. Combin. Theory Ser. B, 35(3):297--308, 1983. [bibtex-entry]


77. J.-C. Bermond, C. Delorme, and G. Farhi. Large graphs with given degree and diameter. III. In Graph theory, volume 62 of North-Holland Math. Stud., pages 23--31. North-Holland, Amsterdam, 1982.
    Note: Présenté au Colloque Cambridge, England, 1981. [bibtex-entry]


78. J.-C. Bermond and G. Farhi. Sur un problème combinatoire d'antennes en radioastronomie. II. In Theory and practice of combinatorics, volume 60 of North-Holland Math. Stud., pages 49--53. North-Holland, Amsterdam, 1982. [bibtex-entry]


79. J.-C. Bermond, C. Delorme, and J.-J. Quisquater. Tables of large graphs with given degree and diameter. Inform. Process. Lett., 15(1):10--13, 1982. [bibtex-entry]


80. J.-C. Bermond, A. Germa, M.-C. Heydemann, and D. Sotteau. Longest paths in digraphs. Combinatorica, 1(4):337--341, 1981. [PDF ] [bibtex-entry]


81. J.-C. Bermond and C. Thomassen. Cycles in digraphs---a survey. J. Graph Theory, 5(1):1--43, 1981. [bibtex-entry]


82. J.-C. Bermond, P. Frankl, and F. Sterboul. On the maximum number of edges in a hypergraph whose linegraph contains no cycle. Discrete Math., 30(3):295--298, 1980. [bibtex-entry]


83. J.-C. Bermond, A. Germa, M.-C. Heydemann, and D. Sotteau. Girth in digraphs. J. Graph Theory, 4(3):337--341, 1980. [PDF ] [bibtex-entry]


84. J.-C. Bermond, C. Huang, A. Rosa, and D. Sotteau. Decomposition of complete graphs into isomorphic subgraphs with five vertices. Ars Combin., 10:211--254, 1980. [PDF ] [bibtex-entry]


85. J.-C. Bermond, D. Sotteau, A. Germa, and M.-C. Heydemann. Chemins et circuits dans les graphes orientés. Ann. Discrete Math., 8:293--309, 1980.
    Note: Présenté au Colloque Combinatorics 79, Univ. Montréal, Montreal, Canada, 1979. [PDF ] [bibtex-entry]


86. J.-C. Bermond. Hamiltonian Graphs, chapter 6, pages 127-167. Selected Topics in Graph Theory. Academic Press, 1979. [bibtex-entry]


87. J.-C. Bermond, A. Germa, and M.-C. Heydemann. Hamiltonian cycles in strong products of graphs. Canad. Math. Bull., 22(3):305--309, 1979. [bibtex-entry]


88. J.-C. Bermond, A. Germa, and D. Sotteau. Resolvable decomposition of $K\sp{\ast} \sb{n}$. J. Combin. Theory Ser. A, 26(2):179--185, 1979. [PDF ] [bibtex-entry]


89. J.-C. Bermond and Anton Marczyk. Comparaison des puissances de graphes. C. R. Acad. Sci. Paris Sér. A-B, 288(1):A13--A15, 1979. [bibtex-entry]


90. J.-C. Bermond, J. M. S. Sim oes-Pereira, and Christina M. Zamfirescu. On non-Hamiltonian homogeneously traceable digraphs. Math. Japon., 24(4):423--426, 1979/80. [bibtex-entry]


91. J.-C. Bermond. Hamiltonian decompositions of graphs, directed graphs and hypergraphs. Ann. Discrete Math., 3:21--28, 1978.
    Note: Présenté au Cambridge Combinatorial Conf., Advances in graph theory , Trinity College, Cambridge, England, 1977. [bibtex-entry]


92. J.-C. Bermond, A. Germa, and M.-C. Heydemann. Graphes représentatifs d'hypergraphes. Cahiers Centre Études Rech. Opér., 20(3-4):325--329, 1978.
    Note: Présenté au Colloque Mathématiques Discrètes: Codes et Hypergraphes, Brussels, 1978. [bibtex-entry]


93. J.-C. Bermond, C. Huang, and D. Sotteau. Balanced cycle and circuit designs: even cases. Ars Combin., 5:293--318, 1978. [PDF ] [bibtex-entry]


94. J.-C. Bermond and P. Frankl. On a conjecture of Chvátal on $m$-intersecting hypergraphs. Bull. London Math. Soc., 9(3):310--312, 1977. [bibtex-entry]


95. J.-C. Bermond, A. Germa, and D. Sotteau. Hypergraph-designs. Ars Combinatoria, 3:47--66, 1977. [PDF ] [bibtex-entry]


96. J. C. Bermond, M. C. Heydemann, and D. Sotteau. Line graphs of hypergraphs. I. Discrete Math., 18(3):235--241, 1977. [PDF ] [bibtex-entry]


97. J.-C. Bermond and J. Schönheim. $G$-decomposition of $K\sb{n}$, where $G$ has four vertices or less. Discrete Math., 19(2):113--120, 1977. [bibtex-entry]


98. J.-C. Bermond and V. Faber. Decomposition of the complete directed graph into $k$-circuits. J. Combinatorial Theory Ser. B, 21(2):146--155, 1976. [bibtex-entry]


99. J.-C. Bermond and Y. Kodratoff. Une heuristique pour le calcul de l'indice de transitivité d'un tournoi. Rev. Française Automat. Informat. Recherche Opérationnelle Sér. Rouge Informat. Théor., 10(R-1):83--92, 1976. [bibtex-entry]


100. J.-C. Bermond. $1$-graphes réguliers minimaux de girth donné. Cahiers Centre Études Recherche Opér., 17(2-4):125--135, 1975.
     Note: Présenté au Colloque sur la Théorie des Graphes, Paris, 1974. [bibtex-entry]


101. J.-C. Bermond and J. C. Meyer. Hypergraphes et configurations. Cahiers Centre Études Recherche Opér., 17(2-4):137--154, 1975.
     Note: Présenté au Colloque sur la Théorie des Graphes, Paris, 1974. [bibtex-entry]


102. J.-C. Bermond. An application of the solution of Kirkman's schoolgirl problem: the decomposition of the symmetric oriented complete graph into $3$-circuits. Discrete Math., 8:301--304, 1974. [bibtex-entry]


103. J.-C. Bermond. Nombre chromatique total du graphe $r$-parti complet. J. London Math. Soc. (2), 9:279--285, 1974/75. [bibtex-entry]


104. J.-C. Bermond. Some Ramsey numbers for directed graphs. Discrete Math., 9:313--321, 1974. [bibtex-entry]


105. J.-C. Bermond and J. C. Meyer. Graphe représentatif des arêtes d'un multigraphe. J. Math. Pures Appl. (9), 52:299--308, 1973. [PDF ] [bibtex-entry]


106. J.-C. Bermond and P. Rosenstiehl. Pancyclisme du carré du graphe aux arêtes d'un graphe. Cahiers Centre Études Recherche Opér., 15:285--286, 1973.
     Note: Présenté au Colloque sur la Théorie des Graphes,Brussels, 1973. [bibtex-entry]


107. J.-C. Bermond. Arbres maximaux ayant au plus $n$ sommets pendants. C. R. Acad. Sci. Paris Sér. A-B, 274:A1878--A1881, 1972. [bibtex-entry]


108. J.-C. Bermond. Ordres à distance minimum d'un tournoi et graphes partiels sans circuits maximaux. Math. Sci Humaines, (37):5--25, 1972. [bibtex-entry]


109. J.-C. Bermond. Graphes orientés fortement $k$-connexes et graphes ``$k$ arc hamiltoniens''. C. R. Acad. Sci. Paris Sér. A-B, 271:A141--A144, 1970. [bibtex-entry]

1. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing in networks with star SRLGs. In ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) Student Workshop, Nice, France, pages 1-2, December 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


2. J. Araujo, J-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski. Weighted Improper Colouring. In C. S. Iliopoulos and W. F. Smyth, editors, Combinatorial Algorithms, volume 7056 of Lecture Notes in Computer Science, Victoria, Canada, pages 1-18, June 2011. Springer Berlin Heidelberg. [WWW ] [PDF ] [Abstract] [bibtex-entry]


3. J-C. Bermond, L. Gargano, S. Pérennes and A.A. Rescigno, and U. Vaccaro. Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas. In SIROCCO 2011, volume 6796 of Lecture Notes in Computer Science, Gdansk, Poland, pages 306-317, June 2011. Springer-Verlag. [PDF ] [Abstract] [bibtex-entry]


4. J-C. Bermond, D. Mazauric, V. Misra, and P. Nain. A Distributed Scheduling Algorithm for Wireless Networks with Constant Overhead and Arbitrary Binary Interference. In SIGMETRICS 2010, pages 2p, 2010. ACM. [PDF ] [Abstract] [bibtex-entry]


5. P. Giabbanelli, D. Mazauric, and J-C. Bermond. Average path length of deterministic and stochastics recursive networks. In Proceedings of the 2nd Workshop on Complex Networks (CompleNet), volume 116 of Communications in Computer and Information Science (CCIS), pages 1--12, 2010. Springer-Verlag. [PDF ] [Abstract] [bibtex-entry]


6. E. Altman, P. Nain, and J-C. Bermond. Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks. In INFOCOM 2009, Rio De Janeiro, Brazil, pages 1431 - 1439, April 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


7. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, H. Rivano, I. Sau, and F. Solano Donado. MPLS label stacking on the line network. In L. Fratta et al., editor, IFIP Networking, volume 5550 of Lecture Notes in Computer Science, Aachen, Germany, pages 809-820, May 2009. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


8. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, I. Sau, and F. Solano Donado. Designing Hypergraph Layouts to GMPLS Routing Strategies. In 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), volume 5869 of Lecture Notes in Computer Science, Piran, Slovenia, pages 57--71, May 2009. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


9. J-C. Bermond, D. Mazauric, and P. Nain. Algorithmes distribués d'ordonnancement dans les réseaux sans-fil. In 10èmes Journées Doctorales en Informatique et Réseaux (JDIR), Belfort, France, February 2009. [PDF ] [Abstract] [bibtex-entry]


10. J-C. Bermond, N. Nisse, P. Reyes, and H. Rivano. Fast Data Gathering in Radio Grid Networks. In 11èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'09), pages 4p, June 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


11. J. C. Bermond, N. Nisse, P. Reyes, and H. Rivano. Minimum delay Data Gathering in Radio Networks. In Proceedings of the 8th international conference on Ad Hoc Networks and Wireless (AdHoc-Now), volume 5793 of Lecture Notes in Computer Science, pages 69-82, 2009. Springer. [WWW ] [PDF ] [Abstract] [bibtex-entry]


12. J-C. Bermond, L. Gargano, and A.A. Rescigno. Gathering with minimum delay in tree sensor networks. In SIROCCO 2008, volume 5058 of Lecture Notes in Computer Science, Villars-sur-Ollon, Switzerland, pages 262-276, June 2008. Springer-Verlag. [PDF ] [Abstract] [bibtex-entry]


13. J-C. Bermond and M-L. Yu. Optimal gathering algorithms in multi-hop radio tree networks with interferences. In Proceedings of the 7th international conference on Ad Hoc Networks and Wireless (AdHoc-Now), volume 5198 of Lecture Notes in Computer Science, pages 204-217, September 2008. Springer. [PDF ] [Abstract] [bibtex-entry]


14. J-C. Bermond and M. Cosnard. Minimum number of wavelengths equals load in a DAG without internal cycle. In Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International, Long Beach, CA, U.S.A., pages 1-10, March 2007. [PDF ] [bibtex-entry]


15. J-C. Bermond, F. Giroire, and S. Pérennes. Design of Minimal Fault Tolerant On-Board Networks : Practical constructions. In 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO 07), volume 4474 of Lecture Notes in Computer Sciences, Castiglioncello, Italy, pages 261-273, June 2007. [PDF ] [bibtex-entry]


16. J-C. Bermond, F. Havet, F. Huc, and C. Linhares-Sales. Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés. In Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07), Ile d'Oléron, France, pages 53-56, May 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]


17. O. Amini, J-C. Bermond, F. Giroire, F. Huc, and S. Pérennes. Design of Minimal Fault Tolerant Networks: Asymptotic Bounds. In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06), Trégastel, France, pages 37--40, May 2006. [WWW ] [PDF ] [Abstract] [bibtex-entry]


18. J-C. Bermond, R. Corrêa, and J. Yu. Gathering algorithms on paths under interference constraints. In 6th Conference on Algorithms and Complexity, volume 3998 of Lecture Notes in Computer Science, Roma, Italy, pages 115--126, May 2006. [WWW ] [PDF ] [bibtex-entry]


19. J-C. Bermond, M. Cosnard, D. Coudert, and S. Pérennes. Optimal Solution of the Maximum All Request Path Grooming Problem. In Advanced International Conference on Telecommunications (AICT), pages 6p, 2006. IEEE. [PDF ] [Abstract] [bibtex-entry]


20. J-C. Bermond, D. Coudert, X. Muñoz, and I. Sau. Traffic Grooming in Bidirectional WDM ring networks. In IEEE-LEOS ICTON / COST 293 GRAAL, volume 3, pages 19-22, June 2006. [PDF ] [Abstract] [bibtex-entry]


21. J-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes. Gathering in specific radio networks. In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06), Trégastel, France, pages 85--88, May 2006. [WWW ] [PDF ] [bibtex-entry]


22. J-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes. Hardness and approximation of Gathering in static radio networks. In FAWN06, Pisa, Italy, pages 75--79, March 2006. [WWW ] [PDF ] [bibtex-entry]


23. J-C. Bermond, L. Braud, and D. Coudert. Traffic Grooming on the Path. In 12th International Colloquium on Structural Information and Communication Complexity -- SIROCCO, Le Mont Saint-Michel, France, pages 34-48, May 24-26 2005. LNCS 3499. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


24. J.-C. Bermond and J. Peters. Efficient Gathering in Radio Grids with Interference. In Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05), Presqu'île de Giens, pages 103--106, May 2005. [PDF ] [bibtex-entry]


25. J.-C. Bermond and D. Coudert. Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory. In IEEE ICC, volume 2, Anchorage, Alaska, pages 1402-1406, May 2003.
    Note: ON07-3. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


26. J.-C. Bermond, D. Coudert, and X. Muñoz. Traffic Grooming in Unidirectional WDM Ring Networks: The All-to-all Unitary Case. In The 7th IFIP Working Conference on Optical Network Design & Modelling -- ONDM, Budapest, Hongrie, pages 1135-1153, 2003. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


27. J.-C. Bermond, O. DeRivoyre, S. Pérennes, and M. Syska. Groupage par tubes. In Conference ALGOTEL2003, Banyuls, May 2003, pages 169--174, 2003. [PDF ] [bibtex-entry]


28. J.-C. Bermond, O. Delmas, F. Havet, M. Montassier, and S. Pérennes. Réseaux de télécommunications minimaux embarqués tolérants. In Conference ALGOTEL2003, Banyuls, May 2003, pages 27--32, 2003. [PDF ] [bibtex-entry]


29. J.-C. Bermond, S. Choplin, and S. Pérennes. Hierarchical Ring Network Design. In 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO'02), pages 1--16, 2002. Carleton Scientific. [bibtex-entry]


30. J.-C. Bermond, L. Chacon, D. Coudert, and F. Tillerot. A Note on Cycle Covering. In ACM Symposium on Parallel Algorithms and Architectures -- SPAA, Crete island, Greece, pages 310-311, 4-6 July 2001. [POSTSCRIPT ] [Abstract] [bibtex-entry]


31. J.-C. Bermond, L. Chacon, D. Coudert, and F. Tillerot. Cycle Covering. In International Colloquium on Structural Information and Communication Complexity -- SIROCCO, Proceedings in Informatics 11, Vall de Nuria, Spain, pages 21-34, 27-29 June 2001. Carleton Scientific. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


32. J.-C. Bermond, F. Havet, and D. Tóth. Design of fault tolerant on board networks with priorities. In $3^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001), Saint-Jean-de-Luz , France, pages 95--98, Mai 2001. [bibtex-entry]


33. J.-C. Bermond, A. Bonnecaze, T. Kodate, S. Perennes, and P. Sole. Broadcasting in hypercubes in the circuit switched model. In Proc. Conference IPDPS 2000, Cancun, Mexico,, May 2000, pages 21-26, 2000. [PDF ] [bibtex-entry]


34. J-C. Bermond, L. Chacon, D. Coudert, and F. Tillerot. Conception d'un réseau WDM protégé par sous-réseaux. In 2ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'00), La Rochelle, France, pages 83-88, May 2000. INRIA. [WWW ] [PDF ] [Abstract] [bibtex-entry]


35. J.-C. Bermond, N. Marlin, D. Peleg, and S. Pérennes. Virtual path layouts with low congestion or low diameter in ATM networks. In Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99), Roscoff, France, pages 77-82, May 1999. [bibtex-entry]


36. J.-C. Bermond, N. Marlin, D. Peleg, and S. Pérennes. Directed virtual path layouts in ATM networks. In Proc. Conference DISC98, Andros, Greece,Sep. 1998 Lecture Notes in Computer Science, 1499, pages 75-i88. (Full version appeared in TCS), 1998. Springer Verlag. [bibtex-entry]


37. J.-C. Bermond, N. Marlin, D. Peleg, and S. Pérennes. Virtual path layouts in simple ATM networks. In Proc. Conference IFIP ATM '98,Ilkley,U.K.,Jul. 1998, 1998. [bibtex-entry]


38. B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, and U. Vaccaro. Graph problems arising from Wavelength--Routing in All--Optical Networks. In Proc. Conference WOCS97, Geneva,April 1997, 1997. [PDF ] [bibtex-entry]


39. J.-C. Bermond, J. Bond, D. Peleg, and S. Pérennes. Tight bounds on the size of 2-monopolies. In Proc. Conference SIROCCO96, Siena, June 96, International Informatics Series 6, pages 170--179, 1997. Carleton U. Press. [bibtex-entry]


40. J.-C. Bermond, M. Di Ianni, M. Flammini, and S. Pérennes. Systolic orientations for deadlock prevention in usual networks. In Proceedings 23th Int Workshop on Graph Theoretic Concepts in Computer Science WG97, Lecture Notes in Computer Science, volume 1335, pages 52--64, 1997. Springer verlag. [bibtex-entry]


41. F. Baude, F. Belloncle, J.-C. Bermond, D. Caromel, O. Dalle, E. Darrot, O. Delmas, N. Furmento, B. Gaujal, P. Mussi, S. Pérennes, Y. Roudier, G. Siegel, and M. Syska. The SLOOP project: Simulations, Parallel Object-Oriented Languages, Interconnection Networks. In 2nd European School of Computer Science, Parallel Programming Environments for High Performance Computing ESPPE'96, Alpe d'Huez, pages 85--88, April 1996. [PDF ] [bibtex-entry]


42. J.-C. Bermond, L. Gargano, S. Pérennes, A.A. Rescigno, and U. Vaccaro. Efficient Collective Communications in Optical Networks. In Proc.23nd ICALP96, Paderborn, Germany Lecture Notes in Computer Science, 1099, pages 574--585, 1996. Springer verlag. [POSTSCRIPT ] [bibtex-entry]


43. J.-C. Bermond, T. Kodate, and S. Perennes. Gossiping in Cayley graphs by packets. In Proceedings of the Franco-Japanese conference Brest July 95, volume Lecture Notes in Computer Science, 1120, pages 301-315, 1996. Springer verlag. [PDF ] [bibtex-entry]


44. J.-C. Bermond, A. Marchetti, and X. Munoz. Induced broadcasting algorithms in iterated line digraphs. In Proc. Conference EUROPAR96, Lyon, August 96, Lecture Notes in Computer Science, 1123, pages 313--324, 1996. Springer Verlag. [bibtex-entry]


45. J.-C. Bermond, J. Bond, and S. Djelloul. Dense bus networks of diameter 2. In Proc. Workshop on interconnection Networks, DIMACS, Feb. 1994, DIMACS Ser., volume 21, pages 9--18, 1995. Annals New York Academy of Sciences. [PDF ] [bibtex-entry]


46. J.-C. Bermond, D. Caromel, and P. Mussi. Simulation within a Parallel Object-Oriented Language: The SLOOP System. In proceedings Joint Conference on Information Sciences (JCIS), pages 218--221, October 1995.
    Note: Invited session on Object-Oriented Programming. [bibtex-entry]


47. J.-C. Bermond, D. Caromel, and P. Mussi. Simulation within a parallel object oriented language : The SLOOP System. In Proceedings Joint Conference on Information Sciences (JCIS'95), North Carolina , Sept. 1995, 1995. [bibtex-entry]


48. J.-C. Bermond, L. Gargano, A.A. Rescigno, and U. Vaccaro. Fast gossiping by short messages. In Proc.22nd ICALP95, Szeged, Hungary, volume 944, pages 135--146, 1995. Lecture Notes in Computer Science, Springer Verlag. [PDF ] [bibtex-entry]


49. J.-C. Bermond and D. Peleg. The power of small coalitions in graphs. In Proc. Conference SIROCCO95 Olympie June 95, International Informatics Series 2, pages 173--184, 1995. Carleton U. Press. [PDF ] [bibtex-entry]


50. J.-C. Bermond and S. Pérennes. Efficient broadcasting protocols on de Bruijn and similar networks. In Proc. Conference SIROCCO95, Olympie June 95, International Informatics Series 2, pages 199--209, 1995. Carleton U. Press. [PDF ] [bibtex-entry]


51. J.-C. Bermond and P. Fraigniaud. Broadcasting and NP-Completeness. In Graph Theory Notes of New York, volume XXII, pages 8--14, 1992. [PDF ] [bibtex-entry]


52. J. C. Bermond and M. Syska. Routage wormhole et canaux virtuels. In M. Nivat M. Cosnard and Y. Robert, editors, Algorithmique Parallèle, pages 149--158, 1992. Masson. [PDF ] [bibtex-entry]


53. B. Alspach, J.-C. Bermond, and D. Sotteau. Decomposition into cycles I: Hamilton decompositions. In Proceedings of 1987 Cycles and Rays Colloquium, Montréal, pages 9--18, 1990. NATO ASI Ser. C, Kluwer Academic Publishers, Dordrech PDF = ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/ABS90.pdf. [bibtex-entry]


54. J.-C. Bermond and J. Bond. Combinatorial designs and hypergraphs of diameter one. In Proceedings of the firts China-US International Conference, Jinan, China, June 1986, volume 576, pages 51--62, 1990. Annals of the New York Academy of Sciences. [bibtex-entry]


55. J.-C. Bermond, G. Illiades, and C. Peyrat. An optimization problem in distributed loop computer networks. In Combinatorial Mathematics: Proceedings of the Third International Conference (New York, 1985), volume 555 of Ann. New York Acad. Sci., New York, pages 45--55, 1989. New York Acad. Sci.. [bibtex-entry]


56. J.-C. Bermond and J.-C. Konig. General and efficient decentralized consensus protocols II. In Proc. of the International Workshop on Parallel and distributed algorithms, Bonas, France, pages 199--210, 1989. North-Holland. [bibtex-entry]


57. J.-C. Bermond and C. Peyrat. De Bruijn and Kautz networks: a competitor for the hypercube?. In F. André and J-P. Verjus, editors, Proceedings of the 1st European Workshop on Hypercubes and Distributed Computers, Rennes, pages 279--293, 1989. North Holland. [bibtex-entry]


58. J.-C. Bermond and J.-M. Fourneau. Independent connections: an easy characterization of baseline equivalent multistage interconnection networks. In Int. Conf. on Parallel Processing, August 1988. [bibtex-entry]


59. J.-C. Bermond, J.-C. König, and M. Raynal. General and efficient decentralized consensus protocols. In Distributed algorithms (Amsterdam, 1987), volume 312 of Lecture Notes in Comput. Sci., Berlin, pages 41--56, 1988. Springer. [bibtex-entry]


60. J.-C. Bermond, J. Bond, and C. Peyrat. Interconnection networks with each node on two buses in Parallel Algorithms and Architectures. In Proceedings InTernational Workshop on Parallel Algorithms and Architectures, pages 155--167, April 1986. North Holland. [bibtex-entry]


61. J.-C. Bermond and G. Memmi. A graph theoretical characterization of minimal deadlocks in Petri nets. In Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984), Wiley-Intersci. Publ., New York, pages 73--87, 1985. Wiley. [bibtex-entry]


62. J.-C. Bermond, J. Bond, and J.-F. Saclé. Large hypergraphs of diameter $1$. In Graph theory and combinatorics (Cambridge, 1983), London, pages 19--28, 1984. Academic Press. [bibtex-entry]


63. J.-C. Bermond, C. Delorme, and J.-J. Quisquater. Grands graphes de degré et diamètre fixés. In Combinatorial mathematics (Marseille-Luminy, 1981), volume 75 of North-Holland Math. Stud., Amsterdam, pages 65--73, 1983. North-Holland. [bibtex-entry]


64. J.-C. Bermond and B. Bollobás. The diameter of graphs---a survey. In Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. I (Baton Rouge, La., 1981), volume 32, pages 3--27, 1981. [bibtex-entry]


65. J.-C. Bermond. Graceful graphs, radio antennae and French windmills. In Graph theory and combinatorics (Proc. Conf., Open Univ., Milton Keynes, 1978), volume 34 of Res. Notes in Math., Boston, Mass., pages 18--37, 1979. Pitman. [bibtex-entry]


66. J.-C. Bermond. Le problème des ``ouvroirs''. In Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), volume 260 of Colloq. Internat. CNRS, Paris, pages 31--34, 1978. CNRS. [bibtex-entry]


67. J.-C. Bermond, A. E. Brouwer, and A. Germa. Systèmes de triplets et différences associées. In Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), volume 260 of Colloq. Internat. CNRS, Paris, pages 35--38, 1978. CNRS. [bibtex-entry]


68. J.-C. Bermond, A. Germa, M.-C. Heydemann, and D. Sotteau. Hypergraphes hamiltoniens. In Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), volume 260 of Colloq. Internat. CNRS, Paris, pages 39--43, 1978. CNRS. [PDF ] [bibtex-entry]


69. J.-C. Bermond, A. Kotzig, and J. Turgeon. On a combinatorial problem of antennas in radioastronomy. In Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I, volume 18 of Colloq. Math. Soc. János Bolyai, Amsterdam, pages 135--149, 1978. North-Holland. [bibtex-entry]


70. J.-C. Bermond and D. Sotteau. Cycle and circuit designs odd case. In Contributions to graph theory and its applications (Internat. Colloq., Oberhof, 1977) (Germany), Ilmenau, pages 11--32, 1977. Tech. Hochschule Ilmenau. [PDF ] [bibtex-entry]


71. J.-C. Bermond. On Hamiltonian walks. In Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975), Winnipeg, Man., pages 41--51. Congressus Numerantium, No. XV, 1976. Utilitas Math.. [bibtex-entry]


72. J.-C. Bermond and D. Sotteau. Graph decompositions and $G$-designs. In Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975), Winnipeg, Man., pages 53--72. Congressus Numerantium, No. XV, 1976. Utilitas Math.. [PDF ] [bibtex-entry]


73. J.-C. Bermond. Decomposition of $K\sp*\sb{n}$ into $k$-circuits and balanced $G$-designs. In Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974), Prague, pages 57--68, 1975. Academia. [bibtex-entry]


74. J.-C. Bermond. The circuit-hypergraph of a tournament. In Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdos on his 60th birthday), Vol. I, Amsterdam, pages 165--180. Colloq. Math. Soc. János Bolyai, Vol. 10, 1975. North-Holland. [bibtex-entry]


75. J.-C. Bermond. Graphe représentatif de l'hypergraphe $h$-parti complet. In Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold Ross), Berlin, pages 34--53. Lecture Notes in Math., Vol. 411, 1974. Springer. [bibtex-entry]

1. J-C. Bermond, D. Coudert, G. D'Angelo, and F. Z. Moataz. Diverse Routing with the star property. Technical report RR-8071, INRIA, September 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]


2. J. Araujo, J-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski. Weighted Improper Colouring. Research Report RR-7590, INRIA, 04 2011. [WWW ] [PDF ]
   Keywords: graph colouring, improper colouring, grids, integer programming, algorithms. [Abstract] [bibtex-entry]


3. J-C. Bermond, A. Jean-Marie, D. Mazauric, and J. Yu. Well Balanced Designs for Data Placement. Research Report 7725, INRIA, 09 2011. [WWW ] [Abstract] [bibtex-entry]


4. J-C. Bermond, F. Havet, F. Huc, and C. Linhares Sales. Improper colouring of weighted grid and hexagonal graphs. Research Report RR-7250, INRIA, April 2010. [WWW ] [PDF ]
   Keywords: Improper colouring, Weighted colouring, Approximation algorithms. [Abstract] [bibtex-entry]


5. J-C. Bermond, C.J. Colbourn, L. Gionfriddo, G. Quattrocchi, and I. Sau. Drop cost and wavelength optimal two-period grooming with ratio 4. Technical report RR-7101, INRIA, November 2009. [PDF ] [Abstract] [bibtex-entry]


6. J-C. Bermond, M. Cosnard, and S. Pérennes. Directed acyclic graphs with unique path property. Technical report 6932, INRIA, May 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


7. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, H. Rivano, I. Sau, and F. Solano Donado. MPLS label stacking on the line network. Technical report RR-6803, INRIA, January 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


8. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, I. Sau, and F. Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. Research Report RR-7071, INRIA, October 2009. [WWW ] [PDF ]
   Keywords: GMPLS, optical networks, label stacking, hypergraph layout, approximation algorithms, dynamic programming.. [Abstract] [bibtex-entry]


9. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, I. Sau, and F. Solano Donado. GMPLS Routing Strategies based on the Design of Hypergraph Layouts. Technical report RR-6842, INRIA, February 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


10. J-C. Bermond, D. Coudert, and J. Peters. Online Distributed Traffic Grooming on Path Networks. Technical report RR-6833, INRIA, February 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


11. J-C. Bermond, X. Muñoz, and I. Sau. Traffic Grooming in Bidirectional WDM Ring Networks. Technical report RR-7080, INRIA, October 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


12. J-C. Bermond, N. Nisse, P. Reyes, and H. Rivano. Fast Data Gathering in Radio Grid Networks. Research Report RR-6851, INRIA, March 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]


13. E. Altman, P. Nain, and J-C. Bermond. Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks. Research Report RR-6645, INRIA, September 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]


14. J-C. Bermond, I. Caragiannis, D. Coudert, F. Diedrich, L. Hogie, F. Huc, C. Molle, J. Monteiro, P. Leone, H. Rivano, and I. Sau. Algorithmic solutions for critical resource sharing: third year. Technical report Deliverable 2.2.3, IST FET AEOLUS, Integrated Project IST-015964, 2008. [PDF ] [bibtex-entry]


15. J-C. Bermond, R. Correa, and M.-L. Yu. Optimal Gathering Protocols on Paths under Interference Constraints. Technical report inria-00168162, HAL, August 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]


16. J-C. Bermond, D. Mazauric, V. Misra, and P. Nain. Distributed Call Scheduling in Wireless Networks. Technical report RR-6763, INRIA, December 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]


17. J-C. Bermond, V. Papadopoulou, and E. Pitoura. Subproject2: Resource Management Report on the activities of the third year. Technical report Deliverable 2.O.3, IST FET AEOLUS, Integrated Project IST-015964, 2008. [PDF ] [bibtex-entry]


18. J-C. Bermond, I. Caragiannis, D. Coudert, C. Gomes, I. Guerin-Lassous, G. Huiban, C. Molle, and I. Sau. Algorithmic solutions for critical resource sharing: second year. Technical report Deliverable 2.2.2, IST FET AEOLUS, Integrated Project IST-015964, 2007. [PDF ] [bibtex-entry]


19. J-C. Bermond, D. Coudert, and B. Leveque. Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring. Technical report inria-00175795, hal, October 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]


20. J-C. Bermond, V. Papadopoulou, and E. Pitoura. Subproject2: Resource Management Report on the activities of the second year. Technical report Deliverable 2.O.2, IST FET AEOLUS, Integrated Project IST-015964, 2007. [PDF ] [bibtex-entry]


21. J-C. Bermond, D. Coudert, H. Rivano, and M. Syska. Critical resource sharing, State of the art Survey. Technical report Deliverable 2.2.1, IST FET AEOLUS, Integrated Project IST-015964, 2006. [PDF ] [bibtex-entry]


22. J-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes. Hardness and approximation of gathering in static radio networks. Research Report 5936, INRIA, 06 2006. [WWW ] [PDF ] [Abstract] [bibtex-entry]


23. J-C. Bermond, V. Papadopoulou, and E. Pitoura. Subproject2: Resource Management Report on the activities of the first year. Technical report Deliverable 2.O.1, IST FET AEOLUS, Integrated Project IST-015964, 2006. [PDF ] [bibtex-entry]


24. J-C. Bermond, L. Braud, and D. Coudert. Traffic Grooming on the Path. Technical report, INRIA Research Report 5645 (.ps.gz) and I3S Research Report I3S/RR-2005-20-FR (.pdf), 2005. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


25. J-C. Bermond, M. Cosnard, D. Coudert, and S. Perennes. Optimal Solution of the Maximum All Request Path Grooming Problem. Technical report, INRIA Research Report 5627 (.ps.gz) and I3S Research Report I3S/RR-2005-18-FR (.pdf), 2005. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


26. J.-C. Bermond, F. Havet, and C. D. Tóth. Fault tolerant on-board networks with priorities. Research Report RR-5363, INRIA, 2004 route des lucioles - BP 93 - FR-06902 Sophia Antipolis, November 2004. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]


27. J.-C. Bermond and S. Céroi. Minimizing SONET ADMs in unidirectional WDM ring with grooming ratio 3. Technical report RR-4626, INRIA, Sophia Antipolis, November 2002. [bibtex-entry]


28. O. Audouin, C. Blaizot, E. Dotaro, M. Vigoureux, B. Beauquier, J.-C. Bermond, B. Bongiovanni, S. Pérennes, M. Syska, S. Bibas, L. Chacon, B. Decocq, E. Didelet, A. Laugier, A. Lisser, A. Ouorou, and F. Tillerot. Planification et Optimisation des Réseaux de Transport Optiques. Rapport final RNRT PORTO, Alcatel Research & Innovation, Projet MASCOTTE (CNRS/INRIA/UNSA) et France Télécom R&D, Sophia Antipolis, December 2001. [bibtex-entry]


29. J.-C. Bermond, D. Coudert, and M-L. Yu. On DRC-Covering of $K_n$ by cycles. Technical report, INRIA Research Report RR-4299, I3S Research Report I3S/RR-2002-30-FR, 2001. [PDF ] [POSTSCRIPT ] [bibtex-entry]

This document was translated from BibT_EX by bibtex2html