{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T05:00:50Z","timestamp":1775538050875,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0020-0190(92)90218-k","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"241-247","source":"Crossref","is-referenced-by-count":15,"title":["Some pursuit-evasion problems on grids"],"prefix":"10.1016","volume":"43","author":[{"given":"Robin W.","family":"Dawes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90218-K_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(84)90073-8","article-title":"A game of cops and robbers","volume":"8","author":"Aigner","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(92)90218-K_BIB2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0166-218X(87)90033-3","article-title":"Cops and robbers in graphs with large girth and Cayley graphs","volume":"17","author":"Frankl","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(92)90218-K_BIB3","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0166-218X(87)90034-5","article-title":"On a game of policeman and robber","volume":"17","author":"Maamoun","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(92)90218-K_BIB4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","article-title":"Vertex-to-vertex pursuit in a graph","volume":"43","author":"Nowakowski","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(92)90218-K_BIB5","first-page":"218","article-title":"On a pursuit-evasion problem related to motion coordination of mobile robots","author":"Sugihara","year":"1988","journal-title":"Proc. 21st Hawaii Internat. Conf. on System Sciences"},{"key":"10.1016\/0020-0190(92)90218-K_BIB6","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1137\/0402013","article-title":"Optimal algorithms for a pursuit-evasion problem in grids","volume":"2","author":"Sugihara","year":"1989","journal-title":"SIAM J. Discrete Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290218K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290218K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:32Z","timestamp":1555129712000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290218K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["002001909290218K"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90218-k","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}