{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:48:22Z","timestamp":1787510902759,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540614227","type":"print"},{"value":"9783540685296","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_144","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:36:59Z","timestamp":1330274219000},"page":"345-356","source":"Crossref","is-referenced-by-count":8,"title":["Walking streets faster"],"prefix":"10.1007","author":[{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sven","family":"Schuierer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R. Baeza-Yates","year":"1993","unstructured":"R. Baeza-Yates, J. Culberson and G. Rawlins. \u201cSearching in the plane\u201d, Information and Computation, Vol. 106, (1993), pp. 234\u2013252.","journal-title":"Information and Computation"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"A. Blum, P. Raghavan and B. Schieber. \u201cNavigating in unfamiliar geometric terrain\u201d, Proc. of 23rd ACM Symp. on Theory of Computing, (1991), pp. 494\u2013504.","DOI":"10.1145\/103418.103419"},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1142\/S0218195993000154","volume":"3","author":"K-F. Chan","year":"1993","unstructured":"K-F. Chan and T. W. Lam. \u201cAn on-line algorithm for navigating in an unknown environment\u201d, International Journal of Computational Geometry & Applications, Vol. 3, (1993), pp. 227\u2013244.","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"30_CR4","unstructured":"X. Deng, T. Kameda and C. Papadimitriou. \u201cHow to learn an unknown environment I: The rectilinear case\u201d, Technical Report CS-93-04, Dept. of Comp. Sci., York University, 1993. Also as Proc. 32nd IEEE Symp. on Foundations of Comp. Sci., (1991), pp. 298\u2013303."},{"key":"30_CR5","unstructured":"Ch. Icking. Ph. D. Thesis, Fernuniversit\u00e4t Hagen, 1994."},{"key":"30_CR6","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0925-7721(92)90010-P","volume":"1","author":"R. Klein","year":"1992","unstructured":"R. Klein. \u201cWalking an unknown street with bounded detour\u201d, Computational Geometry: Theory and Applications 1, (1992), pp. 325\u2013351.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"30_CR7","unstructured":"J. Kleinberg. \u201cOn-line search in a simple polygon\u201d, Proc. of 5th ACM-SIAM Symp. on Discrete Algorithms, (1994), pp. 8\u201315."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"A. Lopez-Ortiz and S. Schuierer. \u201cGoing home through an unknown street\u201d, Proc. of 4th Workshop on Data Structures and Algorithms, 1995, LNCS 955, pp. 135\u2013146.","DOI":"10.1007\/3-540-60220-8_57"},{"key":"30_CR9","unstructured":"A. Lopez-Ortiz and S. Schuierer. \u201cSimple, Efficient and Robust Strategies to Traverse Streets\u201d, Proc. 7th Canad. Conf. on Computational Geometry, 1995, pp. 217\u2013222."},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"A. Mei and Y. Igarashi. \u201cEfficient strategies for robot navigation in unknown environment\u201d Proc. of 21st Intl. Colloquium on Automata, Languages and Programming, (1994).","DOI":"10.1007\/3-540-58201-0_104"},{"key":"30_CR11","unstructured":"E. Moise. \u201cElementary Geometry from an Advanced Standpoint\u201d, 2nd ed., Addison-Wesley, 1973."},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"C. H. Papadimitriou","year":"1991","unstructured":"C. H. Papadimitriou and M. Yannakakis. \u201cShortest paths without a map\u201d, Theoretical Computer Science 84, (1991), pp. 127\u2013150.","journal-title":"Theoretical Computer Science"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. D. Sleator","year":"1985","unstructured":"D. D. Sleator and R. E. Tarjan. \u201cAmortized efficiency of list update and paging rules\u201d, Communications of the ACM 28, (1985), pp. 202\u2013208.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_144.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:06:04Z","timestamp":1605629164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_144","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}