{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:38Z","timestamp":1759638938122},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922476"},{"type":"electronic","value":"9783540922483"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92248-3_28","type":"book-chapter","created":{"date-parts":[[2008,12,4]],"date-time":"2008-12-04T08:36:17Z","timestamp":1228379777000},"page":"312-323","source":"Crossref","is-referenced-by-count":1,"title":["Fast Robber in Planar Graphs"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Nisse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karol","family":"Suchan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_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 Applied Mathematics\u00a08, 1\u201312 (1984)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"28_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/0095-8956(88)90093-7","volume":"44","author":"R.P. Anstee","year":"1988","unstructured":"Anstee, R.P., Farber, M.: On bridged graphs and cop-win graphs. J. Comb. Theory, Ser. B\u00a044(1), 22\u201328 (1988)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"28_CR3","unstructured":"Alspach, B.: Searching and sweeping graphs: a brief survey. In: Le Matematiche, pp. 5\u201337 (2004)"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0166-218X(84)90012-X","volume":"9","author":"T. Andreae","year":"1984","unstructured":"Andreae, T.: Note on a pursuit game played on graphs. Discrete Applied Mathematics\u00a09, 111\u2013115 (1984)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0095-8956(86)90026-2","volume":"41","author":"T. Andreae","year":"1986","unstructured":"Andreae, T.: On a pursuit game played on graphs for which a minor is excluded. J. Comb. Theory, Ser. B\u00a041(1), 37\u201347 (1986)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1006\/aama.1993.1019","volume":"14","author":"A. Berarducci","year":"1993","unstructured":"Berarducci, A., Intrigila, B.: On the cop number of a graph. Adv. in Applied Math.\u00a014, 389\u2013403 (1993)","journal-title":"Adv. in Applied Math."},{"issue":"1-2","key":"28_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial -arboretum of graphs with bounded treewidth. Theor. Comput. Sci.\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1006\/jctb.1996.1726","volume":"69","author":"V. Chepoi","year":"1997","unstructured":"Chepoi, V.: Bridged graphs are cop-win graphs: An algorithmic proof. J. Comb. Theory, Ser. B\u00a069(1), 97\u2013100 (1997)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"28_CR9","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0012-365X(87)90100-2","volume":"66","author":"M. Farber","year":"1987","unstructured":"Farber, M.: Bridged graphs and geodesic convexity. Discrete Applied Mathematics\u00a066, 249\u2013257 (1987)","journal-title":"Discrete Applied Mathematics"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0166-218X(87)90033-3","volume":"17","author":"P. Frankl","year":"1987","unstructured":"Frankl, P.: Cops and robbers in graphs with large girth and cayley graphs. Discrete Applied Mathematics\u00a017, 301\u2013305 (1987)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","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. Theor. Comput. Sci.\u00a0143(1), 93\u2013112 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"2492","DOI":"10.1016\/j.disc.2005.12.038","volume":"306","author":"G. Hahn","year":"2006","unstructured":"Hahn, G., MacGillivray, G.: A note on k-cop, l-robber games on graphs. Discrete Math.\u00a0306, 2492\u20132497 (2006)","journal-title":"Discrete Math."},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Nisse, N., Suchan, K.: Fast robber in planar graphs. Technical Report, CMM-B-08\/03-200, Santiago, Chili (March 2008)","DOI":"10.1007\/978-3-540-92248-3_28"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"R.J. Nowakowski","year":"1983","unstructured":"Nowakowski, R.J., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Mathematics\u00a043, 235\u2013239 (1983)","journal-title":"Discrete Mathematics"},{"key":"28_CR16","unstructured":"Quilliot, A.: Th\u00e8se de doctorat d\u2019\u00e9tat. Ph.D thesis, Universit\u00e9 de Paris VI, France (1983)"},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0095-8956(85)90093-0","volume":"38","author":"A. Quilliot","year":"1985","unstructured":"Quilliot, A.: A short note about pursuit games played on a graph with a given genus. J. Comb. Theory, Ser. B\u00a038(1), 89\u201392 (1985)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Schr\u00f6der, B.S.W.: The copnumber of a graph is bounded by $\\lfloor \\frac{3}{2} genus (g) \\rfloor + 3$ . Trends Math., 243\u2013263 (2001)","DOI":"10.1007\/978-1-4612-1370-3_14"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92248-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T20:17:28Z","timestamp":1557951448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92248-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922476","9783540922483"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92248-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}