{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T05:42:52Z","timestamp":1776577372381,"version":"3.51.2"},"reference-count":32,"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,3,26]],"date-time":"2026-03-26T00:00:00Z","timestamp":1774483200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/S023445\/1"],"award-info":[{"award-number":["EP\/S023445\/1"]}],"id":[{"id":"10.13039\/501100000266","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.115924","type":"journal-article","created":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T16:09:17Z","timestamp":1774714157000},"page":"115924","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Capturing an invisible robber using separators"],"prefix":"10.1016","volume":"1074","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7192-7853","authenticated-orcid":false,"given":"Igor","family":"Potapov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1922-7718","authenticated-orcid":false,"given":"Tymofii","family":"Prokopenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6543-2934","authenticated-orcid":false,"given":"John","family":"Sylvester","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.tcs.2026.115924_bib0001","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.115924_bib0002","series-title":"Jeux et Pointes Fixes Sur Les Graphes","author":"Quilliot","year":"1978"},{"key":"10.1016\/j.tcs.2026.115924_bib0003","article-title":"The Game of Cops and Robbers on Graphs","volume":"61","author":"Bonato","year":"2011"},{"issue":"4","key":"10.1016\/j.tcs.2026.115924_bib0004","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1002\/jgt.20591","article-title":"Variations on cops and robbers","volume":"69","author":"Frieze","year":"2012","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.tcs.2026.115924_bib0005","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.dam.2026.01.017","article-title":"Cops and robbers on multi-layer graphs","volume":"385","author":"Enright","year":"2026","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115924_bib0006","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.dam.2019.12.007","article-title":"Limited visibility cops and robber","volume":"282","author":"Clarke","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115924_bib0007","series-title":"Proceedings of the Sixth Yugoslav Seminar on Graph Theory","first-page":"233","article-title":"Vertex-to-vertex search in a graph","author":"To\u0161i\u0107","year":"1985"},{"key":"10.1016\/j.tcs.2026.115924_bib0008","series-title":"Cops and Robber with Bounded Visibility","author":"Tang","year":"2004"},{"key":"10.1016\/j.tcs.2026.115924_bib0009","series-title":"Frontiers in Algorithmics emphand Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013","first-page":"175","article-title":"Zero-visibility cops and robber game on a graph","volume":"7924","author":"Dereniowski","year":"2013"},{"key":"10.1016\/j.tcs.2026.115924_bib0010","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s10878-014-9712-6","article-title":"Zero-visibility cops and robber and the pathwidth of a graph","volume":"29","author":"Dereniowski","year":"2015","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2026.115924_bib0011","unstructured":"A. Kehagias, A.C. Papazoglou, An algorithm for limited visibility graph searching, (2021). arXiv preprint arXiv: 2105.06150."},{"key":"10.1016\/j.tcs.2026.115924_bib0012","series-title":"Aspects of the Cops and Robber Game Played with Incomplete Information","author":"Jeliazkova","year":"2006"},{"key":"10.1016\/j.tcs.2026.115924_bib0013","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.tcs.2015.03.022","article-title":"The complexity of zero-visibility cops and robber","volume":"607","author":"Dereniowski","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115924_bib0014","series-title":"Combinatorial Algorithms: 30th International Workshop, IWOCA 2019","first-page":"442","article-title":"A partition approach to lower bounds for zero-visibility cops and robber","author":"Xue","year":"2019"},{"key":"10.1016\/j.tcs.2026.115924_bib0015","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.tcs.2022.06.011","article-title":"One-visibility cops and robber on trees: optimal cop-win strategies","volume":"928","author":"Yang","year":"2022","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2026.115924_bib0016","doi-asserted-by":"crossref","first-page":"40","DOI":"10.55016\/ojs\/cdm.v5i2.62032","article-title":"The cops and robber game on graphs with forbidden (induced) subgraphs","volume":"5","author":"Joret","year":"2010","journal-title":"Contrib. Discret. Math."},{"issue":"3","key":"10.1016\/j.tcs.2026.115924_bib0017","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1002\/jgt.22129","article-title":"Cops and robbers on planar-directed graphs","volume":"86","author":"Loh","year":"2017","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.tcs.2026.115924_bib0018","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","article-title":"Applications of a planar separator theorem","volume":"9","author":"Lipton","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115924_bib0019","series-title":"24th Annual European Symposium on Algorithms, ESA 2016","first-page":"15:1","article-title":"Hyperbolic random graphs: separators and treewidth","volume":"57","author":"Bl\u00e4sius","year":"2016"},{"issue":"1","key":"10.1016\/j.tcs.2026.115924_bib0020","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."},{"issue":"3","key":"10.1016\/j.tcs.2026.115924_bib0021","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.disc.2014.10.012","article-title":"Cops and robbers on diameter two graphs","volume":"338","author":"Wagner","year":"2015","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/j.tcs.2026.115924_bib0022","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/S0304-3975(99)00241-8","article-title":"Edge and node searching problems on trees","volume":"240","author":"Peng","year":"2000","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115924_bib0023","series-title":"44th International Colloquium on Automata, Languages, and Programming, ICALP 2017","first-page":"82:1","article-title":"A tight lower bound for the capture time of the cops and robbers game","volume":"80","author":"Brandt","year":"2017"},{"issue":"18","key":"10.1016\/j.tcs.2026.115924_bib0024","doi-asserted-by":"crossref","first-page":"5588","DOI":"10.1016\/j.disc.2008.04.004","article-title":"The capture time of a graph","volume":"309","author":"Bonato","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2026.115924_bib0025","series-title":"Combinatorial Optimization and Applications - 10Th International Conference, COCOA","first-page":"3","article-title":"On the capture time of cops and robbers game on a planar graph","volume":"10043","author":"Pisantechakool","year":"2016"},{"issue":"3","key":"10.1016\/j.tcs.2026.115924_bib0026","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.82.036106","article-title":"Hyperbolic geometry of complex networks","volume":"82","author":"Krioukov","year":"2010","journal-title":"Phys. Rev. E-Stat. Nonlinear Soft Matter Phys."},{"issue":"1","key":"10.1016\/j.tcs.2026.115924_bib0027","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1038\/ncomms1063","article-title":"Sustaining the internet with hyperbolic mapping","volume":"1","author":"Bogun\u00e1","year":"2010","journal-title":"Nat. Commun."},{"key":"10.1016\/j.tcs.2026.115924_bib0028","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.jctb.2018.12.007","article-title":"Treewidth of graphs with balanced separations","volume":"137","author":"Dvor\u00e1k","year":"2019","journal-title":"J. Comb. Theory B"},{"key":"10.1016\/j.tcs.2026.115924_bib0029","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1214\/21-ECP380","article-title":"On the largest component of subcritical random hyperbolic graphs","volume":"26","author":"Diel","year":"2021","journal-title":"Electron. Commun. Probab."},{"issue":"2","key":"10.1016\/j.tcs.2026.115924_bib0030","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1137\/05064299X","article-title":"Improved approximation algorithms for minimum weight vertex separators","volume":"38","author":"Feige","year":"2008","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2026.115924_bib0031","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0020-0190(98)00139-2","article-title":"Approximating the pathwidth of outerplanar graphs","volume":"68","author":"Govindan","year":"1998","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2026.115924_bib0032","series-title":"51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010","first-page":"143","article-title":"Logspace versions of the theorems of bodlaender and courcelle","author":"Elberfeld","year":"2010"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001830?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001830?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T05:06:48Z","timestamp":1776575208000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001830"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":32,"alternative-id":["S0304397526001830"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115924","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":"Capturing an invisible robber using separators","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115924","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115924"}}