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
Brief Announcement: Distributed Exclusive and Perpetual Tree Searching, 26th Int. Symp. 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
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
Graph searching, path-width, tree-width and related problems (a survey) ,
The pathwidth and treewidth of cographs, SIAM J. Discrete Math, vol.5, issue.62, pp.33-49181, 1991. ,
An intuitive approach to speleotopology, Southwestern Cavers, vol.6, pp.72-78, 1967. ,
Monotonicity in graph searching, Journal of Algorithms, vol.12, issue.2, pp.239-245, 1991. ,
DOI : 10.1016/0196-6774(91)90003-H
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
A Linear Recognition Algorithm for Cographs, SIAM Journal on Computing, vol.14, issue.4, pp.926-934, 1985. ,
DOI : 10.1137/0214065
A unified approach for different tasks on rings in robot-based computing systems Exact and approximate solutions for the gate matrix layout problem, 15th Workshop on Advances in Parallel and Distributed Computational Models (APDCM), pp.667-67679, 1987. ,
Gathering and exclusive searching on rings under minimal assumptions, 15th Int. Conf. on Dist. Comp. & Networking, pp.149-164, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00931514
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
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
Edge search number of cographs, Discrete Applied Mathematics, vol.160, issue.6, pp.734-743, 2012. ,
DOI : 10.1016/j.dam.2011.04.020
On the pathwidth of chordal graphs, Discrete Applied Mathematics, vol.45, issue.3, pp.233-248, 1993. ,
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
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
The complexity of searching a graph, J. ACM, vol.35, issue.1, pp.18-44, 1988. ,
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
Pursuit-evasion in a graph, Theory and applications of graphs (Proc. Internat. Conf., Western Mich, pp.426-441, 1976. ,
Graph searching on some subclasses of chordal graphs, Algorithmica, vol.27, issue.3, pp.395-426, 2000. ,
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
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. ,