1. Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7–9, 2001, Washington, DC, USA, pp. 547–556 (2001)
2. Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36(1), 56–82 (2006)
3. Alpern, S.: Rendezvous search: a personal perspective. Oper. Res. 50(5), 772–795 (2002)
4. Alpern, S.: The Theory of Search Games and Rendezvous. International Series in Operations Research and Management Science. Kluwer, Amsterdam (2003)
5. Bampas, E., Czyzowicz, J., Gasieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Proceedings of Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13–15, 2010, pp. 297–311 (2010)