{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T03:40:39Z","timestamp":1728186039088},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:00:00Z","timestamp":1728172800000},"content-version":"vor","delay-in-days":1466,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1016\/j.tcs.2020.06.034","type":"journal-article","created":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T01:56:25Z","timestamp":1594691785000},"page":"94-109","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Gathering in the plane of location-aware robots in the presence of spies"],"prefix":"10.1016","volume":"836","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[]},{"given":"Ryan","family":"Killick","sequence":"additional","affiliation":[]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[]},{"given":"Oscar","family":"Morales-Ponce","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.tcs.2020.06.034_br0010","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1137\/S009753979628292X","article-title":"Distributed anonymous mobile robots: formation of geometric patterns","volume":"28","author":"Suzuki","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2020.06.034_br0020","series-title":"Proceedings of the 29th PODC","first-page":"267","article-title":"On the computational power of oblivious robots: forming a series of geometric patterns","author":"Das","year":"2010"},{"issue":"3","key":"10.1016\/j.tcs.2020.06.034_br0030","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S0363012993249195","article-title":"The rendezvous search problem","volume":"33","author":"Alpern","year":"1995","journal-title":"SIAM J. Control Optim."},{"issue":"5","key":"10.1016\/j.tcs.2020.06.034_br0040","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1287\/opre.50.5.772.363","article-title":"Rendezvous search: a personal perspective","volume":"50","author":"Alpern","year":"2002","journal-title":"Oper. Res."},{"key":"10.1016\/j.tcs.2020.06.034_br0050","series-title":"Proceedings of 29th DISC","first-page":"1","article-title":"Deterministic rendezvous in networks: survey of models and results","author":"Pelc","year":"2011"},{"key":"10.1016\/j.tcs.2020.06.034_br0060","series-title":"The Theory of Search Games and Rendezvous","volume":"vol. 55","author":"Alpern","year":"2003"},{"issue":"4","key":"10.1016\/j.tcs.2020.06.034_br0070","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1137\/100796534","article-title":"Distributed computing by mobile robots: gathering","volume":"41","author":"Cieliebak","year":"2012","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2020.06.034_br0080","series-title":"International Colloquium on Automata, Languages, and Programming","first-page":"502","article-title":"Tell me where I am so I can meet you sooner","author":"Collins","year":"2010"},{"issue":"3","key":"10.1016\/j.tcs.2020.06.034_br0090","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.tcs.2005.12.016","article-title":"Asynchronous deterministic rendezvous in graphs","volume":"355","author":"De Marco","year":"2006","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2020.06.034_br0100","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.tcs.2005.01.001","article-title":"Gathering of asynchronous robots with limited visibility","volume":"337","author":"Flocchini","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2020.06.034_br0110","series-title":"Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Proceedings","first-page":"1","article-title":"Mobile agent rendezvous: a survey","author":"Kranakis","year":"2006"},{"issue":"2\u20133","key":"10.1016\/j.tcs.2020.06.034_br0120","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.tcs.2007.04.023","article-title":"Impossibility of gathering by a set of autonomous mobile robots","volume":"384","author":"Prencipe","year":"2007","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2020.06.034_br0130","series-title":"ICALP","first-page":"610","article-title":"Agent rendezvous: a dynamic symmetry-breaking problem","author":"Yu","year":"1996"},{"key":"10.1016\/j.tcs.2020.06.034_br0140","series-title":"Distributed Computing - 30th International Symposium, DISC 2016, Proceedings","first-page":"187","article-title":"Certified universal gathering in R2 for oblivious mobile robots","author":"Courtieu","year":"2016"},{"key":"10.1016\/j.tcs.2020.06.034_br0150","series-title":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016","first-page":"301","article-title":"Asymptotically optimal gathering on a grid","author":"Cord-Landwehr","year":"2016"},{"key":"10.1016\/j.tcs.2020.06.034_br0160","series-title":"International Symposium on Distributed Computing","first-page":"447","article-title":"Synchronous rendezvous for location-aware agents","author":"Collins","year":"2011"},{"key":"10.1016\/j.tcs.2020.06.034_br0170","series-title":"Combinatorial Network Theory","first-page":"125","article-title":"Dissemination of information in interconnection networks (broadcasting & gossiping)","author":"Hromkovi\u010d","year":"1996"},{"year":"1996","series-title":"Distributed Algorithms","author":"Lynch","key":"10.1016\/j.tcs.2020.06.034_br0180"},{"issue":"6","key":"10.1016\/j.tcs.2020.06.034_br0190","doi-asserted-by":"crossref","first-page":"1516","DOI":"10.1137\/S0097539704446475","article-title":"Convergence properties of the gravitational algorithm in asynchronous robot systems","volume":"34","author":"Cohen","year":"2005","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2020.06.034_br0200","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.jss.2010.08.026","article-title":"Fault-tolerant flocking for a group of autonomous mobile robots","volume":"84","author":"Yang","year":"2011","journal-title":"J. Syst. Softw."},{"key":"10.1016\/j.tcs.2020.06.034_br0210","series-title":"27th International Symposium on Algorithms and Computation, ISAAC 2016","first-page":"27:1","article-title":"Search on a line by byzantine robots","author":"Czyzowicz","year":"2016"},{"key":"10.1016\/j.tcs.2020.06.034_br0220","series-title":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016","first-page":"405","article-title":"Search on a line with faulty robots","author":"Czyzowicz","year":"2016"},{"key":"10.1016\/j.tcs.2020.06.034_br0230","series-title":"Algorithms and Computation - 26th International Symposium, ISAAC 2015, Proceedings","first-page":"343","article-title":"When patrolmen become corrupted: monitoring a graph using faulty mobile robots","author":"Czyzowicz","year":"2015"},{"issue":"1","key":"10.1016\/j.tcs.2020.06.034_br0240","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/050645221","article-title":"Fault-tolerant gathering algorithms for autonomous mobile robots","volume":"36","author":"Agmon","year":"2006","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2020.06.034_br0250","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1137\/060665257","article-title":"Convergence of autonomous mobile robots with inaccurate sensors and movements","volume":"38","author":"Cohen","year":"2008","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2020.06.034_br0260","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2629656","article-title":"Gathering despite mischief","volume":"11","author":"Dieudonn\u00e9","year":"2014","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"10.1016\/j.tcs.2020.06.034_br0270","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/100797916","article-title":"The gathering problem for two oblivious robots with unreliable compasses","volume":"41","author":"Izumi","year":"2012","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2020.06.034_br0280","series-title":"Principles of Distributed Systems (OPODIS)","first-page":"333","article-title":"Gathering asynchronous mobile robots with inaccurate compasses","author":"Souissi","year":"2006"},{"key":"10.1016\/j.tcs.2020.06.034_br0290","series-title":"Proceedings 13th International Symposium on Algorithms and Experiments for Wireless Networks","article-title":"Rendezvous on a line of faulty, location-aware robots","author":"Chuangpishit","year":"2017"},{"key":"10.1016\/j.tcs.2020.06.034_br0300","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1017\/S0013091500037238","article-title":"On the problem to construct the minimum circle enclosing n given points in the plane","volume":"3","author":"Chrystal","year":"1885","journal-title":"Proc. Edinb. Math. Soc."},{"year":"2008","series-title":"Computational Geometry: Algorithms and Applications","author":"Berg","key":"10.1016\/j.tcs.2020.06.034_br0310"},{"key":"10.1016\/j.tcs.2020.06.034_br0320","series-title":"Algorithms in Combinatorial Geometry","volume":"vol. 10","author":"Edelsbrunner","year":"2012"},{"issue":"3","key":"10.1016\/j.tcs.2020.06.034_br0330","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF02574382","article-title":"Computing a centerpoint of a finite planar set of points in linear time","volume":"12","author":"Jadhav","year":"1994","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"10.1016\/j.tcs.2020.06.034_br0340","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2020.06.034_br0350","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/358841.358850","article-title":"Multidimensional divide-and-conquer","volume":"23","author":"Bentley","year":"1980","journal-title":"Commun. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397520303741?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397520303741?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T03:04:35Z","timestamp":1728183875000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397520303741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":35,"alternative-id":["S0304397520303741"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2020.06.034","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2020,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Gathering in the plane of location-aware robots in the presence of spies","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2020.06.034","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}