{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T06:12:23Z","timestamp":1774764743129,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,2,19]],"date-time":"2014-02-19T00:00:00Z","timestamp":1392768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10878-014-9712-6","type":"journal-article","created":{"date-parts":[[2014,2,18]],"date-time":"2014-02-18T08:58:25Z","timestamp":1392713905000},"page":"541-564","source":"Crossref","is-referenced-by-count":20,"title":["Zero-visibility cops and robber and the pathwidth of a graph"],"prefix":"10.1007","volume":"29","author":[{"given":"Dariusz","family":"Dereniowski","sequence":"first","affiliation":[]},{"given":"Danny","family":"Dyer","sequence":"additional","affiliation":[]},{"given":"Ryan M.","family":"Tifenbach","sequence":"additional","affiliation":[]},{"given":"Boting","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,19]]},"reference":[{"key":"9712_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1017\/S0963548303005625","volume":"12","author":"M Adler","year":"2003","unstructured":"Adler M, R\u00e4cke H, Sivadasan N, Sohler C, V\u00f6cking B (2003) Randomized pursuit-evasion in graphs. Comb Probab Comput 12:225\u2013244","journal-title":"Comb Probab Comput"},{"key":"9712_CR2","doi-asserted-by":"crossref","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. Discret Appl Math 8:1\u201312","journal-title":"Discret Appl Math"},{"key":"9712_CR3","unstructured":"Alspach B (2004) Searching and sweeping graphs: a brief survey. Le Matematiche 59:5\u201337, universit\u00e0 di Catania"},{"key":"9712_CR4","doi-asserted-by":"crossref","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"},{"key":"9712_CR5","doi-asserted-by":"crossref","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":"9712_CR6","doi-asserted-by":"crossref","first-page":"1421","DOI":"10.1016\/j.disc.2012.01.002","volume":"312","author":"N Clarke","year":"2012","unstructured":"Clarke N, MacGillivray G (2012) Characterizations of k-copwin graphs. Discret Math 312:1421\u20131425","journal-title":"Discret Math"},{"key":"9712_CR7","doi-asserted-by":"crossref","unstructured":"Clarke N, Fiorini S, Joret G, Theis D (2014) A note on the cops & robber game on graphs embedded in non-orientable surfaces. Graph Combinator 30:119\u2013124","DOI":"10.1007\/s00373-012-1246-z"},{"key":"9712_CR8","doi-asserted-by":"crossref","first-page":"1709","DOI":"10.1137\/110826424","volume":"26","author":"D Dereniowski","year":"2012","unstructured":"Dereniowski D (2012) From pathwidth to connected pathwidth. SIAM J Discret Math 26:1709\u20131732","journal-title":"SIAM J Discret Math"},{"key":"9712_CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Paths, trees, and flowers. Can J Math 17:449\u2013467","journal-title":"Can J Math"},{"key":"9712_CR10","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1006\/inco.1994.1064","volume":"113","author":"J Ellis","year":"1994","unstructured":"Ellis J, Sudborough I, Turner J (1994) The vertex separation and search number of a graph. Inf Comput 113:50\u201379","journal-title":"Inf Comput"},{"key":"9712_CR11","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F Fomin","year":"2008","unstructured":"Fomin F, Thilikos D (2008) An annotated bibliography on guaranteed graph searching. Theor Comput Sci 399:236\u2013245","journal-title":"Theor Comput Sci"},{"key":"9712_CR12","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/S0895480104442169","volume":"20","author":"V Isler","year":"2006","unstructured":"Isler V, Kannan S, Khanna S (2006) Randomized pursuit-evasion with local visibility. SIAM J Discret Math 20:26\u201341","journal-title":"SIAM J Discret Math"},{"key":"9712_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.tcs.2008.02.041","volume":"399","author":"V Isler","year":"2008","unstructured":"Isler V, Karnad N (2008) The role of information in the cop-robber game. Theor Comput Sci 399:179\u2013190","journal-title":"Theor Comput Sci"},{"key":"9712_CR14","unstructured":"Jeliazkova D (2006) Aspects of the cops and robber game played with incomplete information. Master\u2019s thesis, Acadia University"},{"issue":"2","key":"9712_CR15","first-page":"40","volume":"5","author":"G Joret","year":"2010","unstructured":"Joret G, Kaminski M, Theis DO (2010) The cops and robber game on graphs with forbidden (induced) subgraphs. Contrib Discret Math 5(2):40\u201351","journal-title":"Contrib Discret Math"},{"key":"9712_CR16","doi-asserted-by":"crossref","unstructured":"Kehagias A, Pra\u0142at P (2012) Some remarks on cops and drunk robbers. Theor Comput Sci 463:133\u2013147","DOI":"10.1016\/j.tcs.2012.08.016"},{"key":"9712_CR17","doi-asserted-by":"crossref","unstructured":"Kehagias A, Mitsche D, Pra\u0142at P (2013a) Cops and invisible robbers: the cost of drunkenness. Theor Comput Sci 481:100\u2013120","DOI":"10.1016\/j.tcs.2013.01.032"},{"key":"9712_CR18","unstructured":"Kehagias A, Mitsche D, Pra\u0142at P (2013b) The role of visibility in the cops-robber game and robotic pursuit\/evasion. http:\/\/www.math.ryerson.ca\/~pralat\/papers\/2013_COV_ICRA.pdf"},{"key":"9712_CR19","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","volume":"42","author":"N Kinnersley","year":"1992","unstructured":"Kinnersley N (1992) The vertex separation number of a graph equals its path-width. Inf Process Lett 42:345\u2013350","journal-title":"Inf Process Lett"},{"key":"9712_CR20","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(85)90046-9","volume":"55","author":"L Kirousis","year":"1985","unstructured":"Kirousis L, Papadimitriou C (1985) Interval graphs and searching. Discret Math 55:181\u2013184","journal-title":"Discret Math"},{"key":"9712_CR21","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A LaPaugh","year":"1993","unstructured":"LaPaugh A (1993) Recontamination does not help to search a graph. J ACM 40:224\u2013245","journal-title":"J ACM"},{"key":"9712_CR22","doi-asserted-by":"crossref","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. Discret Math 43:235\u2013239","journal-title":"Discret Math"},{"key":"9712_CR23","doi-asserted-by":"crossref","unstructured":"Parsons T (1978) Pursuit-evasion in a graph. In: Proceedings of the International Conference on the Theory and Applications of Graphs. Lecture Notes in Mathematics , vol 642. Springer, pp 426\u2013441","DOI":"10.1007\/BFb0070400"},{"key":"9712_CR24","unstructured":"Quilliot A (1983) Probl\u00e8mes de jeux, de point fixe, de connectivit\u00e9 et de repr\u00e9sentation sur des graphes, des ensembles ordonn\u00e9s et des hypergraphes. PhD thesis, Universit\u00e9 de Paris VI"},{"key":"9712_CR25","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N Robertson","year":"1983","unstructured":"Robertson N, Seymour P (1983) Graph minors. I. Excluding a forest. J Comb Theory Ser B 35:39\u201361","journal-title":"J Comb Theory Ser B"},{"key":"9712_CR26","doi-asserted-by":"crossref","unstructured":"Schr\u00f6der B (2001) The copnumber of a graph is bounded by $$\\lfloor \\frac{3}{2} \\text{ genus }({G}) \\rfloor + 3$$ \u230a 3 2 genus ( G ) \u230b + 3 . In: Categorical perspectives. Trends in mathematics. Birkh\u00e4user Boston, Boston, pp 243\u2013263","DOI":"10.1007\/978-1-4612-1370-3_14"},{"key":"9712_CR27","unstructured":"Tang A (2004) Cops and robber with bounded visibility. Master\u2019s thesis, Dalhousie University"},{"key":"9712_CR28","unstructured":"To\u0161i\u0107 R (1985) Inductive classes of graphs. In: Proceedings of the sixth Yugoslav seminar on graph theory, University of Novi Sad, pp 233\u2013237"},{"key":"9712_CR29","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10878-006-9013-9","volume":"13","author":"B Yang","year":"2007","unstructured":"Yang B (2007) Strong-mixed searching and pathwidth. J Comb Optim 13:47\u201359","journal-title":"J Comb Optim"},{"key":"9712_CR30","doi-asserted-by":"crossref","first-page":"5770","DOI":"10.1016\/j.disc.2008.05.033","volume":"309","author":"B Yang","year":"2009","unstructured":"Yang B, Dyer D, Alspach B (2009) Sweeping graphs with large clique number. Discret Math 309:5770\u20135780","journal-title":"Discret Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9712-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9712-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9712-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T18:35:18Z","timestamp":1565202918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9712-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,19]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9712"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9712-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,19]]}}}