L. Barrì-ere, P. Fraigniaud, N. Santoro, and D. M. Thilikos, Searching Is Not Jumping, 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.34-45, 2003.
DOI : 10.1007/978-3-540-39890-5_4

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

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. Perennes, Q. Pham, and J. Sereni, Rerouting requests in WDM networks, 7` emes 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

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

F. V. Fomin, P. Fraigniaud, and N. Nisse, Nondeterministic Graph Searching: From Pathwidth to Treewidth, Algorithmica, vol.6, issue.1, pp.358-373, 2009.
DOI : 10.1007/s00453-007-9041-6
URL : https://hal.archives-ouvertes.fr/hal-00421420

F. V. Fomin and D. M. 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

P. A. Golovach, Search number, node search number, and vertex separator of a graph, Vestn. Leningr. Univ., Math, vol.24, issue.1, p.8890, 1991.

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

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

A. S. Lapaugh, Recontamination does not help to search a graph, Journal of the ACM, vol.40, issue.2, pp.224-245, 1993.
DOI : 10.1145/151261.151263

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

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

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

S. Peng, C. Hob, T. Hsu, M. Ko, and C. Y. Tanga, Edge and node searching problems on trees, Theoretical Computer Science, vol.240, issue.2, pp.429-446, 2000.
DOI : 10.1016/S0304-3975(99)00241-8
URL : http://doi.org/10.1016/s0304-3975(99)00241-8

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

P. Scheffler, A Linear Algorithm for the Pathwidth of Trees, Topics in Combinatorics and Graph Theory, pp.613-620, 1990.
DOI : 10.1007/978-3-642-46908-4_70

K. Skodinis, Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time, Journal of Algorithms, vol.47, issue.1, pp.40-59, 2003.
DOI : 10.1016/S0196-6774(02)00225-0