D. Coudert, A. Ferreira, and X. Muñoz, A multihop multi-OPS optical interconnection network, Journal of Lightwave Technology, vol.18, issue.12, pp.2076-2085, 2000.
DOI : 10.1109/50.908818
URL : https://hal.archives-ouvertes.fr/inria-00429200

A. [. Coudert, X. Ferreira, and . Muñoz, Topologies for optical interconnection networks based on the optical transpose interconnection system, Applied Optics, vol.39, issue.17, pp.392965-2974, 2000.
DOI : 10.1364/AO.39.002965
URL : https://hal.archives-ouvertes.fr/inria-00429198

D. Coudert, A. Ferreira, and S. Pérennes, Isomorphisms of the De Bruijn digraph and free-space optical networks, Networks, vol.60, issue.3, pp.155-164, 2002.
DOI : 10.1002/net.10043
URL : https://hal.archives-ouvertes.fr/inria-00429201

[. Bermond, D. Coudert, and M. Yu, On DRC-covering of Kn by cycles, Journal of Combinatorial Designs, vol.13, issue.2, pp.100-112, 2003.
DOI : 10.1002/jcd.10040
URL : https://hal.archives-ouvertes.fr/inria-00429205

[. Bermond, C. Colbourn, D. Coudert, G. Ge, A. Ling et al., = 6, SIAM Journal on Discrete Mathematics, vol.19, issue.2, pp.523-542, 2005.
DOI : 10.1137/S0895480104444314

[. Bermond, L. Braud, and D. Coudert, Traffic grooming on the path, Theoretical Computer Science, vol.384, issue.2-3, pp.139-151, 2007.
DOI : 10.1016/j.tcs.2007.04.028
URL : https://hal.archives-ouvertes.fr/inria-00070363

P. [. Coudert, S. Datta, H. Perennes, M. Rivano, ]. D. Vogea9 et al., Shared risk resource group : Complexity and approximability issues. Parallel Processing Letters Pathwidth of outerplanar graphs, Journal of Graph Theory, vol.17, issue.551, pp.169-18427, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00070167

J. Bermond, D. Coudert, and B. Lévêque, APPROXIMATIONS FOR ALL-TO-ALL UNIFORM TRAFFIC GROOMING ON UNIDIRECTIONAL RINGS, Journal of Interconnection Networks, vol.09, issue.04, pp.471-486, 2008.
DOI : 10.1142/S0219265908002394

D. Coudert, N. Nepomuceno, and H. Rivano, Power-efficient radio configuration in fixed broadband wireless networks, Computer Communications, vol.33, issue.8
DOI : 10.1016/j.comcom.2010.01.006
URL : https://hal.archives-ouvertes.fr/inria-00466477

?. Chapitres-de-livres, ?. Bermond, and D. Coudert, Handbook of Combinatorial Designs, of Discrete mathematics and Applications, chapter VI.27, Grooming, pp.494-496, 2006.

T. Cinkler, D. Coudert, M. Flammini, G. Monaco, L. Moscardelli et al., Graphs and Algorithms in Communication Networks : Studies in Broadband, Optical , Wireless, and Ad Hoc Networks, volume XXVII of EATCS Texts in Theoretical Computer Science, Traffic Grooming : Combinatorial Results and Practical Resolutions, pp.63-94, 2009.

D. Coudert and X. Muñoz, Recent Research Developments in Optics Graph Theory and Traffic Grooming in WDM Rings, pp.759-778, 2003.

]. D. Ci15, A. Coudert, X. Ferreira, and . Muñoz, Multiprocessor Architectures Using Multi-hops Multi- OPS Lightwave Networks and Distributed Control, IEEE International Parallel Processing Symposium, pp.151-155, 1998.

D. Coudert, A. Ferreira, and X. Muñoz, OTIS-Based multi-hop multi-OPS lightwave networks, Proceedings of the Workshop on Optics and Computer Science, pp.897-910, 1999.
DOI : 10.1007/BFb0097975
URL : https://hal.archives-ouvertes.fr/inria-00429192

]. D. Ci17, A. Coudert, S. Ferreira, and . Perennes, De Bruijn Isomorphisms and Free Space Optical Networks, IEEE International Parallel and Distributed Processing Symposium, pp.769-774, 2000.

J. Bermond, L. Chacon, D. Coudert, and F. Tillerot, Cycle Covering, International Colloquium on Structural Information and Communication Complexity ? SIROCCO Proceedings in Informatics 11, pp.21-34, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00429183

D. Coudert and X. Muñoz, How Graph Theory can help Communications Engineering, Broad band optical fiber communications technology ? BBOFCT, pp.47-61, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00429187

]. D. Ci20, H. Coudert, and . Rivano, Lightpath assignment for multifibers wdm networks with wavelength translators, IEEE Global Telecommunications Conference ? GLOBECOM, pp.2686-2690, 2002.

[. Bermond and D. Coudert, Traffic grooming in unidirectional WDM ring networks using design theory, IEEE International Conference on Communications, 2003. ICC '03., pp.1402-1406, 2003.
DOI : 10.1109/ICC.2003.1204621
URL : https://hal.archives-ouvertes.fr/inria-00429174

J. Bermond, D. Coudert, and X. Muñoz, Traffic grooming in unidirectional WDM ring networks : The all-to-all unitary case, The 7th IFIP Working Conference on Optical Network Design & Modelling ? ONDM, pp.1135-1153, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00429175

M. Bouklit, D. Coudert, J. Lalande, C. Paul, and H. Rivano, Approximate multicommodity flow for WDM networks design, 10th International Colloquium on Structural Information and Communication Complexity ? SIROCCO, number 17 in Proceedings in Informatics, pp.43-56, 2003.
URL : https://hal.archives-ouvertes.fr/lirmm-00269524

]. D. Ci24, H. Coudert, X. Rivano, and . Roche, A combinatorial approximation algorithm for the multicommodity flow problem, WAOA 03, number 2909 in Lecture Notes in Computer Science, pp.256-259, 2003.

J. Bermond, L. Braud, and D. Coudert, Traffic Grooming on the Path, 12th International Colloquium on Structural Information and Communication Complexity ? SIROCCO, pp.34-48, 2005.
DOI : 10.1007/11429647_5
URL : https://hal.archives-ouvertes.fr/inria-00070363

[. Bermond, M. Cosnard, D. Coudert, and S. Perennes, Optimal Solution of the Maximum All Request Path Grooming Problem, Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'06), 2006.
DOI : 10.1109/AICT-ICIW.2006.144
URL : https://hal.archives-ouvertes.fr/inria-00070381

J. Bermond, D. Coudert, X. Muñoz, and I. S. Valls, Traffic grooming in bidirectional WDM ring networks, IEEE-LEOS ICTON / COST 293 GRAAL, pp.19-22, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00429168

]. D. Ci28, S. Coudert, H. Perennes, M. Rivano, and . Voge, Shared risk resource groups and survivability in multilayer networks, IEEE-LEOS ICTON / COST 293 GRAAL, pp.235-238, 2006.

]. D. Ci29, F. Coudert, F. Huc, M. Peix, and . Voge, Reliability of connections in multilayer networks under shared risk groups and costs constraints, IEEE International Conference on Communication (ICC), number ON01-6, pp.5170-5174, 2008.

