{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:24Z","timestamp":1740109344403,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"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":["Algorithmica"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00453-024-01286-5","type":"journal-article","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T06:07:09Z","timestamp":1733897229000},"page":"321-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Symmetry Breaking in the Plane"],"prefix":"10.1007","volume":"87","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan","family":"Killick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8959-4428","authenticated-orcid":false,"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,11]]},"reference":[{"issue":"3","key":"1286_CR1","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 J. Control. Optim. 33(3), 673\u2013683 (1995)","journal-title":"SIAM J. Control. Optim."},{"key":"1286_CR2","unstructured":"Alpern, S.: Hide and seek games, Seminar. Institut f\u00fcr H\u00f6here Studien, Wien, 26 July, (1976)"},{"key":"1286_CR3","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, vol. 55. Kluwer Academic Publishers, Kolkata (2002)"},{"issue":"1","key":"1286_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1287\/opre.49.1.107.11191","volume":"49","author":"EJ Anderson","year":"2001","unstructured":"Anderson, E.J., Fekete, S.P.: Two dimensional rendezvous search. Oper. Res. 49(1), 107\u2013118 (2001)","journal-title":"Oper. Res."},{"key":"1286_CR5","doi-asserted-by":"crossref","unstructured":"Bampas, E., Czyzowicz, J., G\u0105sieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Distributed Computing: 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13\u201315, 2010. Proceedings 24, pp. 297\u2013311. Springer (2010)","DOI":"10.1007\/978-3-642-15763-9_28"},{"issue":"2","key":"1286_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00224-005-1223-5","volume":"40","author":"L Barri\u00e8re","year":"2007","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Rendezvous and election of mobile agents: impact of sense of direction. Theory Comput. Syst. 40(2), 143\u2013162 (2007)","journal-title":"Theory Comput. Syst."},{"key":"1286_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ipl.2018.01.003","volume":"133","author":"S Bouchard","year":"2018","unstructured":"Bouchard, S., Dieudonn\u00e9, Y., Pelc, A., Petit, F.: On deterministic rendezvous at a node of agents with arbitrary velocities. Inf. Process. Lett. 133, 39\u201343 (2018)","journal-title":"Inf. Process. Lett."},{"key":"1286_CR8","doi-asserted-by":"crossref","unstructured":"Bramas, Q., Tixeuil, S.: Wait-free gathering without chirality. In: Structural Information and Communication Complexity-22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14\u201316, 2015, Post-Proceedings, pp. 313\u2013327 (2015)","DOI":"10.1007\/978-3-319-25258-2_22"},{"issue":"07","key":"1286_CR9","doi-asserted-by":"publisher","first-page":"2250030","DOI":"10.1142\/S1793830922500306","volume":"14","author":"H Chuangpishit","year":"2022","unstructured":"Chuangpishit, H., Czyzowicz, J., Killick, R., Kranakis, E., Krizanc, D.: Optimal rendezvous on a line by location-aware robots in the presence of spies. Discrete Math. Algorithms Appl. 14(07), 2250030 (2022)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"1286_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, R., Peleg, D.: Convergence of autonomous mobile robots with inaccurate sensors and movements. In: Annual Symposium on Theoretical Aspects of Computer Science, pp. 549\u2013560. Springer (2006)","DOI":"10.1007\/11672142_45"},{"key":"1286_CR11","doi-asserted-by":"crossref","unstructured":"Collins, A., Czyzowicz, J., Gasieniec, L., Labourel, A.: Tell me where I am so I can meet you sooner. In: ICALP, pp. 502\u2013514 (2010)","DOI":"10.1007\/978-3-642-14162-1_42"},{"issue":"1","key":"1286_CR12","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02124750","volume":"5","author":"RM Corless","year":"1996","unstructured":"Corless, R.M., Gonnet, G.H., Hare, D.E.G., Jeffrey, D.J., Knuth, D.E.: On the Lambert W function. Adv. Comput. Math. 5(1), 329\u2013359 (1996)","journal-title":"Adv. Comput. Math."},{"key":"1286_CR13","unstructured":"Czyzowicz, J., Killick, R., Kranakis, E.: Linear rendezvous with asymmetric clocks. In: OPODIS Conference on Principles of Distributed Systems, 17\u201319 December 2018, Hong Kong, pp. 25:1\u201325:16. LIPICS (2018)"},{"key":"1286_CR14","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.tcs.2020.06.034","volume":"836","author":"J Czyzowicz","year":"2020","unstructured":"Czyzowicz, J., Killick, R., Kranakis, E., Krizanc, D., Morales-Ponce, O.: Gathering in the plane of location-aware robots in the presence of spies. Theoret. Comput. Sci. 836, 94\u2013109 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"1286_CR15","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Killick, R., Kranakis, E., Krizanc, D., Morales Ponce, O.: Gathering in the plane of location-aware robots in the presence of spies. In: SIROCCO 2018, Ma\u2019ale HaHamisha, Israel, June 18\u201321, 2018, Revised Selected Papers, pp. 361\u2013376 (2018)","DOI":"10.1007\/978-3-030-01325-7_30"},{"key":"1286_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-011-0141-9","volume":"25","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distrib. Comput. 25, 165\u2013178 (2012)","journal-title":"Distrib. Comput."},{"issue":"4","key":"1286_CR17","first-page":"37:1","volume":"8","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Pelc, A., Labourel, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms (TALG) 8(4), 37:1-37:14 (2012)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"1286_CR18","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1007\/s00453-015-9982-0","volume":"74","author":"Y Dieudonn\u00e9","year":"2016","unstructured":"Dieudonn\u00e9, Y., Pelc, A.: Anonymous meeting in networks. Algorithmica 74, 908\u2013946 (2016)","journal-title":"Algorithmica"},{"issue":"3","key":"1286_CR19","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1137\/130931990","volume":"44","author":"Y Dieudonn\u00e9","year":"2015","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. SIAM J. Comput. 44(3), 844\u2013867 (2015)","journal-title":"SIAM J. Comput."},{"key":"1286_CR20","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2015.12.035","volume":"688","author":"O Feinerman","year":"2017","unstructured":"Feinerman, O., Korman, A., Kutten, S., Rodeh, Y.: Fast rendezvous on a cycle by agents with different speeds. Theoret. Comput. Sci. 688, 77\u201385 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"1286_CR21","first-page":"1","volume":"9","author":"A Hoorfar","year":"2008","unstructured":"Hoorfar, A., Hassani, M.: Inequalities on the Lambert W function and hyperpower function. J. Inequal. Pure Appl. Math. 9, 1 (2008)","journal-title":"J. Inequal. Pure Appl. Math."},{"key":"1286_CR22","doi-asserted-by":"crossref","unstructured":"Izumi, T., Katayama, Y., Inuzuka, N., Wada, K.: Gathering autonomous mobile robots with dynamic compasses: an optimal result. In: International Symposium on Distributed Computing, pp. 298\u2013312. Springer (2007)","DOI":"10.1007\/978-3-540-75142-7_24"},{"issue":"1","key":"1286_CR23","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/100797916","volume":"41","author":"T Izumi","year":"2012","unstructured":"Izumi, T., Souissi, S., Katayama, Y., Inuzuka, N., D\u00e9fago, X., Wada, K., Yamashita, M.: The gathering problem for two oblivious robots with unreliable compasses. SIAM J. Comput. 41(1), 26\u201346 (2012)","journal-title":"SIAM J. Comput."},{"key":"1286_CR24","doi-asserted-by":"crossref","unstructured":"Katayama, Y., Tomida, Y., Imazu, H., Inuzuka, N., Wada, K.: Dynamic compass models and gathering algorithms for autonomous mobile robots. In: International Colloquium on Structural Information and Communication Complexity, pp. 274\u2013288. Springer (2007)","DOI":"10.1007\/978-3-540-72951-8_22"},{"key":"1286_CR25","unstructured":"King, P., auf\u00a0der Heide, F.M.: Continuous protocols for swarm robotics. In: Proceedings of Moving and Computing, 5\u20139 June, 2017. La Maddalena, Italy. Springer (2017)"},{"issue":"1\u20132","key":"1286_CR26","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tcs.2008.02.010","volume":"399","author":"DR Kowalski","year":"2008","unstructured":"Kowalski, D.R., Malinowski, A.: How to meet in anonymous network. Theoret. Comput. Sci. 399(1\u20132), 141\u2013156 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"1286_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-01999-9","volume":"1","author":"E Kranakis","year":"2010","unstructured":"Kranakis, E., Krizanc, D., Markou, E.: The mobile agent rendezvous problem in the ring. Synth. Lect. Distrib. Comput. Theory 1(1), 1\u2013122 (2010)","journal-title":"Synth. Lect. Distrib. Comput. Theory"},{"key":"1286_CR28","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Markou, E.: Mobile agent rendezvous in a synchronous torus. Discrete Appl. Math. 896\u2013923 (2011)","DOI":"10.1016\/j.dam.2011.01.020"},{"issue":"3","key":"1286_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1978782.1978789","volume":"7","author":"E Kranakis","year":"2011","unstructured":"Kranakis, E., Krizanc, D., Morin, P.: Randomized rendezvous with limited memory. ACM Trans. Algorithms (TALG) 7(3), 1\u201312 (2011)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"1286_CR30","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Rajsbaum, S.: Mobile agent rendezvous: a survey. In: Structural Information and Communication Complexity: 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2\u20135, 2006. Proceedings 13, pp. 1\u20139. Springer (2006)","DOI":"10.1007\/11780823_1"},{"key":"1286_CR31","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, E., Markou, D., Pagourtzis, A., Ramirez, F.: Two different speeds suffice for rendezvous in arbitrary graphs. In: Proceedings of 43rd International Conferences Current Trends in Theory and Practice of Computer Science (SOFSEM), pp. 16\u201320 (2017)","DOI":"10.1007\/978-3-319-51963-0_7"},{"issue":"2","key":"1286_CR32","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/j.ejor.2021.05.009","volume":"297","author":"P Leone","year":"2022","unstructured":"Leone, P., Buwaya, J., Alpern, S.: Search-and-rescue rendezvous. Eur. J. Oper. Res. 297(2), 579\u2013591 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"1286_CR33","doi-asserted-by":"crossref","unstructured":"Li, S., Markarian, C., auf\u00a0der Heide, F.M., Podlipyan, P.: A continuous strategy for collisionless gathering. In: International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, pp. 182\u2013197. Springer (2017)","DOI":"10.1007\/978-3-319-72751-6_14"},{"key":"1286_CR34","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-0348-8405-1_16","volume-title":"Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities","author":"Y Metivier","year":"2000","unstructured":"Metivier, Y., Saheb, N., Zemmari, A.: Randomized rendezvous. In: Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, pp. 183\u2013194. Springer, Berlin (2000)"},{"issue":"3","key":"1286_CR35","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/net.21453","volume":"59","author":"A Pelc","year":"2012","unstructured":"Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59(3), 331\u2013347 (2012)","journal-title":"Networks"},{"key":"1286_CR36","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ipl.2018.04.006","volume":"140","author":"A Pelc","year":"2018","unstructured":"Pelc, A.: Reaching a target in the plane with no information. Inf. Process. Lett. 140, 13\u201317 (2018)","journal-title":"Inf. Process. Lett."},{"key":"1286_CR37","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-030-11072-7_17","volume-title":"Distributed Computing by Mobile Entities","author":"A Pelc","year":"2019","unstructured":"Pelc, A.: Deterministic rendezvous algorithms. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities, pp. 423\u2013454. Springer, Berlin (2019)"},{"issue":"3","key":"1286_CR38","first-page":"12","volume":"10","author":"A Ta-Shma","year":"2014","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. ACM Trans. Algorithms (TALG) 10(3), 12 (2014)","journal-title":"ACM Trans. Algorithms (TALG)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-024-01286-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-024-01286-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-024-01286-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T08:49:09Z","timestamp":1740041349000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-024-01286-5"}},"subtitle":["Rendezvous by Robots with Unknown Attributes"],"short-title":[],"issued":{"date-parts":[[2024,12,11]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["1286"],"URL":"https:\/\/doi.org\/10.1007\/s00453-024-01286-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2024,12,11]]},"assertion":[{"value":"3 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}