{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:11Z","timestamp":1759638491445,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T00:00:00Z","timestamp":1613520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T00:00:00Z","timestamp":1613520000000},"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-2017-05336","RGPIN-2018-06800"],"award-info":[{"award-number":["RGPIN-2017-05336","RGPIN-2018-06800"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10878-021-00710-8","type":"journal-article","created":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T11:53:51Z","timestamp":1613735631000},"page":"1545-1570","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A simple method for proving lower bounds in the zero-visibility cops and robber game"],"prefix":"10.1007","volume":"43","author":[{"given":"Yuan","family":"Xue","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2259-4271","authenticated-orcid":false,"given":"Boting","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Sandra","family":"Zilles","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,17]]},"reference":[{"key":"710_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 (1984) A game of cops and robbers. Discrete Appl Math 8:1\u201312","journal-title":"Discrete Appl Math"},{"key":"710_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D Bienstock","year":"1991","unstructured":"Bienstock D, Seymour P (1991) Monotonicity in graph searching. J Algorithms 12:239\u2013245","journal-title":"J Algorithms"},{"issue":"1","key":"710_CR3","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":"710_CR4","first-page":"47","volume":"11","author":"A Bonato","year":"2020","unstructured":"Bonato A, Mohar B (2020) Topological directions in cops and robbers. J Combin 11:47\u201364","journal-title":"J Combin"},{"key":"710_CR5","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"},{"key":"710_CR6","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1007\/978-1-4419-7997-1_76","volume-title":"Handbook of combinatorial optimization","author":"A Bonato","year":"2013","unstructured":"Bonato A, Yang B (2013) Graph searching and related problems. In: Pardalos P, Ding-Zhu D, Graham R (eds) Handbook of combinatorial optimization, 2nd edn. Springer, Berlin, pp 1511\u20131558","edition":"2"},{"key":"710_CR7","doi-asserted-by":"crossref","unstructured":"Bonato A, Huggan M, Marbach T, McInerney F (2020) The game of cops and eternal robbers. arXiv:2003.03791 [cs.DM]","DOI":"10.1016\/j.tcs.2021.05.014"},{"key":"710_CR8","series-title":"Graduate texts in mathematics series","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory. Graduate texts in mathematics series. Springer, Berlin"},{"key":"710_CR9","unstructured":"Bradshaw P, Hosseini S.A, Mohar B, Stacho L (2020) On the cop number of graphs of high girth. arXiv:2005.10849 [math.CO"},{"key":"710_CR10","doi-asserted-by":"crossref","unstructured":"Dereniowski D, Dyer D, Tifenbach R, Yang B (2015a) Zero-visibility cops & robber and the pathwidth of a graph. J Combin Optim 29:541\u2013564","DOI":"10.1007\/s10878-014-9712-6"},{"key":"710_CR11","doi-asserted-by":"crossref","unstructured":"Dereniowski D, Dyer D, Tifenbach R, Yang B (2015b) The complexity of zero-visibility cops and robber. Theoret Comput Sci 607:135\u2013148","DOI":"10.1016\/j.tcs.2015.03.022"},{"key":"710_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-019-00417-x","author":"Z Gao","year":"2019","unstructured":"Gao Z, Yang B (2019) The one-cop-moves game on planar graphs. J Combin Optim. https:\/\/doi.org\/10.1007\/s10878-019-00417-x","journal-title":"J Combin Optim"},{"key":"710_CR13","unstructured":"Jeliazkova D (2006) Aspects of the cops and robber game played with incomplete information. Master\u2019s thesis, Acadia University"},{"key":"710_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.jctb.2014.11.002","volume":"111","author":"W Kinnersley","year":"2015","unstructured":"Kinnersley W (2015) Cops and robbers is EXPTIME-complete. J Combin Theory Ser B 111:201\u2013220","journal-title":"J Combin Theory Ser B"},{"key":"710_CR15","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"LM Kirousis","year":"1986","unstructured":"Kirousis LM, Papadimitriou CH (1986) Searching and pebbling. Theoret Comput Sci 47:205\u2013218","journal-title":"Theoret Comput Sci"},{"key":"710_CR16","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"},{"key":"710_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":"710_CR18","unstructured":"Tang A (2004) Cops and robber with bounded visibility. Master\u2019s thesis, Dalhousie University"},{"key":"710_CR19","unstructured":"To\u0161i\u0107 R (1985) Vertex-to-vertex search in a graph. Graph Theory (Dubrovnik 1985), pp 233\u2013237"},{"key":"710_CR20","doi-asserted-by":"crossref","unstructured":"Xue Y, Yang B, Zilles S (2019a) New Results on the zero-visibility cops and robber game. In: Proceedings of the 13th international conference on algorithmic aspects in information and management. Lecture notes in computer science 11640. Springer, pp 316\u2013328","DOI":"10.1007\/978-3-030-27195-4_29"},{"key":"710_CR21","doi-asserted-by":"crossref","unstructured":"Xue Y, Yang B, Zhong F, Zilles S (2019b) A partition approach to lower bounds for zero-visibility cops and robber. In: Proceedings of the 30th international workshop on combinatorial algorithms. Lecture notes in computer science 11638. Springer, pp. 442\u2013454","DOI":"10.1007\/978-3-030-25005-8_36"},{"key":"710_CR22","doi-asserted-by":"crossref","unstructured":"Yang B, Akter T (2020) Computing the one-visibility copnumber of trees. In: Proceedings of the 14th international conference on algorithmic aspects in information and management. Lecture notes in computer science 12290. Springer, pp 411\u2013423","DOI":"10.1007\/978-3-030-57602-8_37"},{"key":"710_CR23","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1016\/j.tcs.2008.08.025","volume":"407","author":"B Yang","year":"2008","unstructured":"Yang B, Cao Y (2008) Monotonicity in digraph search problems. Theoret Comput Sci 407:532\u2013544","journal-title":"Theoret Comput Sci"},{"key":"710_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. Theoret Comput Sci 588:96\u2013113","journal-title":"Theoret Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00710-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00710-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00710-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T18:02:12Z","timestamp":1657735332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00710-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,17]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["710"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00710-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,2,17]]},"assertion":[{"value":"6 February 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}