1. Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers (2003)
2. Angelopoulos, S/: Further connections between contract-scheduling and ray-searching problems. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI), pp. 1516–1522 (2015)
3. Angelopoulos, S., Arsénio, D., Dürr, C.: Infinite linear programming and the online search problem with turn cost. Manuscript. Available at http://www-desir.lip6.fr/durrc/bib/turn.pdf
4. Angelopoulos, S., López-Ortiz, A., Panagiotou, K.: Multi-target ray searching problems. Theor. Comput. Sci. 540, 2–12 (2014)
5. Baeza-Yates, R., Culberson, J., Rawlins, G.: Searching in the plane. Inf. Comput. 106, 234–244 (1993)