[. Bermond, D. Coudert, J. Moulierac, S. Perennes, H. Rivano et al., MPLS Label Stacking on the Line Network, MPLS label stacking on the line network IFIP Networking, pp.809-820, 2009.
DOI : 10.1109/JLT.2006.871012
URL : https://hal.archives-ouvertes.fr/inria-00354267

[. Bermond, D. Coudert, J. Moulierac, S. Perennes, I. Sau et al., Designing Hypergraph Layouts to GMPLS Routing Strategies, 16th International Colloquium on Structural Information and Communication Complexity ? SIROCCO, pp.57-71, 2009.
DOI : 10.1109/TCOMM.2008.050601
URL : https://hal.archives-ouvertes.fr/inria-00428685

]. D. Ci32, F. Coudert, I. Giroire, and . Sau, Edge-simple circuits through 10 ordered vertices in square grids, 20th International Workshop on Combinatorial Algorithms ? IWOCA, pp.134-145, 2009.

]. D. Ci33, F. Coudert, D. Huc, N. Mazauric, J. Nisse et al., Reconfiguration of the routing in WDM networks with two classes of services, 13th Conference on Optical Network Design and Modeling (ONDM), 2009.

]. D. Ci34, D. Coudert, N. Mazauric, and . Nisse, On rerouting connection requests in networks with shared bandwidth, DIMAP workshop on Algorithmic Graph Theory (AGT09), pp.109-116, 2009.

]. D. Ci35, N. Coudert, H. Nepomuceno, and . Rivano, Minimizing energy consumption by Power-Efficient radio configuration in fixed broadband wireless networks, First IEEE WoWMoM Workshop on Hot Topics in Mesh Networking (HotMESH), 2009.

