A. Avidor and U. Zwick, Approximating MIN 2-SAT and MIN 3-SAT, Theory of Computing Systems, vol.38, issue.3, pp.329-345, 2005.
DOI : 10.1007/s00224-005-1140-7

J. [. Blin, N. Burman, and . Nisse, Exclusive graph searching, 21st European Symposium on Algorithms (ESA), pp.181-192, 2013.
DOI : 10.1007/s00453-016-0124-0

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

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

H. L. Bodlaender and R. H. Möhring, The Pathwidth and Treewidth of Cographs, SIAM Journal on Discrete Mathematics, vol.6, issue.2, pp.181-188, 1993.
DOI : 10.1137/0406014

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

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.7326

F. [. Coudert, D. Huc, and . Mazauric, A Distributed Algorithm for Computing the Node Search Number in Trees, Algorithmica, vol.47, issue.1, pp.158-190, 2012.
DOI : 10.1007/s00453-011-9524-3

URL : https://hal.archives-ouvertes.fr/inria-00587819

Y. [. Corneil, L. K. Perl, and . Stewart, A Linear Recognition Algorithm for Cographs, SIAM Journal on Computing, vol.14, issue.4, pp.926-934, 1985.
DOI : 10.1137/0214065

M. [. Deo, M. A. Krishnamoorthy, and . Langston, Exact and Approximate Solutions for the Gate Matrix Layout Problem, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.6, issue.1, pp.79-84, 1987.
DOI : 10.1109/TCAD.1987.1270248

P. [. Fomin, R. Heggernes, and . Mihai, Mixed search number and linear-width of interval and split graphs, Networks, vol.105, issue.3, pp.207-214, 2010.
DOI : 10.1002/net.20373

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.3794

D. [. Fomin and . Thilikos, 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

URL : http://doi.org/10.1016/j.tcs.2008.02.040

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

J. Gustedt, On the pathwidth of chordal graphs, Discrete Applied Mathematics, vol.45, issue.3, pp.233-248, 1993.
DOI : 10.1016/0166-218X(93)90012-D

URL : https://hal.archives-ouvertes.fr/inria-00549556

P. Heggernes and R. Mihai, Mixed Search Number of Permutation Graphs, 2nd Int. Workshop on Frontiers in Algorithmics (FAW), pp.196-207, 2008.
DOI : 10.1007/978-3-540-69311-6_22

L. M. Kirousis and C. H. Papadimitriou, Searching and pebbling, Theoretical Computer Science, vol.47, issue.2, pp.205-218, 1986.
DOI : 10.1016/0304-3975(86)90146-5

URL : http://doi.org/10.1016/0304-3975(86)90146-5

. Mhg-+-88-]-n, S. L. Megiddo, M. R. Hakimi, D. S. Garey, C. H. Johnson et al., The complexity of searching a graph, J. ACM, vol.35, issue.1, pp.18-44, 1988.

I. [. Monien and . 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. Par78 and . Parsons, Pursuit-evasion in a graph, Theory and applications of graphs (Proc. Internat. Conf., Western Mich, pp.426-441, 1976.

[. Peng, C. Y. Tang, M. Ko, C. Ho, and T. Hsu, Graph searching on some subclasses of chordal graphs, Algorithmica, vol.27, issue.3, pp.395-426, 2000.

P. [. Robertson and . Seymour, Graph minors. I. Excluding a forest, Journal of Combinatorial Theory, Series B, vol.35, issue.1, pp.39-61, 1983.
DOI : 10.1016/0095-8956(83)90079-5

URL : http://doi.org/10.1006/jctb.1999.1919

]. K. Sko03 and . Skodinis, Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time, J. Alg, vol.47, issue.1, pp.40-59, 2003.