V. Bafna, P. Berman, and T. Fujito, A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem, SIAM Journal on Discrete Mathematics, vol.12, issue.3, pp.289-297, 1999.
DOI : 10.1137/S0895480196305124

R. L. Breisch, An intuitive approach to speleotopology. Southwestern Cavers, pp.72-78, 1967.

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and N. Nisse, Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration Problem, Fifth International conference on Fun with Algorithms, pp.121-132, 2010.
DOI : 10.1007/978-3-642-13122-6_14
URL : https://hal.archives-ouvertes.fr/inria-00495443

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

D. Coudert, F. Huc, D. Mazauric, N. Nisse, and J. Sereni, Routing reconfiguration/process number: Coping with two classes of services, 13th Conference on Optical Network Design and Modeling (ONDM), pp.1-6, 2009.

D. Coudert, S. Perennes, Q. Pham, and J. Sereni, Rerouting requests in WDM networks, 7` eme Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algo- Tel'05), pp.17-20, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00429173

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

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

J. Díaz, J. Petit, and M. Serna, A survey of graph layout problems, ACM Computing Surveys, vol.34, issue.3, pp.313-356, 2002.
DOI : 10.1145/568522.568523

J. A. Ellis, I. H. Sudborough, and J. S. Turner, The Vertex Separation and Search Number of a Graph, Information and Computation, vol.113, issue.1, pp.50-79, 1994.
DOI : 10.1006/inco.1994.1064

G. Even, J. Naor, B. Schieber, and M. Sudan, Approximating Minimum Feedback Sets and Multicuts in Directed Graphs, 4th International Integer Programming and Combinatorial Optimization Conference (IPCO), pp.14-28, 1995.
DOI : 10.1007/PL00009191

F. Fomin and D. Thilikos, An annotated bibliography on guaranteed graph searching, Theoretical Computer Science, vol.399, issue.3, pp.236-245, 2008.
DOI : 10.1016/j.tcs.2008.02.040
URL : http://doi.org/10.1016/j.tcs.2008.02.040

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

V. Kann, On the Approximability of NP-complete Optimization Problems Department of Numerical Analysis and Computing Science, Royal Institute of Technology, 1992.

M. Kirousis and C. H. Papadimitriou, Searching and pebbling, Theoretical Computer Science, vol.47, issue.2, pp.205-218, 1986.
DOI : 10.1016/0304-3975(86)90146-5
URL : http://doi.org/10.1016/0304-3975(86)90146-5

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

T. D. Parsons, Pursuit-evasion in a graph, Theory and applications of graphs, pp.426-441, 1978.
DOI : 10.1007/BFb0070400

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

F. Solano, Analyzing two different objectives of the WDM network reconfiguration problem, IEEE Global Communications Conference (Globecom), pp.1-7, 2009.

F. Solano and M. Pióro, A mixed-integer programing formulation for the lightpath reconfiguration problem, VIII Workshop on G/MPLS Networks (WGN8), 2009.

F. Solano and M. Pióro, Lightpath Reconfiguration in WDM Networks, Journal of Optical Communications and Networking, vol.2, issue.12, pp.1010-1021, 2010.
DOI : 10.1364/JOCN.2.001010