Publications of year 2006
| Publications of year 2006 |
-
Jean-Claude Bermond and David Coudert.
Grooming.
In Charles J. Colbourn and Jeffrey H. Dinitz, editors,Handbook of Combinatorial Designs (2nd edition),
volume 42 of Discrete mathematics and Applications,
pages 494-496.
Chapman & Hall- CRC Press,
2006.
Note: Chapter VI.27.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
Michel Cosnard,
David Coudert,
and Stéphane Pérennes.
Optimal Solution of the Maximum All Request Path Grooming Problem.
In Advanced International Conference on Telecommunications (AICT),
Le Gosier, Guadeloupe, France,
February 2006.
IEEE.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
David Coudert,
Xavier Munoz,
and Ignasi Sau Valls.
Traffic Grooming in Bidirectional WDM Ring Networks.
In International Conference on Transparent Optical Networks (ICTON),
volume 3,
Nottingham, United Kingdom,
pages 19 - 22,
June 2006.
IEEE / LEOS.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Stéphane Pérennes,
Hervé Rivano,
and Marie-Emilie Voge.
Shared Risk Resource Groups and Survivability in Multilayer Networks.
In International Conference on Transparent Optical Networks (ICTON),
volume 3,
Nottingham, United Kingdom,
pages 235 - 238,
June 2006.
IEEE / LEOS.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
Laurent Braud,
and David Coudert.
Traffic Grooming on the Path.
Research Report RR-5645,
INRIA,
2006.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
Michel Cosnard,
David Coudert,
and Stéphane Pérennes.
Optimal Solution of the Maximum All Request Path Grooming Problem.
Research Report RR-5627,
INRIA,
2006.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Pallab Datta,
Stéphane Pérennes,
Hervé Rivano,
and Marie-Emilie Voge.
Complexity and approximability issues of Shared Risk Resource Group.
Research Report RR-5859,
INRIA,
2006.
[WWW
] [PDF
] [bibtex-entry]
-
David Coudert,
Florian Huc,
and Jean-Sébastien Sereni.
Pathwidth of outerplanar graphs.
Research Report RR-5804,
INRIA,
2006.
[WWW
] [PDF
] [bibtex-entry]
