{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:27Z","timestamp":1763468127679},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_19","type":"book-chapter","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:43:48Z","timestamp":1369097028000},"page":"175-186","source":"Crossref","is-referenced-by-count":3,"title":["Zero-Visibility Cops and Robber Game on a Graph"],"prefix":"10.1007","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","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","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.: Randomized pursuit-evasion in graphs. Combinatorics, Probability and Computing\u00a012, 225\u2013244 (2003)","journal-title":"Combinatorics, Probability and Computing"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D., Seymour, P.: Monotonicity in graph searching. Journal of Algorithms\u00a012, 239\u2013245 (1991)","journal-title":"Journal of Algorithms"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1016\/j.disc.2012.01.002","volume":"312","author":"N.E. Clarke","year":"2012","unstructured":"Clarke, N.E., MacGillivray, G.: Characterizations of k-copwin graphs. Discrete Mathematics\u00a0312, 1421\u20131425 (2012)","journal-title":"Discrete Mathematics"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1137\/110826424","volume":"26","author":"D. Dereniowski","year":"2012","unstructured":"Dereniowski, D.: From pathwidth to connected pathwidth. SIAM Journal on Discrete Mathematics\u00a026, 1709\u20131732 (2012)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"19_CR5","unstructured":"Dereniowski, D., Dyer, D., Tifenbach, R., Yang, B.: The zero-visibility copnumber of a tree (2013)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian Journal of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1994.1064","volume":"113","author":"J.A. Ellis","year":"1994","unstructured":"Ellis, J.A., Sudborough, I.H., Turner, J.S.: The vertex separation and search number of a graph. Information and Computing\u00a0113, 50\u201379 (1994)","journal-title":"Information and Computing"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/S0895480104442169","volume":"20","author":"V. Isler","year":"2006","unstructured":"Isler, V., Kannan, S., Khanna, S.: Randomized pursuit-evasion with local visibility. SIAM Journal on Discrete Mathematics\u00a020, 26\u201341 (2006)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.tcs.2008.02.041","volume":"399","author":"V. Isler","year":"2008","unstructured":"Isler, V., Karnad, N.: The role of information in the cop-robber game. Theoretical Computer Science\u00a0399, 179\u2013190 (2008)","journal-title":"Theoretical Computer Science"},{"key":"19_CR10","unstructured":"Jeliazkova, D.: Aspects of the cops and robber game played with incomplete information. Master\u2019s thesis, Acadia University (2006)"},{"key":"19_CR11","unstructured":"Kehagias, A., Mitche, D., Pra\u0142at, P.: The role of visibility in the cops-robber game and robotic pursuit\/evasion (2012)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","volume":"42","author":"N.G. Kinnersley","year":"1992","unstructured":"Kinnersley, N.G.: The vertex separation number of a graph equals its path-width. Information Processing Letters\u00a042, 345\u2013350 (1992)","journal-title":"Information Processing Letters"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A.S. LaPaugh","year":"1993","unstructured":"LaPaugh, A.S.: Recontamination does not help to search a graph. Journal of the ACM\u00a040, 224\u2013245 (1993)","journal-title":"Journal of the ACM"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"R. Nowakowski","year":"1983","unstructured":"Nowakowski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Mathematics\u00a043, 235\u2013239 (1983)","journal-title":"Discrete Mathematics"},{"key":"19_CR15","unstructured":"Quilliot, A.: 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 (1983)"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N. Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. Journal of Combinatorial Theory, Series B\u00a035, 39\u201361 (1983)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"19_CR17","unstructured":"Tang, A.: Cops and robber with bounded visibility. Master\u2019s thesis, Dalhousie University (2004)"},{"key":"19_CR18","unstructured":"To\u0161i\u0107, R.: Inductive classes of graphs. In: Proceedings of the Sixth Yugoslav Seminar on Graph Theory, pp. 233\u2013237. University of Novi Sad (1985)"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10878-006-9013-9","volume":"13","author":"B. Yang","year":"2007","unstructured":"Yang, B.: Strong-mixed searching and pathwidth. Journal of Combinatorial Optimization\u00a013, 47\u201359 (2007)","journal-title":"Journal of Combinatorial Optimization"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1007\/978-3-540-30551-4_77","volume-title":"Algorithms and Computation","author":"B. Yang","year":"2004","unstructured":"Yang, B., Dyer, D., Alspach, B.: Sweeping graphs with large clique number. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 908\u2013920. Springer, Heidelberg (2004)"},{"key":"19_CR21","doi-asserted-by":"publisher","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.: Sweeping graphs with large clique number. Discrete Mathematics\u00a0309, 5770\u20135780 (2009)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T11:43:54Z","timestamp":1557747834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}