M. Ackroyd, Call Repacking in Connecting Networks, IEEE Transactions on Communications, vol.27, issue.3, pp.589-591, 1979.
DOI : 10.1109/TCOM.1979.1094428

D. Banerjee and B. Mukherjee, Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study, IEEE/ACM Transactions on Networking, vol.8, issue.5, pp.598-607, 2000.
DOI : 10.1109/90.879346

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.3906

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

S. Beker, N. Puech, and V. Friderikos, A Tabu Search Heuristic for the Offline MPLS Reduced Complexity Layout Design Problem, IFIP-TC6 Networking Conference (Networking), pp.514-525, 2004.
DOI : 10.1007/978-3-540-24693-0_43

D. Bienstock, N. Robertson, P. Seymour, and R. Thomas, Quickly excluding a forest, Journal of Combinatorial Theory, Series B, vol.52, issue.2, pp.274-283, 1991.
DOI : 10.1016/0095-8956(91)90068-U

URL : http://doi.org/10.1016/0095-8956(91)90068-u

H. L. Bodlaender, A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth, SIAM Journal on Computing, vol.25, issue.6, pp.1305-1317, 1996.
DOI : 10.1137/S0097539793251219

X. Chu, T. Bu, and X. Li, A Study of Lightpath Rerouting Schemes in Wavelength-Routed WDM Networks, 2007 IEEE International Conference on Communications, pp.2400-2405, 2007.
DOI : 10.1109/ICC.2007.403

T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, 1990.

D. Coudert, F. Huc, D. Mazauric, N. Nisse, and J. Sereni, Reconfiguration of the routing in WDM networks with two classes of services, 13th Conference on Optical Network Design and Modeling (ONDM), 2009.
URL : https://hal.archives-ouvertes.fr/inria-00423453

D. Coudert, S. Pérennes, Q. Pham, and J. Sereni, Rerouting requests in wdm networks, InSeptì emes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05) Presqu'? ?le de Giens, pp.17-20, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00429173

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

N. Deo, S. Krishnamoorthy, and M. A. Langston, Exact and Approximate Solutions for the Gate Matrix Layout Problem, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.6, issue.1, pp.79-84, 1987.
DOI : 10.1109/TCAD.1987.1270248

V. Fedor, D. M. Fomin, and . Thilikos, An annotated bibliography on guaranteed graph searching, Theoretical Computer Science, vol.399, issue.3, pp.236-245, 2008.

M. Garey and D. Johnson, Computers and Intractability: A Guide to the theory of NPcompleteness, Freeman NY, 1979.

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ábor, J. , and M. Makai, On the solution of reroute sequence planning problem in MPLS networks, Computer Networks, vol.42, issue.2, pp.199-210, 2003.

N. G. Kinnersley, The vertex separation number of a graph equals its path-width, Information Processing Letters, vol.42, issue.6, pp.345-350, 1992.
DOI : 10.1016/0020-0190(92)90234-M

N. G. Kinnersley and M. A. Langston, Obstruction set isolation for the gate matrix layout problem, Discrete Applied Mathematics, vol.54, issue.2-3, pp.169-213, 1994.
DOI : 10.1016/0166-218X(94)90021-3

O. Klopfenstein, Rerouting tunnels for MPLS network resource optimization, European Journal of Operational Research, vol.188, issue.1, pp.293-312, 2008.
DOI : 10.1016/j.ejor.2007.04.016

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

N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou, The complexity of searching a graph, Journal of the ACM, vol.35, issue.1, pp.18-44, 1988.
DOI : 10.1145/42267.42268

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

N. Robertson and P. D. Seymour, Graph minors. I. Excluding a forest, Journal of Combinatorial Theory, Series B, vol.35, issue.1, pp.39-61, 1983.
DOI : 10.1016/0095-8956(83)90079-5

URL : http://doi.org/10.1006/jctb.1999.1919

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

B. K. Rosen, Robust linear algorithms for cutsets, Journal of Algorithms, vol.3, issue.3, pp.205-217, 1982.
DOI : 10.1016/0196-6774(82)90020-7

J. Sereni, Colorations de graphes et applications, 2006.
URL : https://hal.archives-ouvertes.fr/tel-00120594

P. D. Seymour and R. Thomas, Graph Searching and a Min-Max Theorem for Tree-Width, Journal of Combinatorial Theory, Series B, vol.58, issue.1, pp.22-33, 1993.
DOI : 10.1006/jctb.1993.1027

A. Shamir, A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs, SIAM Journal on Computing, vol.8, issue.4, pp.645-655, 1979.
DOI : 10.1137/0208051

E. W. 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

E. W. Wong, A. K. Chan, and T. P. Yum, Analysis of rerouting in circuit-switched networks, IEEE/ACM Transactions on Networking, vol.8, issue.3, pp.419-427, 2000.
DOI : 10.1109/90.851987

J. Y. Zhang, O. W. Yang, J. Wu, and M. Savoie, Optimization of Semi-Dynamic Lightpath Rearrangements in a WDM Network, IEEE Journal on Selected Areas in Communications, vol.25, issue.9, pp.3-17, 2007.
DOI : 10.1109/JSAC-OCN.2007.026106