{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:32Z","timestamp":1759638692857,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662534250"},{"type":"electronic","value":"9783662534267"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53426-7_1","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T08:49:15Z","timestamp":1472892555000},"page":"1-15","source":"Crossref","is-referenced-by-count":9,"title":["Fast Two-Robot Disk Evacuation with Wireless Communication"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Lamprou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Schewe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,4]]},"reference":[{"key":"1_CR1","series-title":"International Series in Operations Research and Management Science","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2002","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. International Series in Operations Research and Management Science, vol. 55. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"RA Baeza-Yates","year":"1993","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in the plane. Inform. Comput. 106, 234\u2013252 (1993)","journal-title":"Inform. Comput."},{"key":"1_CR3","first-page":"221","volume":"2","author":"A Beck","year":"1964","unstructured":"Beck, A.: On the linear search problem. Naval Res. Logist. 2, 221\u2013228 (1964)","journal-title":"Naval Res. Logist."},{"key":"1_CR4","doi-asserted-by":"crossref","DOI":"10.1090\/stml\/061","volume-title":"The Game of Cops and Robbers on Graphs","author":"A Bonato","year":"2011","unstructured":"Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Golovach (2011)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/978-3-642-40450-4_18","volume-title":"Algorithms \u2013 ESA 2013","author":"P Bose","year":"2013","unstructured":"Bose, P., De Carufel, J.-L., Durocher, S.: Revisiting the problem of searching on a line. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 205\u2013216. Springer, Heidelberg (2013)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Chevaleyre, Y.: Theoretical analysis of the multi-agent patrolling problem. In: IAT 2004, pp. 302\u2013308 (2004)","DOI":"10.1109\/IAT.2004.1342959"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/978-3-662-46078-8_14","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science-Testing","author":"M Chrobak","year":"2015","unstructured":"Chrobak, M., G\u0105sieniec, L., Gorry, T., Martin, R.: Group search on the line. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015-Testing. LNCS, vol. 8939, pp. 164\u2013176. Springer, Heidelberg (2015)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/978-3-662-45174-8_9","volume-title":"Distributed Computing","author":"J Czyzowicz","year":"2014","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Gorry, T., Kranakis, E., Martin, R., Pajak, D.: Evacuating robots via unknown exit in a disk. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 122\u2013136. Springer, Heidelberg (2014)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1007\/978-3-642-23719-5_59","volume-title":"Algorithms \u2013 ESA 2011","author":"J Czyzowicz","year":"2011","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Kosowski, A., Kranakis, E.: Boundary patrolling by mobile agents with distinct maximal speeds. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 701\u2013712. Springer, Heidelberg (2011)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-319-18173-8_10","volume-title":"Algorithms and Complexity","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E., Narayanan, L., Opatrny, J., Vogtenhuber, B.: Evacuating robots from a disk using face-to-face communication (Extended Abstract). In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 140\u2013152. Springer, Heidelberg (2015)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-45249-9_1","volume-title":"Distributed Computing and Networking","author":"O Feinerman","year":"2014","unstructured":"Feinerman, O., Korman, A., Kutten, S., Rodeh, Y.: Fast rendezvous on a cycle by agents with different speeds. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 1\u201313. Springer, Heidelberg (2014)"},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1002\/nav.3800080108","volume":"8","author":"B Gluss","year":"1961","unstructured":"Gluss, B.: An alternative solution to the \u201clost at sea\u201d problem. Naval Res. Logistics Q. 8, 117\u2013122 (1961)","journal-title":"Naval Res. Logistics Q."},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-319-19662-6_14","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"E Huus","year":"2015","unstructured":"Huus, E., Kranakis, E.: Rendezvous of many agents with different speeds in a cycle. In: Papavassiliou, S., Ruehrup, S. (eds.) Ad-hoc, Mobile, and Wireless Networks. LNCS, vol. 9143, pp. 195\u2013209. Springer, Heidelberg (2015)"},{"key":"1_CR14","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/j.ipl.2009.01.020","volume":"131","author":"A Je\u017c","year":"2009","unstructured":"Je\u017c, A., \u0141opuza\u0144ski, J.: On the two-dimensional cow search problem. Inf. Process. Lett. 131, 543\u2013547 (2009)","journal-title":"Inf. Process. Lett."},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1006\/inco.1996.0092","volume":"131","author":"M-Y Kao","year":"1996","unstructured":"Kao, M.-Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. Inform. Comput. 131, 63\u201380 (1996)","journal-title":"Inform. Comput."},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/11890591_1","volume-title":"Structural Information and Communication Complexity","author":"H-C An","year":"2006","unstructured":"An, H.-C., Krizanc, D., Rajsbaum, S.: Mobile agent rendezvous: a survey. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 1\u20139. Springer, Heidelberg (2006)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Parsons, T.D.: Pursuit-evasion in a graph, in theory and applications of graphs. In: Proceedings of the Michigan May 11\u201315, pp. 426\u2013441 (1976)","DOI":"10.1007\/BFb0070400"},{"key":"1_CR18","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s00453-003-1030-9","volume":"37","author":"V Yanovski","year":"2003","unstructured":"Yanovski, V., Wagner, I.A., Bruckstein, A.M.: A distributed ant algorithm for efficiently patrolling a network. Algorithmica 37, 165\u2013186 (2003)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53426-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:42:38Z","timestamp":1749573758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53426-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662534250","9783662534267"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53426-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}