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

D. Crass, I. Suzuki, and M. Yamashita, SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR ???THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM, International Journal of Computational Geometry & Applications, vol.05, issue.04, pp.397-412, 1995.
DOI : 10.1142/S0218195995000246

A. Drogoul and S. Picault, the MICRobES project, an experimental approach towards open collective robotics, Proceedings of the 5th International Symposium on Distributed Autonomous Robotic Systems, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00860323

B. Gerkey, S. Thrun, and G. Gordon, Visibility-based Pursuit-evasion with Limited Field of View, Proceedings of the National Conference on Artificial Intelligence, 2004.
DOI : 10.1177/0278364906065023

L. Guibas, J. C. Latombe, S. M. Lavalle, D. Lin, and R. Motwani, A VISIBILITY-BASED PURSUIT-EVASION PROBLEM, International Journal of Computational Geometry & Applications, vol.09, issue.04n05, pp.471-493, 1999.
DOI : 10.1142/S0218195999000273

P. C. Heffernan, An optimal algorithm for the two guards problem, Proceedings of ACM Symposium on Computational Geometry, pp.348-358, 1993.

C. Icking and R. Klein, The two guards problem, Proceedings of ACM Symposium on Computational Geometry, pp.166-175, 1991.

S. Lang and B. Y. Chee, Coordination of behaviours for mobile robot floor cleaning, Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190), pp.1236-1241, 1998.
DOI : 10.1109/IROS.1998.727468

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

S. M. Lavalle and J. Hinrichnsen, Visibility-based pursuit-evasion: The case of curved environments, Proc. IEEE International Conference on Robotics and Automation, 1999.

S. M. Lavalle, D. Lin, L. J. Guibas, J. C. Latombe, and R. Motwani, Finding an unpredictable target in a workspace with obstacles, Proceedings of International Conference on Robotics and Automation, pp.737-742, 1997.
DOI : 10.1109/ROBOT.1997.620123

J. H. Lee, S. M. Park, and K. Y. Chwa, SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER, International Journal of Computational Geometry & Applications, vol.10, issue.02, pp.201-220, 2000.
DOI : 10.1142/S0218195900000127

R. Levy and J. S. Rosenschein, A game theoretic approach to distributed artificial intelligence and the pursuit problem (abstract), ACM SIGOIS Bulletin, vol.13, issue.3, p.11, 1992.
DOI : 10.1145/152683.152692

B. Monien and I. H. Sudborough, Min cut is NP-complete for edge weighted trees, Theoretical Computer Science, vol.58, issue.1-3, pp.209-229, 1988.
DOI : 10.1016/0304-3975(88)90028-X
URL : http://doi.org/10.1016/0304-3975(88)90028-x

T. D. Parsons, Poursuit-evasion in a graph, Theory and Application of Graphs, pp.426-441, 1976.

S. Rajko and M. Lavalle, A pursuit-evasion BUG algorithm, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 2001.
DOI : 10.1109/ROBOT.2001.932894
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.200

S. Sachs, S. Lavalle, and S. Rajko, Visibility-Based Pursuit-Evasion in an Unknown Planar Environment, The International Journal of Robotics Research, vol.23, issue.1, pp.3-26, 2004.
DOI : 10.1177/0278364904039610

I. Suzuki and M. Yamashita, Searching for a Mobile Intruder in a Polygonal Region, SIAM Journal on Computing, vol.21, issue.5, pp.863-888, 1992.
DOI : 10.1137/0221051

R. Vidal, S. Rashid, C. Sharp, O. Shakernia, J. Kim et al., Pursuit-evasion games with unmanned ground and aerial vehicles, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 2001.
DOI : 10.1109/ROBOT.2001.933069
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.4822