1. Alpern, S., & Gal, S. (2003). The theory of search games and rendezvous. New York: Kluwer Academic Publishers.
2. Angelopoulos, S. (2015). Further connections between contract-scheduling and ray-searching problems. In Proceedings of the 24th International Joint Conference in Artificial Intelligence (IJCAI), (pp. 1516–1522).
3. Angelopoulos, S., & López-Ortiz, A. (2009). Interruptible algorithms for multi-problem solving. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), (pp. 380–386).
4. Angelopoulos, S., López-Ortiz, A., & Hamel, A. (2017). Optimal scheduling of contract algorithms with soft deadlines. Journal of Scheduling, 20(3), 267–277.
5. Bernstein, D.S., Finkelstein, L., & Zilberstein, S. (2003). Contract algorithms and robots on rays: Unifying two scheduling problems. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), (pp. 1211–1217).