{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T23:06:58Z","timestamp":1760828818458,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354741"},{"type":"electronic","value":"9783540354758"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_1","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T14:45:59Z","timestamp":1151073959000},"page":"1-9","source":"Crossref","is-referenced-by-count":45,"title":["Mobile Agent Rendezvous: A Survey"],"prefix":"10.1007","author":[{"given":"Evangelos","family":"Kranakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Alpern, S.: Hide and Seek Games, Seminar, Institut f\u00fcr H\u00f6here Studien, Wien (July 1976)"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S0363012993249195","volume":"33","author":"S. Alpern","year":"1995","unstructured":"Alpern, S.: The Rendezvous Search Problem. SIAM Journal of Control and Optimization\u00a033, 673\u2013683 (1995)","journal-title":"SIAM Journal of Control and Optimization"},{"key":"1_CR3","volume-title":"The Theory of Search Games and Rendezvous","author":"S. Alpern","year":"2003","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers, Norwell (2003)"},{"key":"1_CR4","unstructured":"Barriere, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Election and Rendezvous of Anonymous Mobile Agents in Anonymous Networks with Sense of Direction. In: Proceedings of the 9th Sirocco, pp. 17\u201332 (2003)"},{"issue":"6","key":"1_CR5","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1002\/nav.1044","volume":"47","author":"V. Baston","year":"2001","unstructured":"Baston, V., Gal, S.: Rendezvous Search When Marks Are Left at the Starting Points. Naval Research Logistics\u00a047(6), 722\u2013731 (2001)","journal-title":"Naval Research Logistics"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/S0097539791194931","volume":"26","author":"A. Blum","year":"1997","unstructured":"Blum, A., Raghavan, P., Schieber, B.: Navigating in Unfamiliar Geometric Terrain. SIAM Journal on Computing\u00a026, 110\u2013137 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/320211.320232","volume":"46","author":"H. Buhrman","year":"1999","unstructured":"Buhrman, H., Franklin, M., Garay, J., Hoepman, J., Tromp, J., Vitanyi, P.: Mutual Search. Journal of the ACM\u00a046, 517\u2013536 (1999)","journal-title":"Journal of the ACM"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11549345_24","volume-title":"Mathematical Foundations of Computer Science 2005","author":"G. Marco De","year":"2005","unstructured":"De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous\u00a0deterministic\u00a0rendezvous in\u00a0graphs. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 271\u2013282. Springer, Heidelberg (2005)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8","volume":"32","author":"X. Deng","year":"1999","unstructured":"Deng, X., Papadimitriou, C.H.: Exploring an Unknown Graph. Journal of Graph Theory\u00a032, 265\u2013297 (1999)","journal-title":"Journal of Graph Theory"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-39658-1_19","volume-title":"Algorithms - ESA 2003","author":"A. Dessmark","year":"2003","unstructured":"Dessmark, A., Fraigniaud, P., Pelc, A.: Deterministic Rendezvous in Graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 184\u2013195. Springer, Heidelberg (2003)"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jalgor.2003.10.002","volume":"51","author":"K. Diks","year":"2004","unstructured":"Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree Exploration with Little Memory. Journal of Algorithms\u00a051, 38\u201363 (2004)","journal-title":"Journal of Algorithms"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-27860-3_6","volume-title":"Principles of Distributed Systems","author":"S. Dobrev","year":"2004","unstructured":"Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Multiple Agents Rendezvous in a Ring in spite of a Black Hole. In: Papatriantafilou, M., Hunel, P. (eds.) OPODIS 2003. LNCS, vol.\u00a03144, pp. 34\u201346. Springer, Heidelberg (2004)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<165::AID-NET1>3.0.CO;2-I","volume":"32","author":"P. Flocchini","year":"1998","unstructured":"Flocchini, P., Mans, B., Santoro, N.: Sense of direction: definition, properties and classes. Networks\u00a032, 29\u201353 (1998)","journal-title":"Networks"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-540-24698-5_62","volume-title":"LATIN 2004: Theoretical Informatics","author":"P. Flocchini","year":"2004","unstructured":"Flocchini, P., Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Multiple Mobile Agent Rendezvous in a Ring. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 599\u2013608. Springer, Heidelberg (2004)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-27796-5_15","volume-title":"Structural Information and Communication Complexity","author":"P. Flocchini","year":"2004","unstructured":"Flocchini, P., Kranakis, E., Krizanc, D., Luccio, F.L., Santoro, N., Sawchuk, C.: Mobile agents rendezvous when tokens fail. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 161\u2013172. Springer, Heidelberg (2004)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11611257_26","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"L. G\u0105sieniec","year":"2006","unstructured":"G\u0105sieniec, L., Kranakis, E., Krizanc, D., Zhang, X.: Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 282\u2013292. Springer, Heidelberg (2006)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/978-3-540-30551-4_56","volume-title":"Algorithms and Computation","author":"D.R. Kowalski","year":"2004","unstructured":"Kowalski, D.R., Pelc, A.: Polynomial deterministic rendezvous in arbitrary graphs. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 644\u2013656. Springer, Heidelberg (2004)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/11780823_5","volume-title":"Structural Information and Communication Complexity","author":"D.R. Kowalski","year":"2006","unstructured":"Kowalski, D.R., Malinowski, A.: How to meet in anonymous network. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 44\u201358. Springer, Heidelberg (2006)"},{"key":"1_CR19","unstructured":"Kranakis, E., Krizanc, D.: Searching with Uncertainty. In: Proc. of 6th Sirocco (1999)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile Agent Rendezvous Search Problem in the Ring. In: Proc. International Conference on Distributed Computing Systems (ICDCS), pp. 592\u2013599 (2003)","DOI":"10.1109\/ICDCS.2003.1203510"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/11682462_60","volume-title":"LATIN 2006: Theoretical Informatics","author":"E. Kranakis","year":"2006","unstructured":"Kranakis, E., Krizanc, D., Markou, E.: Mobile Agent Rendezvous in a Synchronous Torus. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 653\u2013664. Springer, Heidelberg (2006)"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N., Hakimi, S., Garey, M., Johnson, D., Papadimitriou, C.: The Complexity of Searching a Graph. Journal of the ACM\u00a035, 18\u201344 (1988)","journal-title":"Journal of the ACM"},{"key":"1_CR23","unstructured":"Morin, P.: Personal communication"},{"key":"1_CR24","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1006\/jagm.1999.1043","volume":"33","author":"P. Panaite","year":"1999","unstructured":"Panaite, P., Pelc, A.: Exploring Unknown Undirected Graphs. Journal of Algorithms\u00a033, 281\u2013295 (1999)","journal-title":"Journal of Algorithms"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1011219024159","volume":"11","author":"N. Roy","year":"2001","unstructured":"Roy, N., Dudek, G.: Collaborative robot exploration and rendezvous: Algorithms, performance bounds and observations. Autonomous Robots\u00a011, 117\u2013136 (2001)","journal-title":"Autonomous Robots"},{"key":"1_CR27","unstructured":"Sawchuk, C.: Mobile Agent Rendezvous in the Ring, PhD thesis, Carleton University, School of Computer Science, Ottawa, Canada (2004)"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1137\/S009753979628292X","volume":"28","author":"I. Suzuki","year":"1999","unstructured":"Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal of Computing\u00a028, 1347\u20131363 (1999)","journal-title":"SIAM Journal of Computing"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/3-540-61440-0_163","volume-title":"Automata, Languages and Programming","author":"X. Yu","year":"1996","unstructured":"Yu, X., Yung, M.: Agent Rendezvous: A Dynamic Symmetry-Breaking Problem. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 610\u2013621. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780823_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T15:00:54Z","timestamp":1736434854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11780823_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}