Exploring unknown environments, SIAM J. Comput, vol.29, issue.4, pp.1164-1188, 2000. ,
Online algorithms: a survey, Math. Program, vol.97, issue.1-2, pp.3-26, 2003. ,
Online algorithms -what is it worth to know the future? In: Algorithms Unplugged, pp.361-366, 2011. ,
The theory of search games and rendezvous, 2003. ,
Searching in the plane, Information and Computation, vol.106, pp.234-234, 1993. ,
On utilizing speed in networks of mobile agents, ACM SIGACT-SIGOPS 2010, pp.305-314, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00531438
On the linear search problem, Israel Journal of Mathematics, vol.2, issue.4, pp.221-228, 1964. ,
An optimal search problem, Bull. Am. Math. Soc. p, p.270, 1963. ,
Online Algorithms The State of the Art, pp.232-241, 1998. ,
Network exploration by silent and oblivious robots, Graph-Theoretic Concepts in Computer Science, WG 2010, vol.6410, pp.208-219, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-01198880
The beachcombers' problem: Walking and searching from an inner point of a line, Language and Automata Theory and Applications, vol.9618, pp.270-282, 2016. ,
The beachcombers' problem: Walking and searching with mobile robots, Theor. Comput. Sci, vol.608, pp.201-218, 2015. ,
The multi-source beachcombers' problem, Algorithms for Sensor Systems, ALGO-SENSORS 2014, Revised Selected Papers, vol.8847, pp.3-21, 2014. ,
Boundary patrolling by mobile agents with distinct maximal speeds, Algorithms, ESA 2011, vol.6942, pp.701-712, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00646910
Worst-case optimal exploration of terrains with obstacles, Inf. Comput, vol.225, pp.16-28, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00863496
Map construction of unknown graphs by multiple agents, Theor. Comput. Sci, vol.385, issue.1-3, pp.34-48, 2007. ,
Online searching with turn cost, Theoretical Computer Science, vol.361, issue.2, pp.342-355, 2006. ,
Exploring an unknown graph, Foundations of Computer Science, FOCS 1990, pp.355-361, 1990. ,
How to learn an unknown environment (extended abstract), Foundations of Computer Science, FOCS, pp.298-303, 1991. ,
Fast collaborative graph exploration, Inf. Comput, vol.243, pp.37-49, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01251826
Competitive online approximation of the optimal search ratio, SIAM J. Comput, vol.38, issue.3, pp.881-898, 2008. ,
An annotated bibliography on guaranteed graph searching, Theor. Comput. Sci, vol.399, issue.3, pp.236-245, 2008. ,
Collective tree exploration, Networks, vol.48, issue.3, pp.166-177, 2006. ,
Online graph exploration algorithms for cycles and trees by multiple searchers, J. Comb. Optim, vol.28, issue.2, pp.480-495, 2014. ,
Fence patrolling by mobile agents with distinct speeds, Distributed Computing, vol.28, issue.2, pp.147-154, 2015. ,
Optimizing sensor movement planning for energy efficiency, ACM Transactions on Sensor Networks, vol.7, issue.4, p.33, 2011. ,