[. Bermond, L. Chacon, D. Coudert, and F. Tillerot, A note on cycle covering, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '01, pp.310-311, 2001.
DOI : 10.1145/378580.378716
URL : https://hal.archives-ouvertes.fr/inria-00429182

]. D. Cis37, F. Coudert, D. Huc, and . Mazauric, Computing and updating the process number in trees (short paper), 12th International Conference On Principles Of DIstributed Systems (OPODIS), pp.546-550, 2008.

]. D. Cis38, F. Coudert, D. Huc, and . Mazauric, A distributed algorithm for computing and updating the process number of a forest, 22nd International Symposium on Distributed Computing (DISC), pp.500-501, 2008.

?. Conférences-nationales-avec-comité-de-lecture, ?. Cn39, ]. D. Coudert, A. Ferreira, and S. Perennes, Theoretical Aspects of the Optical Transpose Interconnecting System Architecture, 1ère Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99), pp.101-106, 1999.

J. Bermond, L. Chacon, D. Coudert, and F. Tillerot, Conception d'un réseau WDM protégé par sous-réseaux, 2ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'00), pp.83-88, 2000.

]. D. Cn41 and . Coudert, Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications, 3ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'01), pp.47-53, 2001.

]. D. Cn42, H. Coudert, and . Rivano, Routage optique dans les réseaux WDM multifibres avec conversion partielle, 4ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'02), pp.17-24, 2002.

M. Bouklit, D. Coudert, J. Lalande, and H. Rivano, Approximation combinatoire de multiflot fractionnaire : améliorations, 5ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'03), 2003.

]. D. Cn44, S. Coudert, Q. Perennes, J. Pham, and . Sereni, Rerouting requests in wdm networks The algorithm for trees (section 3), 7ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algo- Tel'05), pp.17-20, 2005.

]. D. Cn45, F. Coudert, D. Huc, and . Mazauric, Algorithme générique pour les jeux de capture dans les arbres, 10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), pp.37-40, 2008.

]. D. Cn46, F. Coudert, D. Huc, N. Mazauric, J. Nisse et al., Reconfiguration dans les réseaux optiques, 11ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09), pp.25-28, 2009.

]. D. Cn47, N. Coudert, H. Nepomuceno, and . Rivano, Joint optimization of routing and radio configuration in fixed wireless networks, 11ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09), pp.49-52, 2009.

?. Soumis-ou-en-préparation, ?. Amini, D. Coudert, and N. Nisse, Some results on non-deterministic graph searching in trees, 2007.

