{"id":"https://openalex.org/W7142323781","doi":"https://doi.org/10.1016/j.tcs.2026.115924","title":"Capturing an invisible robber using separators","display_name":"Capturing an invisible robber using separators","publication_year":2026,"publication_date":"2026-03-28","ids":{"openalex":"https://openalex.org/W7142323781","doi":"https://doi.org/10.1016/j.tcs.2026.115924"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2026.115924","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115924","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.tcs.2026.115924","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068817562","display_name":"Igor Potapov","orcid":"https://orcid.org/0000-0002-7192-7853"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Igor Potapov","raw_affiliation_strings":["School of Computer Science & Informatics, University of Liverpool, UK"],"raw_orcid":"https://orcid.org/0000-0002-7192-7853","affiliations":[{"raw_affiliation_string":"School of Computer Science & Informatics, University of Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119820543","display_name":"Tymofii Prokopenko","orcid":"https://orcid.org/0009-0002-1922-7718"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tymofii Prokopenko","raw_affiliation_strings":["School of Computer Science & Informatics, University of Liverpool, UK"],"raw_orcid":"https://orcid.org/0009-0002-1922-7718","affiliations":[{"raw_affiliation_string":"School of Computer Science & Informatics, University of Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067885700","display_name":"John Sylvester","orcid":"https://orcid.org/0000-0002-6543-2934"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"John Sylvester","raw_affiliation_strings":["School of Computer Science & Informatics, University of Liverpool, UK"],"raw_orcid":"https://orcid.org/0000-0002-6543-2934","affiliations":[{"raw_affiliation_string":"School of Computer Science & Informatics, University of Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068817562"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":{"value":2600,"currency":"USD","value_usd":2600},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.31869091,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1074","issue":null,"first_page":"115924","last_page":"115924"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.17170000076293945,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.17170000076293945,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1404000073671341,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12158","display_name":"Guidance and Control Systems","score":0.09470000118017197,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5392000079154968},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47929999232292175},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46149998903274536},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4059000015258789},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.3873000144958496},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.3799999952316284}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5616999864578247},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5392000079154968},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47929999232292175},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46149998903274536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41929998993873596},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4081999957561493},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4059000015258789},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39340001344680786},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3889999985694885},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3873000144958496},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3824999928474426},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.3799999952316284},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.3675999939441681},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3125999867916107},{"id":"https://openalex.org/C130187892","wikidata":"https://www.wikidata.org/wiki/Q133327","display_name":"Spacetime","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2962000072002411},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.26750001311302185}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.tcs.2026.115924","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115924","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.tcs.2026.115924","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2026.115924","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.706028938293457,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G8030194174","display_name":"EPSRC Centre for Doctoral Training in Distributed Algorithms: the what, how and where of next-generation data science","funder_award_id":"EP/S023445/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1833292044","https://openalex.org/W1967263211","https://openalex.org/W1967439097","https://openalex.org/W1980940295","https://openalex.org/W1982180670","https://openalex.org/W2019596029","https://openalex.org/W2028400828","https://openalex.org/W2035417355","https://openalex.org/W2046635105","https://openalex.org/W2053664185","https://openalex.org/W2076164610","https://openalex.org/W2143633463","https://openalex.org/W2952565476","https://openalex.org/W2963555758","https://openalex.org/W2963730044","https://openalex.org/W2997427396","https://openalex.org/W3159363564","https://openalex.org/W4281716834","https://openalex.org/W4323651098"],"related_works":[],"abstract_inverted_index":{"We":[0,56],"study":[1],"the":[2,9,14,23,30,47,53,75,84,93,107],"zero-visibility":[3,48,76,95],"cops":[4,15],"and":[5,69],"robbers":[6],"game,":[7],"where":[8,26,103],"robber":[10,45],"is":[11,33,50],"invisible":[12],"to":[13,88,106,109],"until":[16],"they":[17],"are":[18],"caught.":[19],"This":[20],"differs":[21],"from":[22],"classic":[24],"game":[25],"full":[27],"information":[28],"about":[29],"robber\u2019s":[31],"location":[32],"known":[34,40],"at":[35],"any":[36],"time.":[37],"A":[38],"previously":[39],"solution":[41,60],"for":[42,98],"capturing":[43],"a":[44,63,89],"in":[46,79],"case":[49],"based":[51,61],"on":[52,62,92],"path":[54],"decomposition.":[55],"provide":[57],"an":[58],"alternative":[59,85],"separation":[64],"hierarchy,":[65],"improving":[66],"capture":[67],"time":[68,111],"space":[70],"complexity":[71],"without":[72],"asymptotically":[73],"increasing":[74],"cop":[77,96],"number":[78,97],"most":[80],"cases.":[81],"In":[82],"addition,":[83],"approach":[86],"leads":[87],"better":[90],"bound":[91],"approximate":[94,104],"various":[99],"classes":[100],"of":[101],"graphs,":[102],"refers":[105],"restriction":[108],"polynomial":[110],"computable":[112],"strategies.":[113]},"counts_by_year":[],"updated_date":"2026-08-13T07:04:57.449891","created_date":"2026-03-29T00:00:00"}