{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T03:25:31Z","timestamp":1775791531198,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4429,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0304-3975(00)00144-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"267-295","source":"Crossref","is-referenced-by-count":43,"title":["The ultimate strategy to search on m rays?"],"prefix":"10.1016","volume":"261","author":[{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Schuierer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00144-4_BIB1","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":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00144-4_BIB2","first-page":"32","volume":"vol. 1004","author":"Datta","year":"1995"},{"key":"10.1016\/S0304-3975(00)00144-4_BIB3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0925-7721(99)00015-2","article-title":"Competitive searching in a generalized street","volume":"13","author":"Datta","year":"1999","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0304-3975(00)00144-4_BIB4","series-title":"Search Games","author":"Gal","year":"1980"},{"key":"10.1016\/S0304-3975(00)00144-4_BIB5","unstructured":"Ch. Hipke. Online-Algorithmen zur kompetitiven Suche in einfachen Polygonen, Master's Thesis, Universit\u00e4t Freiburg, 1994."},{"key":"10.1016\/S0304-3975(00)00144-4_BIB6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0166-218X(99)00009-8","article-title":"How to find a point on a line within a fixed distance","volume":"93","author":"Hipke","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(00)00144-4_BIB7","doi-asserted-by":"crossref","unstructured":"Ch. Icking, R. Klein, Searching for the kernel of a polygon: a competitive strategy, Proc. 11th Annu. ACM Symp. Comput. Geom., 1995, pp. 258\u2013266.","DOI":"10.1145\/220279.220307"},{"key":"10.1016\/S0304-3975(00)00144-4_BIB8","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/jagm.1998.0959","article-title":"Optimal constructions of hybrid algorithms","volume":"29","author":"Kao","year":"1998","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/S0304-3975(00)00144-4_BIB9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1006\/inco.1996.0092","article-title":"Searching in an unknown environment","volume":"131","author":"Kao","year":"1997","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00144-4_BIB10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0925-7721(92)90010-P","article-title":"Walking an unknown street with bounded detour","volume":"1","author":"Klein","year":"1992","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0304-3975(00)00144-4_BIB11","series-title":"Algorithmische Geometrie","author":"Klein","year":"1997"},{"key":"10.1016\/S0304-3975(00)00144-4_BIB12","first-page":"280","volume":"vol. 1099","author":"Koutsoupias","year":"1996"},{"key":"10.1016\/S0304-3975(00)00144-4_BIB13","unstructured":"A. L\u00f3pez-Ortiz, On-line searching on bounded and unbounded domains, Ph.D. Thesis, Department of Computer Science, University of Waterloo, 1996."},{"key":"10.1016\/S0304-3975(00)00144-4_BIB14","first-page":"546","article-title":"Generalized streets revisited","volume":"vol. 1136","author":"L\u00f3pez-Ortiz","year":"1996"},{"key":"10.1016\/S0304-3975(00)00144-4_BIB15","first-page":"284","volume":"vol. 1272","author":"L\u00f3pez-Ortiz","year":"1997"},{"issue":"1","key":"10.1016\/S0304-3975(00)00144-4_BIB16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","article-title":"Shortest paths without a map","volume":"84","author":"Papadimitriou","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00144-4_BIB17","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(00)00144-4_BIB18","unstructured":"Y. Yin, Teaching, learning, and exploration, Ph.D. Thesis, Department of Mathematics and Laboratory for Computer Science, MIT, MA 1994."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001444?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001444?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T10:21:21Z","timestamp":1556792481000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0304397500001444"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00144-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}