S. [. Coudert, H. Perennes, M. Rivano, and . Voge, Shared risk resource groups and colored graph : Polynomial cases and transformation issues, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00175143

D. Coudert and J. Sereni, Characterization of graphs and digraphs with small process numbers, Discrete Applied Mathematics, vol.159, issue.11, 2007.
DOI : 10.1016/j.dam.2011.03.010

F. [. Coudert, D. Huc, and . Mazauric, A Distributed Algorithm for Computing and Updating the Process Number of a Forest, Research Report, vol.6560, 2008.
DOI : 10.1007/978-3-540-87779-0_36
URL : https://hal.archives-ouvertes.fr/inria-00373850

D. [. Coudert and . Mazauric, Network reconfiguration using cops-and-robber games, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00315568

[. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau et al., GMPLS label space minimization through hypergraph layouts, Theoretical Computer Science, vol.444, 2009.
DOI : 10.1016/j.tcs.2012.01.033
URL : https://hal.archives-ouvertes.fr/inria-00426681

J. Bermond, D. Coudert, and J. Peters, Online distributed traffic grooming on path networks, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00359810

D. [. Cohen, D. Coudert, N. Mazauric, N. Nepomuceno, and . Nisse, Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00421140

D. Coudert, F. Giroire, and I. Sau, On the existence of circuits visiting k ordered vertices in graphs, 2009.

J. [. Coudert and . Sereni, Obstruction set for graphs with process number three

?. Bibliographie-générale, ?. G. Algorithmique, M. R. Downey, M. R. Fellows, D. S. Garey et al., Parameterized Complexity Computers and intractability : A guide to the theory of NPcompletness, 1979.

T. D. Parsons, M. R. Garey, D. S. Johnson, G. L. Miller, C. H. Papadimitriou et al., Pursuit-evasion in a graph The complexity of coloring circular arcs and chords Graph minors. I. Excluding a forest, Theory and applications of graphs, pp.426-441216, 1978.

C. H. Papadimitriou, Searching and pebbling, Theoretical Computer Science, vol.47, issue.2, pp.205-218, 1986.

]. N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, C. H. Papadimitriou et al., The complexity of searching a graph [66] P. Scheffler. A linear algorithm for the pathwidth of trees The vertex separation number of a graph equals its pathwidth The vertex separation and search number of a graph Obstruction set isolation for the gate matrix layout problem, Topics in Combinatorics and Graph Theory, pp.18-44, 1988.

H. L. Bodlaender71-]-h, T. Bodlaender, and . Kloks, A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth, Surveys in Combinatorics, pp.1305-1317358, 1996.
DOI : 10.1137/S0097539793251219

]. R. Govindan, M. A. Langston, and X. Yan, Approximating the pathwidth of outerplanar graphs, Information Processing Letters, vol.68, issue.1, pp.17-23, 1998.
DOI : 10.1016/S0020-0190(98)00139-2

H. Röhrig, Tree decomposition : A feasibility study. Master's thesis, Max-Planck-Institut fur Informatik, 1998.

U. Feige, D. Peleg, and G. Kortsarz, The Dense k -Subgraph Problem, Algorithmica, vol.29, issue.3, pp.410-421, 2001.
DOI : 10.1007/s004530010050

H. L. Bodlaender, F. V. Fomin, J. Díaz, J. Petit, and M. Serna, Approximation of pathwidth of outerplanar graphs A survey on graph layout problems, J. Algorithms ACM Computing Surveys, vol.43, issue.343, pp.190-200313, 2002.

B. Bui-xuan, A. Ferreira, and A. Jarry, COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS, International Journal of Foundations of Computer Science, vol.14, issue.02, pp.267-285, 2003.
DOI : 10.1142/S0129054103001728
URL : https://hal.archives-ouvertes.fr/inria-00071996

R. G. Downey and C. Mccartin, Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time Online problems, pathwidth, and persistence, International Workshop on Parameterized and Exact Computation (IWPEC), volume 3162 of Lecture Notes in Computer Science, pp.91-9940, 2003.

]. J. Barát, Directed Path-width and Monotonicity in Digraph Searching, Graphs and Combinatorics, vol.22, issue.2, pp.161-172, 2006.
DOI : 10.1007/s00373-005-0627-y

F. V. Fomin and D. M. Thilikos, On self duality of pathwidth in polyhedral graph embeddings Mineurs de graphes, stratégies connexes et approches distribuées, Monotonicity of strong searching on digraphs, pp.42-54411, 2007.

O. Amini, D. Peleg, S. Perennes, I. Sau, and S. Saurabh, Degree-Constrained Subgraph Problems: Hardness and Approximation Results, 6th Workshop on Approximation and Online Algorithms (WAOA), pp.29-42, 2008.
DOI : 10.2307/1969046
URL : https://hal.archives-ouvertes.fr/inria-00331747

O. Amini, I. Sau, S. Saurabh-fomin, and D. M. Thilikos, Parameterized complexity of the smallest degree-constrained subgraph problem An annotated bibliography on guaranteed graph searching [90] M. Markov. On the vertex separation of maximal outerplanar graphs, Cao. Digraph searching, pp.13-29236, 2008.

B. Yang, Y. Cao93, ]. O. Amini, F. Huc, S. Pérennes et al., Monotonicity in digraph search problems On the pathwidth of planar graphs Nondeterministic graph searching : From pathwidth to treewidth, Theoretical Compututer Science SIAM Journal of Discrete Mathematics Algorithmica, vol.40795, issue.2333, pp.532-5441311, 2008.

R. Mihai and I. Todinca, Pathwidth is NP-Hard for Weighted Trees, 3rd International Workshop on Frontiers in Algorithmics (FAW), pp.181-195, 2009.
DOI : 10.1137/0602010
URL : https://hal.archives-ouvertes.fr/hal-00462314

I. Sau and D. M. Thilikos, Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs, DIMAP workshop on Algorithmic Graph Theory (AGT09) Cao. Standard directed search strategies and their applications, pp.59-66378, 2009.
DOI : 10.1016/j.endm.2009.02.009

J. Bermond, D. M. Sotteau99-]-r, J. Wilson, J. Bermond, J. Schonheim et al., Congressus Numerantium 15 Utilitas math. Pub Decomposition of complete graphs into subgraphs isomorphic to a given graph G-decomposition of K n where G has four vertices or less Decomposition of complete graphs into isomorphic subgraphs with five vertices Decompositions of edge-colored complete graphs A survey on the existence of G-designs, 5th British Combinatorial conference Congressus numerantium Ars Combinatoria Handbook of Combinatorial Designs. Chapman & Hall/CRC, pp.53-72647, 1975.

