{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:32:17Z","timestamp":1725795137857},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080154"},{"type":"electronic","value":"9783319080161"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_6","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T04:18:07Z","timestamp":1401423487000},"page":"60-70","source":"Crossref","is-referenced-by-count":1,"title":["The Complexity of Zero-Visibility Cops and Robber"],"prefix":"10.1007","author":[{"given":"Dariusz","family":"Dereniowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Dyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan M.","family":"Tifenbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boting","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","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":"6_CR2","doi-asserted-by":"crossref","unstructured":"Bonato, A., Nowakowski, R.: The Game of Cops and Robbers on Graphs. Student Mathematical Library, vol.\u00a061. American Mathematical Society (2011)","DOI":"10.1090\/stml\/061"},{"key":"6_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":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-38756-2_19","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"D. Dereniowski","year":"2013","unstructured":"Dereniowski, D., Dyer, D., Tifenbach, R.M., Yang, B.: Zero-visibility cops and robber game on a graph. In: Fellows, M., Tan, X., Zhu, B. (eds.) FAW-AAIM 2013. LNCS, vol.\u00a07924, pp. 175\u2013186. Springer, Heidelberg (2013)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Dereniowski, D., Dyer, D., Tifenbach, R.M., Yang, B.: Zero-visibility cops & robber and the pathwidth of a graph. Journal of Combinatorial Optimization (2014)","DOI":"10.1007\/s10878-014-9712-6"},{"key":"6_CR6","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":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-540-74839-7_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F.V. Fomin","year":"2007","unstructured":"Fomin, F.V., Heggernes, P., Mihai, R.: Mixed search number and linear-width of interval and split graphs. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 304\u2013315. Springer, Heidelberg (2007)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(93)90012-D","volume":"45","author":"J. Gustedt","year":"1993","unstructured":"Gustedt, J.: On the pathwidth of chordal graphs. Discrete Applied Mathematics\u00a045, 233\u2013248 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR9","unstructured":"Jeliazkova, D.: Aspects of the cops and robber game played with incomplete information. Master\u2019s thesis, Acadia University (2006)"},{"key":"6_CR10","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":"6_CR11","unstructured":"Kinnersley, W.B.: Cops and robbers is EXPTIME -complete. arXiv.1309.5405 [math.CO] (2013)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N., Hakimi, S.L., Garey, M., Johnson, D., Papadimitriou, C.H.: The complexity of searching a graph. Journal of the ACM\u00a035, 18\u201344 (1988)","journal-title":"Journal of the ACM"},{"key":"6_CR13","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":"6_CR14","doi-asserted-by":"crossref","unstructured":"Parsons, T.: Pursuit-evasion in a graph. In: Proceedings of the International Conference on the Theory and Applications of Graphs. Lecture Notes in Mathematics, vol.\u00a0642, pp. 426\u2013441. Springer (1978)","DOI":"10.1007\/BFb0070400"},{"key":"6_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":"6_CR16","unstructured":"Tang, A.: Cops and robber with bounded visibility. Master\u2019s thesis, Dalhousie University (2004)"},{"key":"6_CR17","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":"6_CR18","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson (2000)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-73556-4_6","volume-title":"Combinatorial Optimization and Applications","author":"B. Yang","year":"2007","unstructured":"Yang, B., Zhang, R., Cao, Y.: Searching cycle-disjoint graphs. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol.\u00a04616, pp. 32\u201343. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08016-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:31:44Z","timestamp":1558913504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}