{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:45:39Z","timestamp":1725839139284},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489703"},{"type":"electronic","value":"9783662489710"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_31","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T04:00:57Z","timestamp":1448510457000},"page":"355-366","source":"Crossref","is-referenced-by-count":1,"title":["Cops and Robbers on String Graphs"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"Gaven\u010diak","sequence":"first","affiliation":[]},{"given":"Przemys\u0142aw","family":"Gordinowicz","sequence":"additional","affiliation":[]},{"given":"V\u00edt","family":"Jel\u00ednek","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Klav\u00edk","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"issue":"1","key":"31_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. 8(1), 1\u201312 (1984)","journal-title":"Discrete Appl. Math."},{"key":"31_CR2","doi-asserted-by":"publisher","DOI":"10.1090\/stml\/061","volume-title":"The Game of Cops and Robbers on Graphs","author":"A Bonato","year":"2011","unstructured":"Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence (2011)"},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s00373-012-1130-x","volume":"29","author":"L Esperet","year":"2013","unstructured":"Esperet, L., Joret, G.: Boxicity of graphs on surfaces. Graphs and Combinatorics 29(3), 417\u2013427 (2013)","journal-title":"Graphs and Combinatorics"},{"issue":"7\u20139","key":"31_CR4","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.tcs.2009.12.010","volume":"411","author":"FV 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. 411(7\u20139), 1167\u20131181 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Gaven\u010diak, T., Gordinowicz, P., Jel\u00ednek, V., Klav\u00edk, P., Kratochv\u00edl, J.: Cops and robbers of intersection graphs (in preparation, 2015)","DOI":"10.1007\/978-3-662-48971-0_31"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-45030-3_17","volume-title":"Algorithms and Computation","author":"Tom\u00e1s Gaven\u010diak","year":"2013","unstructured":"Gaven\u010diak, Tom\u00e1s, Jel\u00ednek, V\u00edt, Klav\u00edk, Pavel, Kratochv\u00edl, Jan: Cops and robbers on intersection graphs. In: Cai, Leizhen, Cheng, Siu-Wing, Lam, Tak-Wah (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 174\u2013184. Springer, Heidelberg (2013)"},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(95)80026-6","volume":"143","author":"AS Goldstein","year":"1995","unstructured":"Goldstein, A.S., Reingold, E.M.: The complexity of pursuit on a graph. Theor. Comput. Sci. 143(1), 93\u2013112 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.jctb.2014.11.002","volume":"111","author":"WB Kinnersley","year":"2015","unstructured":"Kinnersley, W.B.: Cops and robbers is exptime-complete. J. Comb. Theor. Ser. B 111, 201\u2013220 (2015)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"1","key":"31_CR9","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. J. Comb. Theor. Ser. B 52(1), 67\u201378 (1991)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"31_CR10","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. 477, 48\u201356 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR11","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces. The John Hopkins University Press, Baltimore (2001)"},{"key":"31_CR12","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. 43, 235\u2013239 (1983)","journal-title":"Discrete Math."},{"key":"31_CR13","series-title":"Graduate Studies in Mathematics","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/074","volume-title":"Elements of Combinatorial and Differential Topology","author":"V Prasolov","year":"2006","unstructured":"Prasolov, V.: Elements of Combinatorial and Differential Topology. Graduate Studies in Mathematics. American Mathematical Soc., Providence (2006)"},{"key":"31_CR14","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. Combin. Theory Ser. B 38, 89\u201392 (1985)","journal-title":"J. Combin. Theory Ser. B"},{"key":"31_CR15","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-1-4612-1370-3_14"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T23:55:23Z","timestamp":1692143723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}