?. Graphes-Étiquetés, ?. R. Chang, and S. Leu, The minimum labeling spanning trees, Information Processing Letters, vol.63, issue.1065, pp.277-282, 1997.

H. Wirth, Multicriteria Approximation of Network Design and Network Upgrade Problems Bayerische Julius-Maximilians, Xu. A note on the minimum label spanning tree, pp.99-101, 2001.

]. R. Cerulli, P. Dell-'olmo, M. Gentili, and A. Raiconi, Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem, Electronic Notes in Discrete Mathematics, vol.25, pp.131-138, 2006.
DOI : 10.1016/j.endm.2006.06.080

R. Cerulli, A. Fink, M. Gentili, and S. Voß, Extensions of the minimum labelling spanning tree problem, Journal of Telecommunications and Information Technology, vol.4111, pp.39-45, 2006.

R. Hassin, J. Monnot, D. Segev, R. Hassin, J. Monnot et al., Approximation algorithms and hardness results for??labeled connectivity problems, 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 07, pp.437-453, 2007.
DOI : 10.1007/s10878-007-9044-x

B. Couëtoux, L. Gourvès, J. Monnot, and O. A. Telelis, On Labeled Traveling Salesman Problems, 19th International Symposium on Algorithms and Computation (ISAAC), pp.776-787, 2008.
DOI : 10.1007/978-3-540-92182-0_68

]. F. Carrabs, R. Cerulli, M. Gentili, R. Cerulli, A. Fink et al., The labeled maximum matching problem, Computers & Operations Research, vol.36, issue.6, pp.1859-1871, 2005.
DOI : 10.1016/j.cor.2008.05.012

R. Cerulli, A. Fink, M. Gentili, and S. Voß, Extensions of the minimum labelling spanning tree problem, Journal of Telecommunications and Information Technology

]. P. Zhang, J. Cai, L. Tang, and W. Zhao, Approximation and hardness results for label cut and related problems, Journal of Combinatorial Optimization

?. Groupage-de-trafic, ?. O. Gerstel, P. J. Lin, and G. Sasaki, Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks, IEEE INFOCOM, pp.94-1012, 1998.

R. Dutta and N. Rouskas, A survey of virtual topology design algorithms for wavelength routed optical networks, Optical Networks, vol.1, issue.1, pp.73-89, 2000.

]. L. Liu, X. Li, P. Wan, O. Frieder, P. Wan et al., Wavelength assignment in a WDM rings to minimize SONET ADMs Grooming of arbitrary traffic in SONET/WDM BLSRs, INFOCOM'2000, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Tel-Aviv, Israel Minimzing drop cost for SONET/WDM networks with 1 8 wavelength requirements. Networks, pp.1020-10251995, 2000.

G. C?linescu, O. Frieder, and P. Wan, Minimizing electronic line terminals for automatic ring protection in general WDM optical networks, IEEE Journal on Selected Areas in Communications, vol.20, issue.1, pp.183-189, 2002.
DOI : 10.1109/49.974672

R. Dutta and N. Rouskas, Traffic grooming in WDM networks: past and future, IEEE Network, vol.16, issue.6, pp.46-56, 2002.
DOI : 10.1109/MNET.2002.1081765

]. T. Eilam, S. Moran, and S. Zaks, Lightpath arrangement in survivable rings to minimize the switching cost, IEEE Journal on Selected Areas in Communications, vol.20, issue.1, pp.172-182, 2002.
DOI : 10.1109/49.974671

J. Q. Hu, Optimal traffic grooming for wavelength-division-multiplexing rings with all-to-all uniform traffic Traffic grooming in WDM networks with multi-layer switches, 129] G. Huiban, S. Pérennes, and M. Syska IEEE International Conference on Communication (ICC), pp.32-42, 2002.

