{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T17:02:31Z","timestamp":1780074151743,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540280613","type":"print"},{"value":"9783540318064","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_53","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"524-533","source":"Crossref","is-referenced-by-count":23,"title":["Exploring Simple Grid Polygons"],"prefix":"10.1007","author":[{"given":"Christian","family":"Icking","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom","family":"Kamphans","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Klein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elmar","family":"Langetepe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"53_CR1","unstructured":"Arkin, E.M., Fekete, S.P., Mitchell, J.S.B.: Approximation algorithms for lawn mowing and milling. Technical report, Mathematisches Institut, Universit\u00e4t zu K\u00f6ln (1997)"},{"key":"53_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci., pp. 2\u201311 (1996)","DOI":"10.1109\/SFCS.1996.548458"},{"issue":"2","key":"53_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/274787.274788","volume":"45","author":"X. Deng","year":"1998","unstructured":"Deng, X., Kameda, T., Papadimitriou, C.: How to learn an unknown environment I: The rectilinear case. J. ACM\u00a045(2), 215\u2013245 (1998)","journal-title":"J. ACM"},{"key":"53_CR4","unstructured":"Everett, H.: Hamiltonian paths in non-rectangular grid graphs. Report 86-1, Dept. Comput. Sci., Univ. Toronto, Toronto, ON (1986)"},{"key":"53_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Online Algorithms","year":"1998","unstructured":"Fiat, A. (ed.): Dagstuhl Seminar 1996. LNCS, vol.\u00a01442. Springer, Heidelberg (1998)"},{"key":"53_CR6","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. Comput. Geom. Theory Appl.\u00a024, 197\u2013224 (2003)","journal-title":"Comput. Geom. Theory Appl."},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"Grigni, M., Koutsoupias, E., Papadimitriou, C.H.: An approximation scheme for planar graph TSP. In: Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci., pp. 640\u2013645 (1995)","DOI":"10.1109\/SFCS.1995.492665"},{"key":"53_CR8","unstructured":"Handel, U., Icking, C., Kamphans, T., Langetepe, E., Meiswinkel, W.: Gridrobot \u2013 an environment for simulating exploration strategies in unknown cellular areas. Java Applet (2000), \n                    \n                      http:\/\/www.geometrylab.de\/Gridrobot\/"},{"key":"53_CR9","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1137\/S0097539799348670","volume":"31","author":"F. Hoffmann","year":"2001","unstructured":"Hoffmann, F., Icking, C., Klein, R., Kriegel, K.: The polygon exploration problem. SIAM J. Comput.\u00a031, 577\u2013600 (2001)","journal-title":"SIAM J. Comput."},{"key":"53_CR10","unstructured":"Icking, C., Kamphans, T., Klein, R., Langetepe, E.: Exploring an unknown cellular environment. In: Abstracts 16th European Workshop Comput. Geom., Ben-Gurion University of the Negev, pp. 140\u2013143 (2000)"},{"key":"53_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-45993-6_14","volume-title":"Sensor Based Intelligent Robots","author":"C. Icking","year":"2002","unstructured":"Icking, C., Kamphans, T., Klein, R., Langetepe, E.: On the competitive complexity of navigation tasks. In: Hager, G.D., Christensen, H.I., Bunke, H., Klein, R. (eds.) Dagstuhl Seminar 2000. LNCS, vol.\u00a02238, pp. 245\u2013258. Springer, Heidelberg (2002)"},{"key":"53_CR12","unstructured":"Icking, C., Klein, R., Langetepe, E.: Searching for the kernel of a polygon: A competitive strategy using self-approaching curves. Technical Report 211, Department of Computer Science, FernUniversit\u00e4t Hagen, Germany (1997)"},{"key":"53_CR13","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1137\/S0097539702419352","volume":"33","author":"C. Icking","year":"2004","unstructured":"Icking, C., Klein, R., Langetepe, E., Schuierer, S., Semrau, I.: An optimal competitive strategy for walking in streets. SIAM J. Comput.\u00a033, 462\u2013486 (2004)","journal-title":"SIAM J. Comput."},{"key":"53_CR14","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"C.H. Itai","year":"1982","unstructured":"Itai, C.H.: Papadimitriou, and J. L. Szwarcfiter. Hamilton paths in grid graphs. SIAM J. Comput.\u00a011, 676\u2013686 (1982)","journal-title":"SIAM J. Comput."},{"key":"53_CR15","unstructured":"Kamphans, T.: Models and Algorithms for Online Exploration and Search. PhD thesis, University of Bonn (to appear)"},{"key":"53_CR16","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. SIAM J. Comput.\u00a028, 1298\u20131309 (1999)","journal-title":"SIAM J. Comput."},{"key":"53_CR17","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume-title":"Handbook of Computational Geometry","author":"J.S.B. Mitchell","year":"2000","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633\u2013701. Elsevier Science Publishers B.V, North-Holland (2000)"},{"issue":"3","key":"53_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0925-7721(92)90014-J","volume":"1","author":"S. Ntafos","year":"1992","unstructured":"Ntafos, S.: Watchman routes under limited visibility. Comput. Geom. Theory Appl.\u00a01(3), 149\u2013170 (1992)","journal-title":"Comput. Geom. Theory Appl."},{"key":"53_CR19","doi-asserted-by":"crossref","unstructured":"Umans, C., Lenhart, W.: Hamiltonian cycles in solid grid graphs. In: Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci., pp. 496\u2013507 (1997)","DOI":"10.1109\/SFCS.1997.646138"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T04:03:58Z","timestamp":1553141038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11533719_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}