{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T11:31:12Z","timestamp":1775734272823,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642137303","type":"print"},{"value":"9783642137310","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_26","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"273-284","source":"Crossref","is-referenced-by-count":3,"title":["Cops and Robber Game without Recharging"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[]},{"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(84)90073-8","volume":"8","author":"M. Aigner","year":"1984","unstructured":"Aigner, M., Fromme, M.: A game of cops and robbers. Discrete Appl. Math.\u00a08, 1\u201311 (1984)","journal-title":"Discrete Appl. Math."},{"key":"26_CR2","first-page":"5","volume":"59","author":"B. Alspach","year":"2006","unstructured":"Alspach, B.: Searching and sweeping graphs: a brief survey. Matematiche (Catania)\u00a059, 5\u201337 (2006)","journal-title":"Matematiche (Catania)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/1247069.1247085","volume-title":"Proceedings of the 23d annual symposium on Computational Geometry (SCG 07)","author":"A. Dumitrescu","year":"2007","unstructured":"Dumitrescu, A., Suzuki, I., Zylinski, P.: Offline variants of the \u201dlion and man\u201d problem. In: Proceedings of the 23d annual symposium on Computational Geometry (SCG 07), pp. 102\u2013111. ACM, New York (2007)"},{"key":"26_CR4","series-title":"IFIP","first-page":"171","volume-title":"IFIP TCS","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Golovach, P.A., Kratochv\u00edl, J.: On tractability of cops and robbers game. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, C.-H.L. (eds.) IFIP TCS. IFIP, vol.\u00a0273, pp. 171\u2013185. Springer, Heidelberg (2008)"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci.\u00a0399, 236\u2013245 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR6","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. W. H. Freeman and Co, San Francisco (1979); A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences"},{"key":"26_CR7","first-page":"1536","volume-title":"Proceedings of the 18th international joint conference on Artificial Intelligence (IJCAI \u201903)","author":"M. Goldenberg","year":"2003","unstructured":"Goldenberg, M., Kovarsky, A., Wu, X., Schaeffer, J.: Multiple agents moving target search. In: Proceedings of the 18th international joint conference on Artificial Intelligence (IJCAI \u201903), pp. 1536\u20131538. Morgan Kaufmann Publishers Inc., San Francisco (2003)"},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(95)80026-6","volume":"143","author":"A.S. Goldstein","year":"1995","unstructured":"Goldstein, A.S., Reingold, E.M.: The complexity of pursuit on a graph. Theoret. Comput. Sci.\u00a0143, 93\u2013112 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1142\/S0218195999000273","volume":"9","author":"L.J. Guibas","year":"1996","unstructured":"Guibas, L.J., Claude Latombe, J., Lavalle, S.M., Lin, D., Motwani, R.: A visibility-based pursuit-evasion problem. International Journal of Computational Geometry and Applications\u00a09, 471\u2013494 (1996)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"26_CR10","volume-title":"Differential games. A mathematical theory with applications to warfare and pursuit, control and optimization","author":"R. Isaacs","year":"1965","unstructured":"Isaacs, R.: Differential games. A mathematical theory with applications to warfare and pursuit, control and optimization. John Wiley & Sons Inc., New York (1965)"},{"key":"26_CR11","unstructured":"Ishida, T., Korf, R.E.: Moving target search. In: Proceedings of the International joint conference on Artificial Intelligence (IJCAI\u201991), pp. 204\u2013211 (1991)"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/34.387507","volume":"17","author":"T. Ishida","year":"1995","unstructured":"Ishida, T., Korf, R.E.: Moving-target search: A real-time search for changing goals. IEEE Trans. Pattern Anal. Mach. Intell.\u00a017, 609\u2013619 (1995)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"26_CR13","volume-title":"Littlewood\u2019s miscellany","author":"J.E. Littlewood","year":"1986","unstructured":"Littlewood, J.E.: Littlewood\u2019s miscellany. Cambridge University Press, Cambridge (1986); Edited and with a foreword by B\u00e9la Bollob\u00e1s"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1541895.1541907","volume":"7","author":"P.K.K. Loh","year":"2009","unstructured":"Loh, P.K.K., Prakash, E.C.: Novel moving target search algorithms for computer gaming. Comput. Entertain.\u00a07, 1\u201316 (2009)","journal-title":"Comput. Entertain."},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N., Hakimi, S.L., Garey, M.R., Johnson, D.S., Papadimitriou, C.H.: The complexity of searching a graph. J. Assoc. Comput. Mach.\u00a035, 18\u201344 (1988)","journal-title":"J. Assoc. Comput. Mach."},{"key":"26_CR16","unstructured":"Moldenhauer, C., Sturtevant, N.R.: Evaluating strategies for running from the cops. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 584\u2013589 (2009)"},{"key":"26_CR17","unstructured":"Moldenhauer, C., Sturtevant, N.R.: Optimal solutions for moving target search. In: Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), IFAAMAS, pp. 1249\u20131250 (2009)"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"R. Nowakowski","year":"1983","unstructured":"Nowakowski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Math.\u00a043, 235\u2013239 (1983)","journal-title":"Discrete Math."},{"key":"26_CR19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0195-6698(86)80017-8","volume":"7","author":"A. Quilliot","year":"1986","unstructured":"Quilliot, A.: Some results about pursuit games on metric spaces obtained through graph theory techniques. European J. Combin.\u00a07, 55\u201366 (1986)","journal-title":"European J. Combin."},{"key":"26_CR20","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 of David Gale\u2019s lion and man problem. Theor. Comput. Sci.\u00a0259, 663\u2013670 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1137\/0219070","volume":"19","author":"K. Sugihara","year":"1990","unstructured":"Sugihara, K., Suzuki, I., Yamashita, M.: The searchlight scheduling problem. SIAM J. Comput.\u00a019, 1024\u20131040 (1990)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:11:15Z","timestamp":1619784675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}