K. Zhu and B. Mukherjee, A review of traffic grooming in WDM optical networks : Architectures and challenges, SPIE Optical Networks Magazine Bermond and S. Ceroi. Minimizing SONET ADMs in unidirectional WDM ring with grooming ratio 3. Networks, pp.55-64, 2002.

]. O. Goldschmidt, D. Hochbaum, A. Levin, and E. Olinick, The SONET edge-partition problem, Networks, vol.46, issue.1, pp.13-23, 2003.
DOI : 10.1002/net.10054

K. Zhu and B. Mukherjee, A review of traffic grooming in WDM optical networks : Architectures and challenges, Optical Networks Magazine, pp.55-64, 2003.

J. Bermond, C. J. Colbourn, A. Ling, M. Y. Chow, P. J. Lin et al., Grooming in unidirectional rings : K 4 ? e designs Discrete Mathematics, Lindner's Volume The Ring Grooming Problem Better bounds for minimizing SONET ADMs A 10/7 + approximation scheme for minimizing the number of ADMs in SONET rings, 2nd Workshop on Approximation and Online Algorithms (WAOA) First Annual International Conference on Broadband Networks, pp.57-62194, 2004.

M. Flammini, L. Moscardelli, M. Shalom, and S. Zaks, Approximating the Traffic Grooming Problem, 16th Annual International Conference on Algortihms and Computation (ISAAC), pp.915-924, 2005.
DOI : 10.1007/11602613_91

A. Gumaste and S. Q. Zheng, Next-generation optical storage area networks: the light-trails approach, IEEE Communications Magazine, vol.43, issue.3, pp.72-78, 2005.
DOI : 10.1109/MCOM.2005.1404598

L. Chen, E. Modiano, and P. Saengudomlert, Uniform versus non-uniform band switching in WDM networks, Computer Networks, vol.50, issue.2, pp.149-167, 2006.
DOI : 10.1016/j.comnet.2005.05.017

]. S. Huang, R. Dutta, and G. N. Rouskas, Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms, IEEE Journal on Selected Areas in Communications, vol.24, issue.4, pp.66-82, 2006.
DOI : 10.1109/JSAC.2006.1613773

Y. Wang and Q. Gu, Grooming of Symmetric Traffic in Unidirectional SONET/WDM Rings, 2006 IEEE International Conference on Communications, pp.2407-2414, 2006.
DOI : 10.1109/ICC.2006.255130

]. Y. Ye, H. Woesner, I. Chlamtac144, ]. O. Amini, S. Pérennes et al., Waveband switching in light trail optical networks with dynamic traffic Hardness and approximation of traffic grooming, 18th International Symposium on Algorithms and Computation (ISAAC), pp.561-573, 2006.

Y. Brehon, D. Kofman, M. Pioro, M. Diallo-cao, V. Anand et al., Waveband switching for dynamic traffic demands in multigranular optical networks On the complexity of the traffic grooming problem in optical networks Optimal on-line colorings for minimizing the number of ADMs in optical networks, Optimal virtual topology design using buslabel switched paths 4th International Conference on Fun With Algorithms (FUN) 21st International Symposium on Distributed Computing (DISC). Fabregat, and J-L. Marzo. G+ : Enhanced traffic grooming in WDM mesh networks using lighttours. IEEE Journal on Selected Areas in Communications, pp.1001-1010, 2007.

J. Zheng, J. P. Jue152-]-c, G. Colbourn, V. R. Quattrocchi, . J. Syrotiuk153-]-c et al., Grooming for two-period optical networks Lower bounds for two-period grooming via linear programming duality Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio seven On-line distributed traffic grooming [156] X. Muñoz and I. Sau. Traffic grooming in unidirectional WDM rings with bounded-degree request graph On the complexity and algorithm of grooming regular traffic in WDM optical networks Optical grooming with grooming ratio 9. preprint Optical grooming with grooming ratio eight Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph, Waveband switching, routing, and grooming : introduction to the feature issue. OSA Journal of Optical Networking IEEE International Conference on Communication (ICC) 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG) 35th International Workshop on Graph-Theoretic Concepts in Computer Science Best student paper award. [161] I. Sau. Optimization in Graphs under Degree Constraints with Application to Telecommunication Networks162] M. Shalom, P. Wong, and S. Zaks. Optimal on-line colorings for minimizing the number of ADMs in optical networks Traffic Grooming for Optical Networks : Foundations, Techniques and Frontiers. Optical Networks, pp.217-218307, 2007.

