1. Adler, M., Räcke, H., Sivadasan, N., Sohler, C., Vöcking, B.: Randomized Pursuit-Evasion in Graphs. Combinatorics Probability Comput. 12, 225–244 (2003).
2. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: In Proceedings of the 20th IEEE Symposium on Foundations of ComputerScience (FOCS), pp. 218–223 (1979).
3. Alpern, S.: The search game with mobile hider on the circle. In: Emilio O. Roxin, Pan-Tai Liu, Robert L. Sternberg (eds.)Differential Games and Control Theory, pp. 181–200. Marcel Dekker, New York (1974).
4. Babichenko, Y., Peres, Y., Peretz, R., Sousi, P., Winkler, P.: Hunter, Cauchy Rabbit, and Optimal Kakeya Sets. preprint, arXiv:1207.6389v1 (2012).
5. Chatzigannakis, I., Nikoletseas, S., Spirakis, P.: An efficient communication strategy for ad-hoc mobile networks. In: Proc. the 20th ACM Symposium on Principles of Distributed Computing (PODC), pp. 320–322 (2001).