{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T12:17:59Z","timestamp":1782303479326,"version":"3.54.5"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2020,5,30]],"date-time":"2020-05-30T00:00:00Z","timestamp":1590796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,30]],"date-time":"2020-05-30T00:00:00Z","timestamp":1590796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s00453-020-00724-4","type":"journal-article","created":{"date-parts":[[2020,5,30]],"date-time":"2020-05-30T02:02:41Z","timestamp":1590804161000},"page":"3250-3281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Deterministic Treasure Hunt in the Plane with Angular Hints"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6464-9517","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Bouchard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yoann","family":"Dieudonn\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Franck","family":"Petit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,5,30]]},"reference":[{"key":"724_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(00)00233-X","volume":"109","author":"O Aichholzer","year":"2001","unstructured":"Aichholzer, O., Aurenhammer, F., Icking, C., Klein, R., Langetepe, E., Rote, G.: Generalized self-approaching curves. Discrete Appl. Math. 109, 3\u201324 (2001)","journal-title":"Discrete Appl. Math."},{"key":"724_CR2","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. Kluwer Academic Publications, Dordrecht (2003)"},{"key":"724_CR3","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R Baeza-Yates","year":"1993","unstructured":"Baeza-Yates, R., Culberson, J., Rawlins, J.: Searching the plane. Inf. Comput. 106, 234\u2013252 (1993)","journal-title":"Inf. Comput."},{"key":"724_CR4","unstructured":"Bouchard, S., Dieudonn\u00e9, Y., Pelc, A., Petit, F.: Deterministic treasure hunt in the plane with angular hints. In: Proceedings of 29th International Symposium on Algorithms and Computation (ISAAC 2018), pp. 48:1\u201348:13"},{"key":"724_CR5","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/BF02798690","volume":"8","author":"A Beck","year":"1970","unstructured":"Beck, A., Newman, D.J.: Yet more on the linear search problem. Israel J. Math. 8, 419\u2013429 (1970)","journal-title":"Israel J. Math."},{"key":"724_CR6","unstructured":"Boczkowski, L., Korman, A., Rodeh, Y.: Searching on trees with noisy memory. In: Proceedings of 26th Annual European Symposium on Algorithms (ESA 2018), pp. 54:1\u201354:13"},{"key":"724_CR7","doi-asserted-by":"publisher","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, Providence (2011)"},{"key":"724_CR8","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Gasieniec, L., Killick, R., Kranakis, E.: Symmetry breaking in the plane: Rendezvous by robots with unknown attributes. In: Proceedings of 38th ACM Symposium on Principles of Distributed Computing (PODC 2019), pp. 4\u201313","DOI":"10.1145\/3293611.3331608"},{"key":"724_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10514-011-9241-4","volume":"31","author":"TH Chung","year":"2011","unstructured":"Chung, T.H., Hollinger, G.A., Isler, V.: Search and pursuit-evasion in mobile robotics: a survey. Auton. Robot. 31, 299\u2013316 (2011)","journal-title":"Auton. Robot."},{"key":"724_CR10","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.tcs.2006.05.018","volume":"361","author":"E Demaine","year":"2006","unstructured":"Demaine, E., Fekete, S., Gal, S.: Online searching with turn cost. Theor. Comput. Sci. 361, 342\u2013355 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"724_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.tcs.2015.05.054","volume":"608","author":"Y Emek","year":"2015","unstructured":"Emek, Y., Langner, T., Stolz, D., Uitto, J., Wattenhofer, R.: How many ants does it take to find the food? Theor. Comput. Sci. 608, 255\u2013267 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"724_CR12","doi-asserted-by":"crossref","unstructured":"Fricke, G. M., Hecker, J. P., Griego, A. D., Tran, L. T., Moses, Melanie E.: A Distributed deterministic spiral search algorithm for swarms. In: Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), pp. 4430\u20134436","DOI":"10.1109\/IROS.2016.7759652"},{"key":"724_CR13","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.2140\/pjm.1960.10.1257","volume":"10","author":"B Gr\u00fcnbaum","year":"1960","unstructured":"Gr\u00fcnbaum, B.: Partitions of mass-distributions and convex bodies by hyperplanes. Pac. J. Math. 10, 1257\u20131261 (1960)","journal-title":"Pac. J. Math."},{"key":"724_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cosrev.2010.05.001","volume":"4","author":"SK Ghosh","year":"2010","unstructured":"Ghosh, S.K., Klein, R.: Online algorithms for searching and exploration in the plane. Comput. Sci. Rev. 4, 189\u2013201 (2010)","journal-title":"Comput. Sci. Rev."},{"key":"724_CR15","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/nav.3800040409","volume":"4","author":"JR Isbell","year":"1957","unstructured":"Isbell, J.R.: An optimal search pattern. Naval Res. Logist. Q. 4, 357\u2013359 (1957)","journal-title":"Naval Res. Logist. Q."},{"key":"724_CR16","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/j.ipl.2009.01.020","volume":"109","author":"A Jez","year":"2009","unstructured":"Jez, A., Lopuszanski, J.: On the two-dimensional cow search problem. Inf. Process. Lett. 109, 543\u2013547 (2009)","journal-title":"Inf. Process. Lett."},{"key":"724_CR17","doi-asserted-by":"crossref","unstructured":"Komm, D., Kralovic, R., Kralovic, R., Smula, J.: Treasure hunt with advice. In: Proceedings of 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2015), pp. 328\u2013341","DOI":"10.1007\/978-3-319-25258-2_23"},{"key":"724_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/inco.1996.0092","volume":"131","author":"MY 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. Inf. Comput. 131, 63\u201379 (1996)","journal-title":"Inf. Comput."},{"key":"724_CR19","unstructured":"Keller, B., Langner, T., Uitto, J., Wattenhofer, R.: Overcoming obstacles with ants. In: Proceedings of 19th International Conference on Principles of Distributed Systems (OPODIS 2015), pp. 1\u201317"},{"key":"724_CR20","doi-asserted-by":"crossref","unstructured":"Langetepe, E.: On the optimality of spiral search. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 1\u201312","DOI":"10.1137\/1.9781611973075.1"},{"key":"724_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2011.12.069","volume":"447","author":"E Langetepe","year":"2012","unstructured":"Langetepe, E.: Searching for an axis-parallel shoreline. Theor. Comput. Sci. 447, 85\u201399 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"724_CR22","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.jpdc.2015.06.004","volume":"83","author":"A Miller","year":"2015","unstructured":"Miller, A., Pelc, A.: Tradeoffs between cost and information for rendezvous and treasure hunt. J. Parallel Distrib. Comput. 83, 159\u2013167 (2015)","journal-title":"J. Parallel Distrib. Comput."},{"key":"724_CR23","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":"724_CR24","doi-asserted-by":"crossref","unstructured":"Spieser, K., Frazzoli, E.: The cow-path game: a competitive vehicle routing problem. In: Proceedings of 51st IEEE Conference on Decision and Control, pp. 6513\u20136520 (2012)","DOI":"10.1109\/CDC.2012.6426279"},{"key":"724_CR25","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/2601068","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 10, 12:1\u201312:15 (2014)","journal-title":"ACM Trans. Algorithms"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00724-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00724-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00724-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,29]],"date-time":"2021-05-29T23:40:30Z","timestamp":1622331630000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00724-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,30]]},"references-count":25,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["724"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00724-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,30]]},"assertion":[{"value":"22 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}