A. Somani, Survivability & Traffic Grooming in WDM Optical Networks, 2006.
DOI : 10.1017/CBO9780511616105

]. K. Zhu, H. Zhu, and B. Mukherjee, Traffic grooming in an optical WDM mesh network, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240), 2005.
DOI : 10.1109/ICC.2001.937334

J. Suurballe and R. Tarjan, A quick method for finding shortest pairs of disjoint paths, Networks, vol.3, issue.2, pp.325-336, 1984.
DOI : 10.1002/net.3230140209

W. D. Grover and D. Stamatelakis, Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220), pp.537-543, 1998.
DOI : 10.1109/ICC.1998.682929

D. Papadimitriou, F. Poppe, J. Jones, S. Venkatachalam, S. Dharanikota et al., Inference of shared risk link groups, IETF Draft, Internet Working Group, 2001.

D. Papadimitriou, F. Poppe, S. Dharanikota, R. Hartani, R. Jain et al., Shared risk link groups encoding and processing, IETF Draft, 2002.

J. Q. Hu, Diverse routing in mesh optical networks, IEEE Transactions on Communications, vol.51, issue.3, pp.489-494, 2003.

D. Papadimitriou, F. Poppe, S. Dharanikota, R. Hartani, R. Jain et al., Shared risk link groups inference and processing, IETF Draft, 2003.

]. H. Zang, C. Ou, and B. Mukherjee, Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints, IEEE/ACM Transactions on Networking, vol.11, issue.2, pp.248-258, 2003.
DOI : 10.1109/TNET.2003.810313

P. Datta, A. K. Somani, X. Luo, and B. Wang, Diverse routing for shared risk resource groups (SRRG) failures in WDM optical networks Diverse routing in WDM optical networks with shared risk link group (srlg) failures, Proceedings of IEEE BroadNets 5th International Workshop on Design of Reliable Communication Networks ? DRCN, pp.120-129, 2004.

L. Shen, X. Yang, B. Ramamurthy, S. Yuan, S. Varma et al., Shared risk link Group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks, IEEE InfoCom, pp.918-931, 2005.
DOI : 10.1109/TNET.2005.852879

J. K. Choi and D. Guha, Fast end-to-end restoration mechanism with srlg using centralized control. IETF Draft, Network Working Group, 2006.

]. A. Faragó, A graph theoretic model for complex network failure scenarios, Proceedings of the Eighth INFORMS Telecommunications Conference, 2006.

X. Luo and B. Wang, Multi-constrained routing in networks with shared risk link groups, IEEE BroadNets, 2006.

M. Voge, How to Transform a Multilayer Network into a Colored Graph, 2006 International Conference on Transparent Optical Networks, pp.116-119, 2006.
DOI : 10.1109/ICTON.2006.248415

P. Datta, A. K. Somani, S. Orlowski, and M. Pióro, Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures, Computer Networks, vol.52, issue.12, pp.2381-2394, 2008.
DOI : 10.1016/j.comnet.2008.04.017

S. Stefanakos, Reliable Routings in Networks With Generalized Link Failure Events, IEEE/ACM Transactions on Networking, vol.16, issue.6, pp.1331-1339, 2008.
DOI : 10.1109/TNET.2007.911435

M. S. Kiaei, C. Assi, B. Jaumard, S. Orlowski, and M. Pióro, A survey on the p-cycle protection method On the complexity of column generation in survivable network design with path-based survivability concepts, Proceedings of the 4th International Network Optimization Conference, pp.53-70, 2009.

]. R. Bhandari, Survivable Networks : Algorithms for Diverse Routing Kluwer Academic, 189] A. Tomaszewski, M. Pióro, and M. Zotkiewicz. On the complexity of resilient network design. Networks, 1999.

