{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:27:53Z","timestamp":1760441273728,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181721"},{"type":"electronic","value":"9783319181738"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18173-8_10","type":"book-chapter","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T08:47:43Z","timestamp":1431679663000},"page":"140-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"J.","family":"Czyzowicz","sequence":"first","affiliation":[]},{"given":"K.","family":"Georgiou","sequence":"additional","affiliation":[]},{"given":"E.","family":"Kranakis","sequence":"additional","affiliation":[]},{"given":"L.","family":"Narayanan","sequence":"additional","affiliation":[]},{"given":"J.","family":"Opatrny","sequence":"additional","affiliation":[]},{"given":"B.","family":"Vogtenhuber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"key":"10_CR1","unstructured":"Ahlswede, R., Wegener, I.: Search problems. Wiley-Interscience (1987)"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1287\/moor.24.3.604","volume":"24","author":"S Alpern","year":"1999","unstructured":"Alpern, S., Beck, A.: Asymmetric rendezvous on the line is a double linear search problem. Mathematics of Operations Research 24(3), 604\u2013618 (1999)","journal-title":"Mathematics of Operations Research"},{"key":"10_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, vol. 55. Springer, New York (2003)"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"RB Yates","year":"1993","unstructured":"Yates, R.B., Culberson, J., Rawlins, G.: Searching in the plane. Information and Computation 106(2), 234\u2013252 (1993)","journal-title":"Information and Computation"},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02759737","volume":"2","author":"A Beck","year":"1964","unstructured":"Beck, A.: On the linear search problem. Israel Journal of Mathematics 2(4), 221\u2013228 (1964)","journal-title":"Israel Journal of Mathematics"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/1005070","volume":"5","author":"R Bellman","year":"1963","unstructured":"Bellman, R.: An optimal search. Siam Review 5(3), 274\u2013274 (1963)","journal-title":"Siam Review"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1002\/1520-6750(199108)38:4<469::AID-NAV3220380404>3.0.CO;2-E","volume":"38","author":"S Benkoski","year":"1991","unstructured":"Benkoski, S., Monticino, M., Weisinger, J.: A survey of the search theory literature. Naval Research Logistics (NRL) 38(4), 469\u2013494 (1991)","journal-title":"Naval Research Logistics (NRL)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Bonato, A., Nowakowski, R.: The game of cops and robbers on graphs. American Mathematical Soc. (2011)","DOI":"10.1090\/stml\/061"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-662-45174-8_9","volume-title":"Distributed Computing","author":"J Czyzowicz","year":"2014","unstructured":"Czyzowicz, J., Gasieniec, 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":"10_CR10","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E., Narayanan, L., Opatrny, J., Vogtenhuber, B.: Evacuating using face-to-face communication. CoRR, abs\/1501.04985 (2015)"},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1287\/opre.16.3.525","volume":"16","author":"J Dobbie","year":"1968","unstructured":"Dobbie, J.: A survey of search theory. Operations Research 16(3), 525\u2013537 (1968)","journal-title":"Operations Research"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-662-43951-7_40","volume-title":"Automata, Languages, and Programming","author":"Y Emek","year":"2014","unstructured":"Emek, Y., Langner, T., Uitto, J., Wattenhofer, R.: Solving the ANTS problem with asynchronous finite state machines. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 471\u2013482. Springer, Heidelberg (2014)"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2005.01.001","volume":"337","author":"P Flocchini","year":"2005","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theoretical Computer Science 337(1), 147\u2013168 (2005)","journal-title":"Theoretical Computer Science"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Lynch, N., Newport, C., Radeva, T.: Trade-offs between selection complexity and performance when searching the plane without communication. In: Proceedings of PODC, pp. 252\u2013261 (2014)","DOI":"10.1145\/2611462.2611463"},{"key":"10_CR15","unstructured":"L\u00f3pez-Ortiz, A., Sweet, G.: Parallel searching on a lattice. In: Proceedings of CCCG, pp. 125\u2013128 (2001)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Nahin, P.: Chases and Escapes: The Mathematics of Pursuit and Evasion. Princeton University Press (2012)","DOI":"10.1515\/9781400842063"},{"key":"10_CR17","volume-title":"Theory of optimal search","author":"L Stone","year":"1975","unstructured":"Stone, L.: Theory of optimal search. Academic Press, New York (1975)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18173-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T07:58:32Z","timestamp":1674201512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18173-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181721","9783319181738"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18173-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}