On bridged graphs and cop-win graphs, Journal of Combinatorial Theory, Series B, vol.44, issue.1, pp.22-28, 1988. ,
DOI : 10.1016/0095-8956(88)90093-7
A game of cops and robbers, Discrete Applied Mathematics, vol.8, issue.1, pp.1-12, 1984. ,
DOI : 10.1016/0166-218X(84)90073-8
Searching and sweeping graphs: a brief survey, Le Matematiche, vol.59, pp.5-37, 2004. ,
On a pursuit game played on graphs for which a minor is excluded, Journal of Combinatorial Theory, Series B, vol.41, issue.1, pp.37-47, 1986. ,
DOI : 10.1016/0095-8956(86)90026-2
A Helly theorem in weakly modular space, Discrete Mathematics, vol.160, issue.1-3, pp.25-39, 1996. ,
DOI : 10.1016/0012-365X(95)00217-K
Metric graph theory and geometry: a survey, Surveys on Discrete and Computational Geometry . Twenty Years later, pp.49-86, 2008. ,
DOI : 10.1090/conm/453/08795
Absolute reflexive retracts and absolute bipartite retracts, Discrete Applied Mathematics, vol.44, issue.1-3, pp.9-20, 1993. ,
DOI : 10.1016/0166-218X(93)90219-E
Survival of the weak in hyperbolic spaces, a remark on competition and geometry, Proc. Amer, pp.723-726, 2002. ,
On the Cop Number of a Graph, Advances in Applied Mathematics, vol.14, issue.4, pp.389-403, 1993. ,
DOI : 10.1006/aama.1993.1019
Hypergraphs: Combinatorics of Finite Sets, 1989. ,
Pursuit and evasion from a distance: algorithms and bounds, Proceedings of ANALCO'09 ,
DOI : 10.1137/1.9781611972993.1
Dually Chordal Graphs, SIAM Journal on Discrete Mathematics, vol.11, issue.3, pp.437-455, 1998. ,
DOI : 10.1137/S0895480193253415
Gibbs Measures and Dismantlable Graphs, Journal of Combinatorial Theory, Series B, vol.78, issue.1, pp.415-435, 1999. ,
DOI : 10.1006/jctb.1999.1935
Graphs of Some CAT(0) Complexes, Advances in Applied Mathematics, vol.24, issue.2, pp.125-179, 2000. ,
DOI : 10.1006/aama.1999.0677
Notes on diameters, centers, and approximating trees of ??-hyperbolic geodesic spaces and graphs, Symposium on Computational Geometry, pp.59-68, 2008. ,
DOI : 10.1016/j.endm.2008.06.046
A better bound for the cop number of general graphs, Journal of Graph Theory, vol.38, issue.1, pp.45-48, 2008. ,
DOI : 10.1002/jgt.20291
A witness version of the Cops and Robber game, Discrete Mathematics, vol.309, issue.10, pp.3292-3298, 2009. ,
DOI : 10.1016/j.disc.2008.09.032
On tractability of Cops and Robbers game, 5th Ifip International Conference On Theoretical Computer Science, pp.171-185, 2008. ,
DOI : 10.1007/978-0-387-09680-3_12
Pursuing a fast robber on a graph, Theoretical Computer Science, vol.411, issue.7-9 ,
DOI : 10.1016/j.tcs.2009.12.010
URL : https://hal.archives-ouvertes.fr/inria-00476686
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
Hyperbolic Groups, MSRI Series, pp.75-263, 1987. ,
DOI : 10.1007/978-1-4613-9586-7_3
Complexes simpliciaux hyperboliques de grande dimension, Prepublication Orsay, vol.71, p.32, 2003. ,
Graphs and Homomorphisms, 2004. ,
DOI : 10.1093/acprof:oso/9780198528173.001.0001
Simplicial nonpositive curvature, Publications math??matiques de l'IH??S, vol.104, issue.1, pp.1-85, 2006. ,
DOI : 10.1007/s10240-006-0038-5
Randomized Pursuit-Evasion with Local Visibility, SIAM Journal on Discrete Mathematics, vol.20, issue.1, pp.26-41, 2006. ,
DOI : 10.1137/S0895480104442169
Memoryless Determinacy of Parity Games, Automata, Logics, and Infinite Games: A Guide to Current Research, pp.95-106, 2002. ,
DOI : 10.1007/3-540-36387-4_6
Fast Robber in Planar Graphs, Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.312-323, 2008. ,
DOI : 10.1016/0095-8956(85)90093-0
URL : https://hal.archives-ouvertes.fr/inria-00423451
Vertex-to-vertex pursuit in a graph, Discrete Mathematics, vol.43, issue.2-3, pp.235-239, 1983. ,
DOI : 10.1016/0012-365X(83)90160-7
Probì emes de jeux, de point fixe, de connectivité et de représentation sur des graphes, des ensembles ordonnés et des hypergraphes, Thèse de doctorat d'´ etat, 1983. ,
A short note about pursuit games played on a graph with a given genus, Journal of Combinatorial Theory, Series B, vol.38, issue.1, pp.89-92, 1985. ,
DOI : 10.1016/0095-8956(85)90093-0
The Copnumber of a Graph is Bounded by [3/2 genus (G)] + 3, Mathematics, pp.243-263, 2001. ,
DOI : 10.1007/978-1-4612-1370-3_14
The cops and robber game on series-parallel graphs, 2008. ,
route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4, 2004. ,
Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex ,
BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399 ,