?. Reroutage and ?. M. Ackroyd, Call repacking in connecting networks, IEEE Transactions on Communications, vol.27, issue.3, pp.589-591, 1979.

]. P. Labourdette, G. W. Hart, and A. S. Acampora, Branch-exchange sequences for reconfiguration of lightwave networks, IEEE Transactions on Communications, vol.42, issue.10, pp.2822-2832, 1994.
DOI : 10.1109/26.328952

]. K. Bala, G. Ellinas, M. Post, C. Shen, J. Wei et al., Towards hitless reconfiguration in WDM optical networks for ATM transport, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference, pp.316-320, 1996.
DOI : 10.1109/GLOCOM.1996.594381

]. Lee and V. O. Li, A wavelength rerouting algorithm in wide-area all-optical networks, Journal of Lightwave Technology, vol.14, issue.6, pp.1218-1229, 1996.
DOI : 10.1109/50.511623

]. G. Mohan and C. S. Murthy, A time optimal wavelength rerouting algorithm for dynamic traffic in WDM networks, Journal of Lightwave Technology, vol.17, issue.3, pp.406-417, 1999.
DOI : 10.1109/50.749380

]. E. Wong, A. K. Chan, and T. P. Yum, A taxonomy of rerouting in circuit-switched networks, IEEE Communications Magazine, vol.37, issue.11, pp.116-122, 1999.
DOI : 10.1109/35.803660

]. D. Banerjee, B. W. Mukherjee-]-e, A. K. Wong, T. P. Chan, and . Yum, Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study, IEEE/ACM Transactions on Networking, vol.8, issue.5, pp.598-607419, 2000.
DOI : 10.1109/90.879346

]. S. Beker, D. Kofman, and N. Puech, Off-line MPLS layout design and reconfiguration : Reducing complexity under dynamic traffic conditions, International Network Optimization Conference (INOC), pp.61-66, 2003.

]. A. Gencata and B. Mukherjee, Virtual-topology adaptation for WDM mesh networks under dynamic traffic, IEEE/ACM Transactions on Networking, vol.11, issue.2, pp.236-247, 2003.
DOI : 10.1109/TNET.2003.810319

]. N. Jose and A. K. Somani, Connection rerouting/network reconfiguration, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings., pp.23-30, 2003.
DOI : 10.1109/DRCN.2003.1275334

B. G. Józsa, M. Makai, S. Beker, N. Puech, and V. Friderikos, On the solution of reroute sequence planning problem in MPLS networks A tabu search heuristic for the off-line MPLS reduced complexity layout design problem, 3rd International IFIP-TC6 Networking Conference (Networking ), pp.199-210, 2003.

W. Golab and R. Boutaba, Policy-driven automated reconfiguration for performance management in WDM optical networks, IEEE Communications Magazine, vol.42, issue.1, pp.44-51, 2004.
DOI : 10.1109/MCOM.2004.1262161

]. M. Saad and Z. Luo, Reconfiguration with no service disruption in multifiber WDM networks, Journal of Lightwave Technology, vol.23, issue.10, pp.3092-3104, 2005.
DOI : 10.1109/JLT.2005.856152

X. Chu, T. Bu, X. Li, J. Y. Zhang, O. W. Yang et al., A study of lightpath rerouting schemes in wavelength-routed WDM networks Optimization of semi-dynamic lightpath rearrangements in a WDM network Rerouting tunnels for MPLS network resource optimization Tradeoff between the number of agents and the number of rounds of a process strategy. Master's thesis, Stage pré-doctoral Analyzing two different objectives of the WDM network reconfiguration problem A mixed-integer programing formulation for the lightpath reconfiguration problem Optimizing maximum disruption during reconfiguration of lightpaths, IEEE Global Communications Conference (Globecom) VIII Workshop on G/MPLS Networks (WGN8) 16th Polish Teletraffic Symposium (PTS), pp.2400-24053, 2007.

?. Routage-dans-les-réseaux-optiques and ?. , WDM-based local lightwave networks ? Part I : Single-hop systems WDM-based local lightwave networks ? Part II : Multi-hop systems, 214] B. Beauquier. Communications dans les réseaux optiques par multiplexage en longueur d'onde, pp.12-2720, 1992.

H. Rivano, F. Ramos, E. Kehayas, J. M. Martinez, R. Clavero et al., IST-LASAGNE : Towards all-optical label swapping employing optical logic gates and optical flip-flops From IP over WDM to all-optical packet switching : Economical overview, Algorithmique et télécommunications : coloration et multiflot approchés et applications aux réseaux d'infrastructure218] B. Jaumard, C. Meyer, and B. Thiongane. Comparison of ILP formulations for the RWA problem. Optical Switching and Networking, pp.2993-30111638, 2003.

?. Autre, ?. Thorup, and U. Zwick, Compact routing schemes, SPAA 2001 : Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp.1-10, 2001.

Q. Jiang, D. S. Reeves, P. Ning-]-i, C. Abraham, D. Gavoille et al., Improving robustness of PGP keyrings by conflict detection Compact name-independent routing with minimum stretch, Proceedings of the RSA Conference Cryptographers' Track (CT-RSA2004) Estan, D. Tsiang, and S. Wright. Power awareness in network design and routing. In INFOCOM, pp.194-207, 2004.