P. W. Brendan, A. Ames, R. Beveridge, C. Carlson, V. Djang et al., A leapfrog strategy for pursuit-evasion in a polygonal environment, Int. J. Comput. Geometry Appl, vol.25, issue.2, pp.77-100, 2015.

O. Amini, D. Coudert, and N. Nisse, Non-deterministic graph searching in trees, Theoretical Computer Science, vol.580, pp.101-121, 2015.
DOI : 10.1016/j.tcs.2015.02.038

URL : https://hal.archives-ouvertes.fr/hal-01132032

B. Alspach, D. Dyer, D. Hanson, and B. Yang, Arc Searching Digraphs Without Jumping, Proc. of first int. conf. on Combinatorial Optimization and Applications (COCOA), pp.354-365, 2007.
DOI : 10.1007/978-3-540-73556-4_37

I. Adler, Directed tree-width examples, Journal of Combinatorial Theory, Series B, vol.97, issue.5, pp.718-725, 2007.
DOI : 10.1016/j.jctb.2006.12.006

URL : https://doi.org/10.1016/j.jctb.2006.12.006

S. Saeed-akhoondian-amiri, R. Kreutzer, and . Rabinovich, DAG-width is PSPACE-complete, Theoretical Computer Science, vol.655, issue.59, pp.78-8965, 2004.
DOI : 10.1016/j.tcs.2016.09.011

J. Barát, Directed Path-width and Monotonicity in Digraph Searching, Graphs and Combinatorics, vol.22, issue.2, pp.161-172, 2006.
DOI : 10.1007/s00373-005-0627-y

L. Blin, J. Burman, and N. Nisse, Brief Announcement: Distributed Exclusive and Perpetual Tree Searching, Proc. of 26th International Symposium on Distributed Computing (DISC), pp.403-404, 2012.
DOI : 10.1007/978-3-642-33651-5_29

URL : https://hal.archives-ouvertes.fr/hal-00741982

L. Blin, J. Burman, N. N. , A. Dawar, P. Hunter et al., Exclusive graph searching The dag-width of directed graphs, Algorithmica J. Comb. Theory, Ser. B, vol.77, issue.1024, pp.942-969900, 2012.

P. Borowiecki, D. Dereniowski, and L. Kuszner, Distributed graph searching with a sense of direction, Distributed Computing, pp.155-170, 2015.
DOI : 10.1007/11753728_58

URL : https://link.springer.com/content/pdf/10.1007%2Fs00446-014-0236-1.pdf

L. Hans, F. V. Bodlaender, and . Fomin, Approximation of pathwidth of outerplanar graphs, J. Algorithms, vol.43, issue.2, pp.190-200, 2002.

P. Lalibarrì-ere, F. V. Flocchini, P. Fomin, N. Fraigniaud, N. Nisse et al., Connected graph searching, Inf. Comput, vol.219, pp.1-16, 2012.

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

E. Bfg-+-14-]-darryn, N. Bryant, P. Francetic, D. A. Gordinowicz, P. Pike et al., Brushing without capacity restrictions, Discrete Applied Mathematics, vol.170, pp.33-45, 2014.

L. Hans, F. V. Bodlaender, D. Fomin, E. Lokshtanov, S. Penninkx et al., (meta) kernelization, 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.629-638, 2009.

[. Blin, P. Fraigniaud, N. Nisse, and S. Vial, Distributed chasing of network intruders, Theoretical Computer Science, vol.399, issue.1-2, pp.12-37, 2008.
DOI : 10.1016/j.tcs.2008.02.004

URL : https://hal.archives-ouvertes.fr/hal-01310347

P. Lalibarrì-ere, N. Fraigniaud, D. M. Santoro, and . Thilikos, Searching is not jumping, Proc. of 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.34-45, 2003.

M. J. Best, A. Gupta, D. M. Thilikos, D. Brandenburg, and S. Herrmann, Contraction obstructions for connected graph searching Graph searching and search time [Bie91] Daniel Bienstock. Graph searching, path-width, tree-width and related problems (A survey), 32nd Conference on Current Trends Proc. of Reliability Of Computer And Communication Networks of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp.27-47, 1991.
DOI : 10.1016/j.dam.2015.07.036

URL : http://arxiv.org/pdf/1410.8756

L. Hans, T. Bodlaender, and . Kloks, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, J. Algorithms, vol.21, issue.2, pp.358-402, 1996.

D. Bhadauria, K. Klein, V. Isler, and S. Suri, Capturing an evader in polygonal environments with obstacles: The full visibility case, BLS99] Andreas Brandstädt, pp.1176-1189, 1999.
DOI : 10.1287/mnsc.17.11.712

