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.

P. [. Barrì-ere, N. Fraigniaud, D. Santoro, and . Thilikos, Connected and Internal Graph Searching, 29th Workshop on Graph Theoretic Concepts in Computer Science (WG), pp.34-45, 2003.

P. [. Blin, N. Fraigniaud, S. Nisse, and . 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

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

[. Nisse and D. Soguet, Graph searching with advice ? [Par76] T. Parsons. Pursuit-evasion in a graph, 14th Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.51-67, 1976.