{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T16:59:16Z","timestamp":1780073956077,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642114755","type":"print"},{"value":"9783642114762","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11476-2_18","type":"book-chapter","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T01:15:31Z","timestamp":1264382131000},"page":"222-236","source":"Crossref","is-referenced-by-count":5,"title":["An Improved Strategy for Exploring a Grid Polygon"],"prefix":"10.1007","author":[{"given":"Agnieszka","family":"Kolenderska","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Micha\u0142","family":"Ma\u0142afiejski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0142","family":"\u017byli\u0144ski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"6-7","key":"18_CR1","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.comgeo.2008.11.004","volume":"42","author":"E.M. Arkin","year":"2009","unstructured":"Arkin, E.M., Fekete, S.P., Islam, K., Meijer, H., Mitchell, J.S.B., Nunez-Rodriguez, Y., Polishchuk, V., Rappaport, D., Xiao, H.: Not being (super)thin or solid is hard: A study of grid hamiltonicity. Computational Geometry: Theory and Applications\u00a042(6-7), 582\u2013605 (2009)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1-2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0925-7721(00)00015-8","volume":"17","author":"E.M. Arkin","year":"2000","unstructured":"Arkin, E.M., Fekete, S.P., Mitchell, J.S.B.: Approximation algorithms for lawn mowing and milling. Computational Geometry: Theory and Applications\u00a017(1-2), 25\u201350 (2000)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"5","key":"18_CR3","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"Journal of the ACM"},{"issue":"2-3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.tcs.2005.07.014","volume":"345","author":"P. Fraigniaud","year":"2005","unstructured":"Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. Theoretical Computer Science\u00a0345(2-3), 331\u2013344 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0925-7721(02)00110-4","volume":"24","author":"Y. Gabriely","year":"2003","unstructured":"Gabriely, Y., Rimon, E.: Competitive on-line coverage of grid environments by a mobile robot. Computational Geometry: Theory and Applications\u00a024(3), 197\u2013224 (2003)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"18_CR6","unstructured":"G\u0105sieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 585\u2013594 (2007)"},{"issue":"24","key":"18_CR7","doi-asserted-by":"publisher","first-page":"6166","DOI":"10.1016\/j.disc.2007.11.040","volume":"308","author":"V.S. Gordon","year":"2008","unstructured":"Gordon, V.S., Orlovich, Y.L., Werner, F.: Hamiltonian properties of triangular grid graphs. Discrete Mathematics\u00a0308(24), 6166\u20136188 (2008)","journal-title":"Discrete Mathematics"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Grigni, M., Koutsoupias, E., Papadimitriou, C.: An approximation scheme for planar graph TSP. In: Proceedings of the Thirty-Sixth Annual IEEE Symposium on the Foundations of Computer Science (FOCS 1995), pp. 387\u2013411 (1995)","DOI":"10.1109\/SFCS.1995.492665"},{"key":"18_CR9","unstructured":"Herrmann, D., Kamphans, T., Langetepe, E.: Exploring simple triangular and hexagonal grid polygons online. In: Abstracts of the 24th European Workshop on Computational Geometry, pp. 177\u2013180 (2008)"},{"key":"18_CR10","unstructured":"Icking, C., Kamphans, T., Klein, R., Langetepe, E.: Exploring an unknown cellular environment. In: Abstracts of the 16th European Workshop on Computational Geometry, pp. 140\u2013143 (2000)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/11533719_53","volume-title":"Computing and Combinatorics","author":"C. Icking","year":"2005","unstructured":"Icking, C., Kamphans, T., Klein, R., Langetepe, E.: Exploring simple grid polygons. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 524\u2013533. Springer, Heidelberg (2005)"},{"issue":"4","key":"18_CR12","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A. Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM Journal on Computing\u00a011(4), 676\u2013686 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR13","unstructured":"Kamphans, T.: Models and Algorithms for Online Exploration and Search. Ph.D. thesis, Rheinischen Friedrich-Wilhelms-Universit\u00e4t Bonn (2005)"},{"issue":"4","key":"18_CR14","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1137\/S0097539796309764","volume":"28","author":"J.S.B. Mitchell","year":"1999","unstructured":"Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing\u00a028(4), 1298\u20131309 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected ST-Connectivity in Log-Space. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 376\u2013385 (2005)","DOI":"10.1145\/1060590.1060647"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11476-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T22:57:33Z","timestamp":1552345053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11476-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114755","9783642114762"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11476-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}