{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:18:35Z","timestamp":1760440715218},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77120-3_8","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:31:09Z","timestamp":1196940669000},"page":"65-74","source":"Crossref","is-referenced-by-count":3,"title":["Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem"],"prefix":"10.1007","author":[{"given":"Peter","family":"Brass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyue D.","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyeon-Suk","family":"Na","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chan-Su","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1017\/S0963548303005625","volume":"12","author":"M. Adler","year":"2003","unstructured":"Adler, M., R\u00e4cke, H., Sivadasan, N., Sohler, C., V\u00f6cking, B.: Randomized Pursuit-Evasion in Graphs. Combinatorics, Probability & Computing\u00a012, 225\u2013244 (2003)","journal-title":"Combinatorics, Probability & Computing"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0893-9659(95)00015-I","volume":"8","author":"R. Ahlswede","year":"1995","unstructured":"Ahlswede, R., Bezrukov, S.L.: Edge Isoperimetric Theorems for Integer Point Arrays. Applied Mathematics Letters\u00a08, 75\u201380 (1995)","journal-title":"Applied Mathematics Letters"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1070\/SM1989v063n01ABEH003261","volume":"63","author":"S.L. Bezrukov","year":"1989","unstructured":"Bezrukov, S.L.: Construction of the Solutions of a Discrete Isoperimetric Problem in a Hamming Space. Mathematics USSR-Sbornik\u00a063, 81\u201396 (1989)","journal-title":"Mathematics USSR-Sbornik"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0403004","volume":"3","author":"B. Bollobas","year":"1990","unstructured":"Bollobas, B., Leader, I.: An Isoperimetric Inequality on the Discrete Torus. SIAM Journal on Discrete Mathematics\u00a03, 32\u201337 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/1247069.1247085","volume-title":"SoCG 2007. Proc. 23rd Annual Symposium on Computational Geometry","author":"A. Dumitrescu","year":"2007","unstructured":"Dumitrescu, A., Suzuki, I., Zylinski, P.: Offline Variants of the \u201cLion and Man\u201d Problem. In: SoCG 2007. Proc. 23rd Annual Symposium on Computational Geometry, pp. 102\u2013111. ACM Press, New York (2007)"},{"key":"8_CR6","first-page":"927","volume-title":"SODA 2000. (Proc. 11th ACM-SIAM Symposium on Discrete Algorithms)","author":"A. Efrat","year":"2000","unstructured":"Efrat, A., Guibas, L.J., Har-Peled, S., Lin, D.C., Mitchell, J.S.B., Murali, T.M.: Sweeping a Polygon with a Chain of Guards. In: SODA 2000 (Proc. 11th ACM-SIAM Symposium on Discrete Algorithms), pp. 927\u2013936. ACM-Press, New York (2000)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0317009","volume":"17","author":"S. Gal","year":"1979","unstructured":"Gal, S.: Search Problems with Mobile and Immobile Hider. SIAM Journal on Control and Optimization\u00a017, 99\u2013122 (1979)","journal-title":"SIAM Journal on Control and Optimization"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(95)80012-3","volume":"143","author":"A.S. Goldstein","year":"1995","unstructured":"Goldstein, A.S., Reingold, E.M.: The Complexity of Pursuit on a Graph. Theoretical Computer Science\u00a0143, 93\u2013112 (1995)","journal-title":"Theoretical Computer Science"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1142\/S0218195999000273","volume":"9","author":"L.J. Guibas","year":"1999","unstructured":"Guibas, L.J., Latombe, J.-C., LaValle, S.M., Lin, D., Motwani, R.: A Visibility-Bases Pursuit-Evasion Problem. International Journal of Computational Geometry and Applications\u00a09, 471\u2013493 (1999)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"8_CR10","first-page":"1","volume":"1","author":"F. Harary","year":"1976","unstructured":"Harary, F., Harborth, H.: Extremal Animals. Journal of Combinatorics, Information & System Science\u00a01, 1\u20138 (1976)","journal-title":"Journal of Combinatorics, Information & System Science"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/3-540-48224-5_38","volume-title":"Automata, Languages and Programming","author":"S.-M. Park","year":"2001","unstructured":"Park, S.-M., Lee, J.-H., Chwa, K.-Y.: Visibility-Based Pursuit-Evasion in a Polygonal Region by a Single Searcher. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 456\u2013468. Springer, Heidelberg (2001)"},{"key":"8_CR12","series-title":"LNM","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/BFb0070400","volume-title":"Theory and Application of Graphs","author":"T.D. Parsons","year":"1978","unstructured":"Parsons, T.D.: Pursuit-Evasion in a Graph. In: Alavi, Y., Lick, D. (eds.) Theory and Application of Graphs. Proc. International Conference Kalamazoo 1976. LNM, pp. 426\u2013441. Springer, Heidelberg (1978)"},{"key":"8_CR13","unstructured":"Parsons, T.D.: The Search Number of a Connected Graph, Congressus Numerantium. In: Proc. 9th Southeastern Conference on Combinatorics, Graph Theory, and Computing, vol.\u00a021, pp. 549\u2013554 (1978)"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/S0304-3975(00)00411-4","volume":"259","author":"J. Sgall","year":"2001","unstructured":"Sgall, J.: Solution to David Gale\u2019s Lion and Man Problem. Theoretical Computer Science\u00a0259, 663\u2013670 (2001)","journal-title":"Theoretical Computer Science"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1137\/0221051","volume":"21","author":"I. Suzuki","year":"1992","unstructured":"Suzuki, I., Yamashita, M.: Searching for a Mobile Intruder in a Polygonal Region. SIAM Journal on Computing\u00a021, 863\u2013888 (1992)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:01:30Z","timestamp":1619521290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771180"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_8","relation":{},"subject":[]}}