{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:38:31Z","timestamp":1743017911747,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319711461"},{"type":"electronic","value":"9783319711478"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71147-8_14","type":"book-chapter","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T13:33:21Z","timestamp":1510752801000},"page":"199-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Cop Number of the One-Cop-Moves Game on Planar Graphs"],"prefix":"10.1007","author":[{"given":"Ziyuan","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boting","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"key":"14_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. 8, 1\u201312 (1984)","journal-title":"Discrete Appl. Math."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1017\/S0963548314000807","volume":"24","author":"D Bal","year":"2015","unstructured":"Bal, D., Bonato, A., Kinnersley, W.B., Pralat, P.: Lazy cops and robbers on hypercubes. Comb. Probab. Comput. 24, 829\u2013837 (2015)","journal-title":"Comb. Probab. Comput."},{"key":"14_CR3","first-page":"627","volume":"7","author":"D Bal","year":"2016","unstructured":"Bal, D., Bonato, A., Kinnersley, W.B., Pralat, P.: Lazy cops and robbers played on random graphs and graphs on surfaces. Int. J. Comb. 7, 627\u2013642 (2016)","journal-title":"Int. J. Comb."},{"key":"14_CR4","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.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence (2011)"},{"key":"14_CR5","series-title":"Problem Books in Mathematics","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-31940-7_3","volume-title":"Graph Theory","author":"A Bonato","year":"2016","unstructured":"Bonato, A.: Conjectures on cops and robbers. In: Gera, R., Hedetniemi, S., Larson, C. (eds.) Graph Theory. PBM, pp. 31\u201342. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31940-7_3"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10514-011-9241-4","volume":"31","author":"TH Chung","year":"2011","unstructured":"Chung, T.H., Hollinger, G.A., Isler, V.: Search and pursuit-evasion in mobile robotics. Auton. Robots 31, 299\u2013316 (2011)","journal-title":"Auton. Robots"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1016\/j.disc.2012.01.002","volume":"312","author":"NE Clarke","year":"2012","unstructured":"Clarke, N.E., MacGillivray, G.: Characterizations of k-copwin graphs. Discrete Math. 312, 1421\u20131425 (2012)","journal-title":"Discrete Math."},{"key":"14_CR8","unstructured":"Gao, Z., Yang, B.: The cop number of the one-cop-moves game on planar graphs. Preprint. https:\/\/arxiv.org\/pdf\/1705.11184v2.pdf"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Isaza, A., Lu, J., Bulitko, V., Greiner, R.: A cover-based approach to multi-agent moving target pursuit. In: Proceedings of the 4th Conference on Artificial Intelligence and Interactive Digital Entertainment, pp. 54\u201359 (2008)","DOI":"10.1609\/aiide.v4i1.18672"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R Lipton","year":"1979","unstructured":"Lipton, R., Tarjan, R.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1002\/jgt.22129","volume":"86","author":"P Loh","year":"2017","unstructured":"Loh, P., Oh, S.: Cops and robbers on planar directed graphs. J. Graph Theory 86, 329\u2013340 (2017)","journal-title":"J. Graph Theory"},{"key":"14_CR12","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":"14_CR13","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."},{"issue":"2","key":"14_CR14","first-page":"229","volume":"59","author":"D Offner","year":"2014","unstructured":"Offner, D., Okajian, K.: Variations of cops and robber on the hypercube. Australas. J. Comb. 59(2), 229\u2013250 (2014)","journal-title":"Australas. J. Comb."},{"key":"14_CR15","unstructured":"Quilliot, A.: Jeux et pointes fixes sur les graphes. Th\u00e8se de 3\u00e8me cycle, Universit de Paris VI, pp. 131\u2013145 (1978)"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1016\/j.disc.2016.09.031","volume":"340","author":"KA Sim","year":"2017","unstructured":"Sim, K.A., Tan, T.S., Wong, K.B.: Lazy cops and robbers on generalized hypercubes. Discrete Math. 340, 1693\u20131704 (2017)","journal-title":"Discrete Math."},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-319-23219-5_29","volume-title":"Principles and Practice of Constraint Programming","author":"F Simard","year":"2015","unstructured":"Simard, F., Morin, M., Quimper, C.-G., Laviolette, F., Desharnais, J.: Bounding an optimal search path with a game of cop and robber on graphs. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 403\u2013418. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_29"},{"key":"14_CR18","unstructured":"Sullivan, B.W., Townsend, N., Werzanski, M.: The $$3 \\times 3$$ rooks graph is the unique smallest graph with lazy cop number 3. Preprint. https:\/\/arxiv.org\/abs\/1606.08485"},{"key":"14_CR19","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2000)"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2015.04.005","volume":"588","author":"B Yang","year":"2015","unstructured":"Yang, B., Hamilton, W.: The optimal capture time of the one-cop-moves game. Theoret. Comput. Sci. 588, 96\u2013113 (2015)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71147-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:11:45Z","timestamp":1709809905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71147-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711461","9783319711478"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71147-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}