{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:56:12Z","timestamp":1761807372224},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_38","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"456-468","source":"Crossref","is-referenced-by-count":32,"title":["Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher"],"prefix":"10.1007","author":[{"given":"Sang-Min","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jae-Ha","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyung-Yong","family":"Chwa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"issue":"4","key":"38_CR1","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1142\/S0218195995000246","volume":"5","author":"D. Crass","year":"1995","unstructured":"D. Crass, I. Suzuki, and M. Yamashita. Searching for a mobile intruder in a Corridor-the open edge variant of the polygon search problem. Int. J. of Comp. Geom. and Appl., 5(4):397\u2013412, 1995.","journal-title":"J. of Comp. Geom. and Appl."},{"issue":"4","key":"38_CR2","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1142\/S0218195999000273","volume":"9","author":"L.J. Guibas","year":"1999","unstructured":"L.J. Guibas, J.C. Latombe, S.M. Lavalle, D. Lin, and R. Motwani. A visibility based pursuit-evasion problem. Int. J. of Comp. Geom. and Appl., 9(4):471\u2013493, 1999.","journal-title":"Int. J. of Comp. Geom. and Appl."},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"C. Icking and R. Klein. The two guards problem. In Proc. 7th Annu. ACM Sympos. Comp. Geom., pages 166\u2013175, 1991.","DOI":"10.1145\/109648.109667"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"S. M. LaValle, B. H. Simov, and G. Slutzki. An algorithm for searching a polygonal region with a flashlight. In Proc. of 16th ACM Symp. on Comp. Geom., pages 260\u2013269, 2000.","DOI":"10.1145\/336154.336212"},{"key":"38_CR5","unstructured":"J.-H. Lee, S.-M. Park, and K.-Y. Chwa. On the Polygon-Search Conjecture. Technical Report TR-2000-157, CS department, KAIST, 2000."},{"issue":"2","key":"38_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1142\/S0218195900000127","volume":"10","author":"J.-H. Lee","year":"2000","unstructured":"J.-H. Lee, S.-M. Park, and K.-Y. Chwa. Searching a polygonal room with one door by a 1-searcher. Int. J. of Comp. Geom. and Appl., 10(2):201\u2013220, 2000.","journal-title":"Int. J. of Comp. Geom. and Appl."},{"key":"38_CR7","unstructured":"J.-H. Lee, S.-M. Park, and K.-Y. Chwa. Simple algorithms for searching a polygon with flashlights. Submitted, 2000."},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"J.-H. Lee, S.Y. Shin, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal room with a door. In Proc. 15th ACM Sympos. on Comp. Geom., pages 281\u2013290, 1999.","DOI":"10.1145\/304893.304981"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"N. Megiddo, S.L. Hakimi, M.R. Garey, D.S. Johnson, and C. H. Papadimitriou. The complexity of searching a graph. Journal of the ACM, pages 18\u201344, 1988.","DOI":"10.1145\/42267.42268"},{"key":"38_CR10","series-title":"Technical Report TR-2001-161","volume-title":"Visibility-based pursuit-evasion in a polygonal region by a searcher","author":"S.-M. Park","year":"2001","unstructured":"S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal region by a searcher. Technical Report TR-2001-161, CS department, KAIST, 2001."},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"T.D. Parsons. Pursuit-evasion in a graph. In Theorey and Applications of Graphs Y. Alavi and D.R. Lick eds. Lecture Notes in Mathematics, Springer-Verlag., pages 426\u2013441, 1976.","DOI":"10.1007\/BFb0070400"},{"key":"38_CR12","series-title":"TR-20000925","volume-title":"Searching a polygonal region from the boundary","author":"I. Suzuki","year":"2000","unstructured":"I. Suzuki, Y. Tazoe, M. Yamashita, and T. Kameda. Searching a polygonal region from the boundary. TR-20000925, EECS Department, Univ. of Wisconsin-Milwaukee, 2000."},{"issue":"5","key":"38_CR13","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1137\/0221051","volume":"21","author":"I. Suzuki","year":"1992","unstructured":"I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Comp., 21(5):863\u2013888, 1992.","journal-title":"SIAM J. Comp."},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"X. Tan. Searching a simple polygon by a k-searcher. In Proc. of 11th ISAAC, pages 503\u2013514, 2000.","DOI":"10.1007\/3-540-40996-3_43"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"M. Yamashita, H. Umemoto, I. Suzuki, and T. Kameda. Searching for mobile intruders in a polygonal region by a group of mobile searchers. In Proc. 13th Annu. ACM Sympos. Comp. Geom., pages 448\u2013450, 1997.","DOI":"10.1145\/262839.263078"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:28:14Z","timestamp":1556936894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}