L. Hans, R. H. Bodlaender, and . Möhring, The pathwidth and treewidth of cographs, SIAM J. Discrete Math, vol.6, issue.2, pp.181-188, 1993.

R. S. Jean, F. Blair, R. Manne, and . Mihai, Efficient self-stabilizing graph searching in tree networks, Proc. of 12th Int. Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp.111-125, 2010.

A. Bonato and R. J. Nowakovski, The game of Cops and Robber on Graphs, 2011.
DOI : 10.1090/stml/061

L. Hans and . Bodlaender, A partial k -arboretum of graphs with bounded treewidth, Theor. Comput. Sci, vol.209, issue.12, pp.1-45, 1998.

R. L. Breisch, An intuitive approach to speleotopology, Southwestern Cavers, vol.6, pp.72-78, 1967.

R. L. Breish, Lost in a Cave: applying graph theory to cave exploration. Greyhound press, 2012.

D. Bienstock, N. Robertson, P. D. Seymour, and R. Thomas, Quickly excluding a forest, BS91] Daniel Bienstock and Paul D. Seymour. Monotonicity in graph searching, pp.274-283, 1991.
DOI : 10.1016/0095-8956(91)90068-U

URL : https://doi.org/10.1016/0095-8956(91)90068-u

N. D. Dendris, L. M. Kirousis, and D. M. Thilikos, Fugitive-search games on graphs and related parameters, Theoretical Computer Science, vol.172, issue.1-2, pp.233-254, 1997.
DOI : 10.1016/S0304-3975(96)00177-6

URL : https://doi.org/10.1016/s0304-3975(96)00177-6

D. Dereniowski, W. Kubiak, and Y. Zwols, The complexity of minimum-length path decompositions, Journal of Computer and System Sciences, vol.81, issue.8, pp.1715-1747, 2015.
DOI : 10.1016/j.jcss.2015.06.011

URL : http://arxiv.org/pdf/1302.2788

D. Gianlorenzo, A. Angelo, N. Navarra, and . Nisse, A unified approach for gathering and exclusive searching on rings under weak assumptions . Distributed Computing, DOR18] Dariusz Dereniowski, Dorota Osula, and Pawé l Rzazewski. Finding small-width connected path decompositions in polynomial time. CoRR, pp.17-48, 2017.

D. Gianlorenzo, G. D. Angelo, A. Stefano, N. Navarra, K. Nisse et al., Computing on rings by oblivious robots: A unified approach for different tasks, DU16] Dariusz Dereniowski and Dorota Urbanska. Distributed searching of partial grids. CoRR, abs, pp.1055-1096, 1458.

D. Dyer and B. Yang, On the Fast Searching Problem, Proc. of 4th Int. Conference on Algorithmic Aspects in Information and Management (AAIM), pp.143-154, 2008.
DOI : 10.1007/978-3-540-68880-8_15

W. Evans, P. Hunter, and M. A. Safari, D-width and cops and robbers

A. John, M. Ellis, and . Markov, Computing the vertex separation of unicyclic graphs, Inf. Comput, vol.192, issue.2, pp.123-161, 2004.

J. A. Ellis, I. H. Sudborough, and J. S. Turner, Graph separation and search number, 1987.
DOI : 10.1006/inco.1994.1064

URL : https://doi.org/10.1006/inco.1994.1064

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

V. Fedor, P. Fomin, N. Fraigniaud, and . Nisse, Nondeterministic graph searching: From pathwidth to treewidth, Algorithmica, vol.53, issue.3, pp.358-373, 2009.

