{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:09Z","timestamp":1760202669869},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450297"},{"type":"electronic","value":"9783642450303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_17","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T02:32:52Z","timestamp":1386815572000},"page":"174-184","source":"Crossref","is-referenced-by-count":1,"title":["Cops and Robbers on Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Tom\u00e1s","family":"Gaven\u010diak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00edt","family":"Jel\u00ednek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Klav\u00edk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"17_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.: Game of cops and robbers. Discrete Appl. Math.\u00a08(1), 1\u201312 (1984)","journal-title":"Discrete Appl. Math."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Society (2011)","DOI":"10.1090\/stml\/061"},{"issue":"7-9","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.tcs.2009.12.010","volume":"411","author":"F.V. Fomin","year":"2010","unstructured":"Fomin, F.V., Golovach, P.A., Kratochv\u00edl, J., Nisse, N., Suchan, K.: Pursuing a fast robber on a graph. Theor. Comput. Sci.\u00a0411(7-9), 1167\u20131181 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"5-6","key":"17_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0020-0190(00)00025-9","volume":"73","author":"F. Gavril","year":"2000","unstructured":"Gavril, F.: Maximum weight independent sets and cliques in intersection graphs of filaments. Inf. Process. Lett.\u00a073(5-6), 181\u2013188 (2000)","journal-title":"Inf. Process. Lett."},{"key":"17_CR5","unstructured":"Kratochv\u00edl, J., Goljan, M., Ku\u010dera, P.: String graphs. Rozpravy \u010cSAV.: \u0158ada matem. a p\u0159\u00edrodn\u00edch v\u011bd, Academia (1986)"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(91)90091-W","volume":"52","author":"J. Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. II. recognizing string graphs is NP-hard. Journal of Combinatorial Theory, Series B\u00a052(1), 67\u201378 (1991)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2012.11.041","volume":"477","author":"M. Mamino","year":"2013","unstructured":"Mamino, M.: On the computational complexity of a game of cops and robbers. Theor. Comput. Sci.\u00a0477, 48\u201356 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"McKee, T., McMorris, F.: Topics in Intersection Graph Theory. Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics (1999)","DOI":"10.1137\/1.9780898719802"},{"key":"17_CR9","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":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-74839-7_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Pergel","year":"2007","unstructured":"Pergel, M.: Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 238\u2013247. Springer, Heidelberg (2007)"},{"key":"17_CR11","doi-asserted-by":"publisher","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":"17_CR12","series-title":"Trends Math.","first-page":"243","volume-title":"The copnumber of a graph is bounded by 3\/2 genus(g) + 3","author":"B.S.W. Schroeder","year":"2001","unstructured":"Schroeder, B.S.W.: The copnumber of a graph is bounded by 3\/2 genus(g) + 3. Trends Math., pp. 243\u2013263. Birkh\u00e4user, Boston (2001)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1002\/j.1538-7305.1966.tb01713.x","volume":"45","author":"F.W. Sinden","year":"1966","unstructured":"Sinden, F.W.: Topology of thin film RC-circuits. Bell System Technical Journal\u00a045, 1639\u20131662 (1966)","journal-title":"Bell System Technical Journal"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T10:28:13Z","timestamp":1558780093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}