1. Alpern, S., & Gal, S. (2003). The theory of search games and rendezvous. Kluwer Academic Publishers.
2. Alpern, S., & Lidbetter, T. (2013). Mining coal or finding terrorists: The expanding search paradigm. Operations Research, 61(2), 265–279.
3. Angelopoulos, S. (2015). Further connections between contract-scheduling and ray-searching problems. In Proceedings of the Twenty-fourth International Joint Conference on Artificial Intelligence, IJCAI, 2015 (pp. 1516–1522).
4. Angelopoulos, S. (2021). Online search with a hint. In J. R. Lee (Ed.), 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, LIPIcs (Vol. 185, pp. 51:1-51:16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
5. Angelopoulos, S., Arsénio, D., & Dürr, C. (2017). Infinite linear programming and online searching with turn cost. Theoretical Computer Science, 670, 11–22.