{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T20:09:08Z","timestamp":1778357348141,"version":"3.51.4"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100007493","name":"Mathematical Foundation Jacques Hadamard","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007493","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-16-IDEX-0001"],"award-info":[{"award-number":["ANR-16-IDEX-0001"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-21-CE48-0004"],"award-info":[{"award-number":["ANR-21-CE48-0004"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.tcs.2026.115946","type":"journal-article","created":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T16:47:21Z","timestamp":1775666841000},"page":"115946","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Hunting a rabbit: Complexity, approximability and some characterizations"],"prefix":"10.1016","volume":"1075","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2865-1123","authenticated-orcid":false,"given":"Walid","family":"Ben-Ameur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harmender","family":"Gahlawat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1932-8167","authenticated-orcid":false,"given":"Alessandro","family":"Maddaloni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2026.115946_bib0001","article-title":"Finding a princess in a palace: a pursuit-evasion problem","volume":"20","author":"Britnell","year":"2013","journal-title":"Electr. J. Comb."},{"key":"10.1016\/j.tcs.2026.115946_bib0002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disc.2013.09.004","article-title":"An evasion game on a graph","volume":"314","author":"Haslegrave","year":"2014","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2026.115946_bib0003","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.ejc.2015.08.002","article-title":"How to hunt an invisible rabbit on a graph","volume":"52","author":"Abramovskaya","year":"2016","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.tcs.2026.115946_bib0004","unstructured":"V. Gruslys, A. M\u00e9roueh, Catching a mouse on a tree, arXiv e-prints (2015) 10.48550\/arXiv.1502.06591."},{"issue":"2","key":"10.1016\/j.tcs.2026.115946_bib0005","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.disc.2018.10.011","article-title":"Hunting rabbits on the hypercube","volume":"342","author":"Bolkema","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2026.115946_bib0006","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2025.105302","article-title":"Further results on the hunters and rabbit game through monotonicity","volume":"305","author":"Dissaux","year":"2025","journal-title":"Inf. Comput."},{"key":"10.1016\/j.tcs.2026.115946_bib0007","unstructured":"J. Althoetmar, J. Schade, T. Sch\u00fcrenberg, Complexity of firefighting on graphs, 2025, https:\/\/arxiv.org\/abs\/2505.11082."},{"issue":"3","key":"10.1016\/j.tcs.2026.115946_bib0008","article-title":"Searching for an intruder on graphs and their subdivisions","volume":"29","author":"Anton Bernshteyn","year":"2022","journal-title":"Electr. J. Comb."},{"issue":"2","key":"10.1016\/j.tcs.2026.115946_bib0009","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1002\/net.22234","article-title":"A cops and robber game and the meeting time of synchronous directed walks","volume":"84","author":"Ben-Ameur","year":"2024","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.tcs.2026.115946_bib0010","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1002\/net.22284","article-title":"Complexity results for a cops and robber game on directed graphs","volume":"86","author":"Ben-Ameur","year":"2025","journal-title":"Networks"},{"key":"10.1016\/j.tcs.2026.115946_bib0011","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.dam.2022.12.008","article-title":"The no-meet matroid","volume":"354","author":"Ben-Ameur","year":"2024","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115946_bib0012","series-title":"An Invitation to Pursuit-Evasion Games and Graph Theory","author":"Bonato","year":"2020"},{"key":"10.1016\/j.tcs.2026.115946_bib0013","series-title":"Jeux et Pointes Fixes Sur Les Graphes","author":"Quillot","year":"1978"},{"issue":"2","key":"10.1016\/j.tcs.2026.115946_bib0014","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\/j.tcs.2026.115946_bib0015","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.jctb.2014.11.002","article-title":"Cops and robbers is EXPTIME-complete","volume":"111","author":"Kinnersley","year":"2015","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"10.1016\/j.tcs.2026.115946_bib0016","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1006\/jctb.1993.1027","article-title":"Graph searching and a min-max theorem for tree-width","volume":"58","author":"Seymour","year":"1993","journal-title":"J. Comb. Theory Ser. B"},{"key":"10.1016\/j.tcs.2026.115946_bib0017","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/BFb0070400","article-title":"Pursuit-evasion in a graph","volume":"642","author":"Parsons","year":"1978","journal-title":"Theory Appl. Graphs LNCS"},{"issue":"1","key":"10.1016\/j.tcs.2026.115946_bib0018","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s00373-005-0627-y","article-title":"Directed path-width and monotonicity in digraph searching","volume":"22","author":"Bar\u00e1t","year":"2006","journal-title":"Graphs Comb."},{"issue":"1","key":"10.1016\/j.tcs.2026.115946_bib0019","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1006\/jctb.2000.2031","article-title":"Directed tree-width","volume":"82","author":"Johnson","year":"2001","journal-title":"J. Comb. Theory Ser. B"},{"key":"10.1016\/j.tcs.2026.115946_bib0020","series-title":"Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm","first-page":"814","article-title":"DAG-width: connectivity measure for directed graphs","author":"Obdr\u017e\u00e1lek","year":"2006"},{"issue":"2","key":"10.1016\/j.tcs.2026.115946_bib0021","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1002\/jgt.21894","article-title":"DAG-width and circumference of digraphs","volume":"82","author":"Bang-Jensen","year":"2016","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/j.tcs.2026.115946_bib0022","first-page":"54","article-title":"A cover-based approach to multi-agent moving target pursuit","volume":"4","author":"Alejandro Isaza","year":"2021","journal-title":"Proc. AAAI Conf. Artif. Intell. Interact. Digital Entertain."},{"key":"10.1016\/j.tcs.2026.115946_bib0023","doi-asserted-by":"crossref","DOI":"10.1007\/s10514-011-9241-4","article-title":"Search and pursuit-evasion in mobile robotics","volume":"31","author":"Chung","year":"2011","journal-title":"Auton. Rob."},{"issue":"4","key":"10.1016\/j.tcs.2026.115946_bib0024","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1016\/S0022-0000(03)00030-8","article-title":"Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width","volume":"66","author":"Gottlob","year":"2003","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115946_bib0025","first-page":"516","article-title":"Network decontamination","volume":"11340","author":"Nisse","year":"2019","journal-title":"In Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro, editors. Distrib. Comput. Mobile Entities Current Res. Moving Comput."},{"key":"10.1016\/j.tcs.2026.115946_bib0026","series-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"3","key":"10.1016\/j.tcs.2026.115946_bib0027","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(92)90140-Q","article-title":"Finding good approximate vertex and edge partitions is NP-hard","volume":"42","author":"Bui","year":"1992","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"10.1016\/j.tcs.2026.115946_bib0028","doi-asserted-by":"crossref","first-page":"119","DOI":"10.7155\/jgaa.00179","article-title":"Vertex bisection is hard, too","volume":"13","author":"Brandes","year":"2009","journal-title":"J. Graph Algorithms Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002057?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002057?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T19:30:19Z","timestamp":1778355019000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":28,"alternative-id":["S0304397526002057"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115946","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hunting a rabbit: Complexity, approximability and some characterizations","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115946","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115946"}}