{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T20:01:00Z","timestamp":1770753660898,"version":"3.50.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T00:00:00Z","timestamp":1557878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T00:00:00Z","timestamp":1557878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2018-06800"],"award-info":[{"award-number":["RGPIN-2018-06800"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Singapore Ministry of Education Academic Research Fund","award":["MOE2016-T2-1-019"],"award-info":[{"award-number":["MOE2016-T2-1-019"]}]},{"name":"Singapore Ministry of Education Academic Research Fund","award":["R146-000-234-112"],"award-info":[{"award-number":["R146-000-234-112"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10878-019-00417-x","type":"journal-article","created":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T22:30:59Z","timestamp":1557959459000},"page":"442-475","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The one-cop-moves game on planar graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Ziyuan","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2259-4271","authenticated-orcid":false,"given":"Boting","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,15]]},"reference":[{"key":"417_CR1","unstructured":"Abrahamsen M, Holm J, Rotenberg E, Wulff-Nilsen C. Best laid plans of lions and men. Preprint https:\/\/arxiv.org\/pdf\/1703.03687.pdf"},{"key":"417_CR2","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 (1984) A game of cops and robbers. Discrete Appl Math 8:1\u201312","journal-title":"Discrete Appl Math"},{"issue":"6","key":"417_CR3","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1017\/S0963548314000807","volume":"24","author":"D Bal","year":"2015","unstructured":"Bal D, Bonato A, Kinnersley WB, Pralat P (2015) Lazy cops and robbers on hypercubes. Comb Probab Comput 24(6):829\u2013837","journal-title":"Comb Probab Comput"},{"issue":"4","key":"417_CR4","first-page":"627","volume":"7","author":"D Bal","year":"2016","unstructured":"Bal D, Bonato A, Kinnersley WB, Pralat P (2016) Lazy cops and robbers played on random graphs and graphs on surfaces. Int J Comb 7(4):627\u2013642","journal-title":"Int J Comb"},{"key":"417_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-31940-7_3","volume-title":"Graph theory: favorite conjectures and open problems","author":"A Bonato","year":"2016","unstructured":"Bonato A (2016) Conjectures on cops and robbers. In: Gera R, Hedetniemi S, Larson C (eds) Graph theory: favorite conjectures and open problems, vol 1. Springer, Basel, pp 31\u201342"},{"issue":"1","key":"417_CR6","first-page":"110","volume":"12","author":"A Bonato","year":"2017","unstructured":"Bonato A, MacGillivray G (2017) Characterizations and algorithms for generalized cops and robbers games. Contrib Discrete Math 12(1):110\u2013122","journal-title":"Contrib Discrete Math"},{"key":"417_CR7","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 (2011) The game of cops and robbers on graphs. American Mathematical Society, Providence"},{"issue":"4","key":"417_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10514-011-9241-4","volume":"31","author":"TH Chung","year":"2011","unstructured":"Chung TH, Hollinger GA, Isler V (2011) Search and pursuit-evasion in mobile robotics. Auton Robots 31(4):299\u2013316","journal-title":"Auton Robots"},{"key":"417_CR9","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1016\/j.disc.2012.01.002","volume":"312","author":"NE Clarke","year":"2012","unstructured":"Clarke NE, MacGillivray G (2012) Characterizations of k-copwin graphs. Discrete Math 312:1421\u20131425","journal-title":"Discrete Math"},{"key":"417_CR10","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL (2009) Introduction to algorithms. The MIT Press, Cambridge"},{"key":"417_CR11","unstructured":"Isaza A, Lu J, Bulitko V, Greiner R (2008) 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"},{"key":"417_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R Lipton","year":"1979","unstructured":"Lipton R, Tarjan R (1979) A separator theorem for planar graphs. SIAM J Appl Math 36:177\u2013189","journal-title":"SIAM J Appl Math"},{"key":"417_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1002\/jgt.22129","volume":"86","author":"P Loh","year":"2017","unstructured":"Loh P, Oh S (2017) Cops and robbers on planar-directed graphs. J Graph Theory 86:329\u2013340","journal-title":"J Graph Theory"},{"key":"417_CR14","unstructured":"Moldenhauer C, Sturtevant NR (2009) Evaluating strategies for running from the cops. In: Proceedings of the 21st international joint conference on artificial intelligence, IJCAI\u201909, pp 584\u2013589"},{"key":"417_CR15","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 (1983) Vertex to vertex pursuit in a graph. Discrete Math 43:235\u2013239","journal-title":"Discrete Math"},{"issue":"2","key":"417_CR16","first-page":"229","volume":"59","author":"D Offner","year":"2014","unstructured":"Offner D, Okajian K (2014) Variations of cops and robber on the hypercube. Australas J Comb 59(2):229\u2013250","journal-title":"Australas J Comb"},{"key":"417_CR17","unstructured":"Quilliot A (1978) Jeux et pointes fixes sur les graphes. Th\u00e8se de 3\u00e8me cycle, Universit\u00e9 de Paris VI, pp 131\u2013145"},{"key":"417_CR18","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 (1985) A short note about pursuit games played on a graph with a given genus. J Comb Theory Ser B 38:89\u201392","journal-title":"J Comb Theory Ser B"},{"key":"417_CR19","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1016\/j.disc.2016.09.031","volume":"340","author":"KA Sim","year":"2017","unstructured":"Sim KA, Tan TS, Wong KB (2017) Lazy cops and robbers on generalized hypercubes. Discrete Math 340:1693\u20131704","journal-title":"Discrete Math"},{"key":"417_CR20","doi-asserted-by":"crossref","unstructured":"Simard F, Morin M, Quimper C, Laviolette F, Desharnais J (2015) Bounding an optimal search path with a game of cop and robber on graphs. In: Principles and practice of constraint programming: 21st international conference, CP 2015, Cork, Ireland, Aug 31\u2013Sept 4, 2015, proceedings. Springer, pp 403\u2013418","DOI":"10.1007\/978-3-319-23219-5_29"},{"key":"417_CR21","unstructured":"Sullivan BW, Townsend N, Werzanski M. The $$3 \\times 3$$ rooks graph is the unique smallest graph with lazy cop number 3. Preprint arxiv:1606.08485"},{"key":"417_CR22","volume-title":"Introduction to graph theory","author":"DB West","year":"2000","unstructured":"West DB (2000) Introduction to graph theory. Prentice Hall, Upper Saddle River"},{"key":"417_CR23","doi-asserted-by":"crossref","unstructured":"Yang B (2018) The one-cop-moves game on graphs of small treewidth (submitted)","DOI":"10.1007\/978-3-030-36412-0_42"},{"key":"417_CR24","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 (2015) The optimal capture time of the one-cop-moves game. Theor Comput Sci 588:96\u2013113","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00417-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-019-00417-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00417-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T06:31:37Z","timestamp":1635575497000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-019-00417-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,15]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["417"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00417-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,15]]},"assertion":[{"value":"15 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}