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

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

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 and D. Thilikos, An annotated bibliography on guaranteed graph searching, Theoretical Computer Science, vol.399, issue.3
DOI : 10.1016/j.tcs.2008.02.040

D. Coudert, S. Perennes, Q. Pham, and J. Sereni, Rerouting requests in wdm networks, AlgoTel'05, pp.17-20, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00429173

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

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