L. Barrì-ere, P. Flocchini, P. Fraigniaud, and N. Santoro, Capture of an intruder by mobile agents, 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp.200-209, 2002.

D. Bienstock, Graph searching, path-width, tree-width and related problems (a survey) DIMACS Ser, Discrete Mathematics and Theoretical Computer Science, pp.33-49, 1991.

D. Bienstock and P. Seymour, Monotonicity in graph searching, Journal of Algorithms, vol.12, issue.2, pp.239-245, 1991.
DOI : 10.1016/0196-6774(91)90003-H

L. Blin, P. Fraigniaud, N. Nisse, and S. Vial, Distributing Chasing of Network Intruders, 13th Colloquium on Structural Information and Communication Complexity, pp.70-84, 2006.

P. Flocchini, F. L. Luccio, and L. Song, Decontamination of chordal rings and tori, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006.
DOI : 10.1109/IPDPS.2006.1639545

P. Flocchini, M. J. Huang, and F. L. Luccio, Contiguous Search in the Hypercube for Capturing an Intruder, 19th IEEE International Parallel and Distributed Processing Symposium, 2005.
DOI : 10.1109/IPDPS.2005.151

P. Fraigniaud, D. Ilcinkas, and A. Pelc, Oracle size, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.179-187, 2006.
DOI : 10.1145/1146381.1146410
URL : https://hal.archives-ouvertes.fr/hal-00339854

A. 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. Hakimi, M. Garey, D. Johnson, and C. 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. Parson, Pursuit-evasion in a graph Theory and Applications of Graphs, Lecture Notes in Mathematics, pp.426-441, 1976.