{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:07:11Z","timestamp":1740114431182,"version":"3.37.3"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T00:00:00Z","timestamp":1706832000000},"content-version":"vor","delay-in-days":1462,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ontario Graduate Scholarship"},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["AF-1813940"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1016\/j.tcs.2019.09.026","type":"journal-article","created":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T22:43:17Z","timestamp":1569278597000},"page":"595-616","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"special_numbering":"C","title":["Priority evacuation from a disk: The case of n\u202f=\u202f1,2,3"],"prefix":"10.1016","volume":"806","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[]},{"given":"Konstantinos","family":"Georgiou","sequence":"additional","affiliation":[]},{"given":"Ryan","family":"Killick","sequence":"additional","affiliation":[]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[]},{"given":"Lata","family":"Narayanan","sequence":"additional","affiliation":[]},{"given":"Jaroslav","family":"Opatrny","sequence":"additional","affiliation":[]},{"given":"Sunil","family":"Shende","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1987","series-title":"Search Problems","author":"Ahlswede","key":"10.1016\/j.tcs.2019.09.026_br0010"},{"key":"10.1016\/j.tcs.2019.09.026_br0020","series-title":"The Theory of Search Games and Rendezvous","volume":"vol. 55","author":"Alpern","year":"2002"},{"first-page":"223","year":"2013","series-title":"Ten Open Problems in Rendezvous Search","key":"10.1016\/j.tcs.2019.09.026_br0030"},{"issue":"2","key":"10.1016\/j.tcs.2019.09.026_br0040","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/inco.1993.1054","article-title":"Searching in the plane","volume":"106","author":"Baeza Yates","year":"1993","journal-title":"Inf. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2019.09.026_br0050","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0925-7721(95)00003-R","article-title":"Parallel searching in the plane","volume":"5","author":"Baeza-Yates","year":"1995","journal-title":"Comput. Geom."},{"issue":"4","key":"10.1016\/j.tcs.2019.09.026_br0060","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02759737","article-title":"On the linear search problem","volume":"2","author":"Beck","year":"1964","journal-title":"Isr. J. Math."},{"issue":"3","key":"10.1016\/j.tcs.2019.09.026_br0070","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1137\/1005070","article-title":"An optimal search","volume":"5","author":"Bellman","year":"1963","journal-title":"SIAM Rev."},{"key":"10.1016\/j.tcs.2019.09.026_br0080","series-title":"Proceedings of Algorithms and Complexity - 10th International Conference","first-page":"104","article-title":"Collaboration without communication: evacuating two robots from a disk","author":"Brandt","year":"2017"},{"key":"10.1016\/j.tcs.2019.09.026_br0090","series-title":"ALGOSENSORS'18","article-title":"Average case - worst case tradeoffs for evacuating 2 robots from the disk in the face-to-face model","author":"Chuangpishit","year":"2018"},{"key":"10.1016\/j.tcs.2019.09.026_br0100","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.tcs.2016.11.019","article-title":"Evacuating two robots from multiple unknown exits in a circle","volume":"709","author":"Czyzowicz","year":"2018","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2019.09.026_br0110","series-title":"Proceedings DISC","first-page":"122","article-title":"Evacuating robots from an unknown exit located on the perimeter of a disc","author":"Czyzowicz","year":"2014"},{"key":"10.1016\/j.tcs.2019.09.026_br0120","series-title":"Proceedings SIROCCO 2017","first-page":"158","article-title":"Evacuation from a disc in the presence of a faulty robot","author":"Czyzowicz","year":"2018"},{"key":"10.1016\/j.tcs.2019.09.026_br0130","series-title":"SIROCCO","article-title":"Priority evacuation from a disk using mobile robots","author":"Czyzowicz","year":"2018"},{"key":"10.1016\/j.tcs.2019.09.026_br0140","series-title":"Proceedings of Algorithms and Complexity","first-page":"140","article-title":"Evacuating robots from a disk using face-to-face communication (extended abstract)","author":"Czyzowicz","year":"2015"},{"key":"10.1016\/j.tcs.2019.09.026_br0150","series-title":"Proceedings of Ad-hoc, Mobile, and Wireless Networks, ADHOC-NOW","first-page":"181","article-title":"Wireless autonomous robot evacuation from equilateral triangles and squares","author":"Czyzowicz","year":"2015"},{"key":"10.1016\/j.tcs.2019.09.026_br0160","series-title":"Proceedings DISC","first-page":"1","article-title":"Fast two-robot disk evacuation with wireless communication","author":"Lamprou","year":"2016"},{"key":"10.1016\/j.tcs.2019.09.026_br0170","series-title":"Proceedings of the 19th International Conference on Distributed Computing and Networking","article-title":"Evacuating two robots from two unknown exits on the perimeter of a disk with wireless communication","author":"Pattanayak","year":"2018"},{"year":"1975","series-title":"Theory of Optimal Search","author":"Stone","key":"10.1016\/j.tcs.2019.09.026_br0180"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397519305778?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397519305778?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T11:42:45Z","timestamp":1712403765000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397519305778"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":18,"alternative-id":["S0304397519305778"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2019.09.026","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2020,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Priority evacuation from a disk: The case of n\u202f=\u202f1,2,3","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2019.09.026","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}