V. Fedor, P. A. Fomin, and . Golovach, Graph searching and interval completion, SIAM J. Discrete Math, vol.13, issue.4, pp.454-464, 2000.

P. Flocchini, . Miao-jun, F. L. Huang, and . Luccio, DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS, International Journal of Foundations of Computer Science, vol.27, issue.03, pp.547-563, 2007.
DOI : 10.1016/S1389-1286(00)00136-5

P. Flocchini, . Miao-jun, F. L. Huang, and . Luccio, Decontamination of hypercubes by mobile agents, Networks, vol.3341, issue.3, pp.167-178, 2008.
DOI : 10.1007/3-540-45071-8_39

URL : http://www.site.uottawa.ca/~flocchin/Papers/Networks07.pdf

V. Fedor, P. Fomin, R. Heggernes, and . Mihai, Mixed search number and linear-width of interval and split graphs, Networks, vol.56, issue.3, pp.207-214, 2010.

V. Fedor, P. Fomin, J. A. Heggernes, and . Telle, Graph searching , elimination trees, and a generalization of bandwidth, Algorithmica, vol.41, issue.2, pp.73-87, 2005.

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

R. Michael, M. A. Fellows, and . Langston, On search, decision, and the efficiency of polynomial-time algorithms, J. Comput. Syst. Sci, vol.49, issue.3, pp.769-779, 1994.

P. Flocchini, F. Luccio, L. Pagli, N. S. , P. Flocchini et al., Network decontamination under <mml:math altimg="si60.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mi>m</mml:mi></mml:math>-immunity, Proc. of the Int. Conference on Communications in Computing (CIC), pp.114-129, 2005.
DOI : 10.1016/j.dam.2015.07.020

V. Fedor, D. Fomin, S. Lokshtanov, and . Saurabh, Excluded grid minors and efficient polynomial-time approximation schemes, J. ACM, vol.6510, issue.2, pp.1-1044, 2018.

P. Flocchini, B. Mans, and N. Santoro, Tree Decontamination with Temporary Immunity, Proc. of 19th Int. Symposium on Algorithms and Computation (ISAAC), pp.330-341, 2008.
DOI : 10.1007/BFb0055153

URL : http://www.comp.mq.edu.au/~bmans/BMans/Papers/FMS_ISAAC08.pdf

P. Fraigniaud and N. Nisse, Monotony properties of connected visible graph searching, Information and Computation, vol.206, issue.12, pp.1383-1393, 2008.
DOI : 10.1016/j.ic.2008.09.002

URL : https://hal.archives-ouvertes.fr/hal-00421416

P. Flocchini, A. Nayak, and A. Schulz, Decontamination of Arbitrary Networks using a Team of Mobile Agents with Limited Visibility, 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007), pp.469-474, 2007.
DOI : 10.1109/ICIS.2007.87

V. Fedor and . Fomin, Helicopter search problems, bandwidth and pathwidth, Discrete Applied Mathematics, vol.85, issue.1, pp.59-70, 1998.

V. Fedor and . Fomin, Note on a helicopter search problem on graphs, Discrete Applied Mathematics, vol.95, issue.1-3, pp.241-249, 1999.

V. Fedor, P. Fomin, N. Flocchini, and . Santoro, Searching expenditure and interval graphs Distributed security algorithms by mobile agents, Distributed Computing and Networking, 8th International Conference, ICDCN, pp.97-104, 2004.

V. Fedor, D. M. Fomin, and . Thilikos, An annotated bibliography on guaranteed graph searching, Theor. Comput. Sci, vol.399, issue.3, pp.236-245, 2008.

V. Fedor, D. M. Fomin, I. Thilikos, and . Todinca, Connected graph searching in outerplanar graphs, Electronic Notes in Discrete Mathematics, vol.22, pp.213-216, 2005.

R. Ganian, P. Hlinen´yhlinen´y, J. Kneis, D. M. Obdrzálek, P. Rossmanith et al., Are there any good digraph width measures?, Journal of Combinatorial Theory, Series B, vol.116, pp.250-286, 2016.
DOI : 10.1016/j.jctb.2015.09.001

URL : http://arxiv.org/pdf/1004.1485

