1. Pure strategy asymmetric rendezvous on the line with an unknown initial distance;Alpern;Oper. Res.,2000
2. S. Alpern, S. Gal, The Theory of Search Games and Rendezvous, Kluwer Academic Publishers, Dordrecht.
3. E. Arkin, M. Bender, E. Demaine, S.P. Fekete, J.S.B. Mitchell, S. Sethia, Optimal covering tours with turn costs, Proc. SODA 01, ACM-SIAM Symp. on Discrete Algorithms, 2001, pp. 138–147.
4. R.A. Baeza-Yates, J.C. Culberson, G.J.E. Rawlins, Searching with uncertainty, Proc. SWAT 88, First Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 318, Springer, Berlin, 1988, pp. 176–189.
5. Searching in the plane;Baeza-Yates;Inform. and Comput.,1993