P. A. Golovach, P. Heggernes, and R. Mihai, Edge search number of cographs, Discrete Applied Mathematics, vol.160, issue.6, pp.734-743, 2012.
DOI : 10.1016/j.dam.2011.04.020

URL : https://doi.org/10.1016/j.dam.2011.04.020

C. Archontia, P. Giannopoulou, D. M. Hunter, and . Thilikos, Lifosearch: A min-max theorem and a searching game for cycle-rank and treedepth A visibility-based pursuit-evasion problem, Discrete Applied Mathematics Int. J. Comput. Geometry Appl, vol.160, issue.945, pp.2089-2097471, 1999.

P. A. Golovach, Equivalence of two formalizations of a search problem on a graph, pp.13-19, 1989.

P. A. Golovach, A topological invariant in pursuit problems, Differ. Equ, vol.25, pp.657-661, 1989.

J. G. , D. Ilcinkas, N. Nisse, and D. Soguet, Digraph measures: Kelly decompositions , games, and orderings [HM08] Pinar Heggernes and Rodica Mihai Mixed search number of permutation graphs Workshop on Frontiers in Algorithmics FAW The cost of monotonicity in distributed graph searching Capturing an intruder in product networks, Proc. of Second Annual Int Distributed ComputingISZ08] Navid Imani, Hamid Sarbazi-Azad, and Albert Y. Zomaya. Intruder capturing in mesh and torus networks, pp.233-248206, 1993.

T. Johnson, N. Robertson, P. D. Seymour, and R. Thomas, Directed Tree-Width, Journal of Combinatorial Theory, Series B, vol.82, issue.1, pp.138-154, 2001.
DOI : 10.1006/jctb.2000.2031

URL : https://doi.org/10.1006/jctb.2000.2031

N. G. Kinnersley, The vertex separation number of a graph equals its pathwidth, Inform. Process. Lett, 1992.
DOI : 10.1016/0020-0190(92)90234-m

S. Kintali, N. Kothari, A. Kumar-kenta-kitsunai, Y. Kobayashi, K. Komuro et al., Approximation algorithms for digraph width parameters, Kirousis and Christos H. Papadimitriou. Interval graphs and searching. Discrete Mathematics, pp.365-376138, 1985.
DOI : 10.1016/j.tcs.2014.10.009

URL : http://arxiv.org/pdf/1107.4824

M. Lefteris, C. H. Kirousis, and . Papadimitriou, Searching and pebbling, Theor. Comput. Sci, vol.47, issue.3, pp.205-218, 1986.

B. William, P. Kinnersley, and . Pralat, Game brush number, Discrete Applied Mathematics, vol.207, pp.1-14, 2016.

K. Klein and S. Suri, Pursuit Evasion on Polyhedral Surfaces, Algorithmica, vol.21, issue.1???2, pp.730-747, 2015.
DOI : 10.1137/0221051

A. S. Lapaugh, L. Fabrizio-luccio, N. Pagli, and . Santoro, Recontamination does not help to search a graph Network decontamination with local immunization Contiguous search problem in sierpinski graphs, Proc. of 20th Int. Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2006. [Luc09] Flaminia L. Luccio, pp.224-245186, 1993.

S. Mallach, Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem, Proc. of 28th Int. Workshop on Combinatorial Algorithms (IWOCA), pp.327-340, 2018.
DOI : 10.1016/j.dam.2007.08.045

N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou, The complexity of searching a graph [MM09] Rodica Mihai and Morten Mjelde. A self-stabilizing algorithm for graph searching in trees Monotonicity of non-deterministic graph searching, Proc. of 11th Int. Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)MNP08] Margaret-Ellen Messinger, Richard J. Nowakowski, and Pawel Pralat. Cleaning a network with brushes, pp.18-44, 1988.
DOI : 10.1109/sfcs.1981.46

E. Markou, N. Nisse, S. Ivan, and H. Sudborough, Exclusive graph searching vs. pathwidth Min cut is np-complete for edge weighted trees, MT09] Rodica Mihai and Ioan Todinca, pp.243-260209, 1988.
URL : https://hal.archives-ouvertes.fr/hal-00980877