{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:55:46Z","timestamp":1763466946800,"version":"3.45.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032091192","type":"print"},{"value":"9783032091208","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-09120-8_13","type":"book-chapter","created":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:52:19Z","timestamp":1763466739000},"page":"181-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Capturing an Invisible Robber Using Separators"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2025,11,19]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(84)90073-8","volume":"8","author":"M Aigner","year":"1984","unstructured":"Aigner, M., Fromme, M.: A game of cops and robbers. Discret. Appl. Math. 8(1), 1\u201312 (1984)","journal-title":"Discret. Appl. Math."},{"key":"13_CR2","unstructured":"Bl\u00e4sius, T., Friedrich, T., Krohmer, A.: Hyperbolic random graphs: Separators and treewidth. In: 24th Annual European Symposium on Algorithms, ESA 2016, volume\u00a057 of LIPIcs, pp. 15:1\u201315:16, 2016"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1038\/ncomms1063","volume":"1","author":"M Bogun\u00e1","year":"2010","unstructured":"Bogun\u00e1, M., Papadopoulos, F., Krioukov, D.: Sustaining the internet with hyperbolic mapping. Nat. Commun. 1(1), 62 (2010)","journal-title":"Nat. Commun."},{"issue":"18","key":"13_CR4","doi-asserted-by":"publisher","first-page":"5588","DOI":"10.1016\/j.disc.2008.04.004","volume":"309","author":"A Bonato","year":"2009","unstructured":"Bonato, A., Golovach, P.A., Hahn, G., Kratochv\u00edl, J.: The capture time of a graph. Discret. Math. 309(18), 5588\u20135595 (2009)","journal-title":"Discret. Math."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Bonato, A., Nowakowski, R.J.: The game of cops and robbers on graphs. Student Mathematical Library, vol. 61. AMS, Providence, RI (2011)","DOI":"10.1090\/stml\/061"},{"key":"13_CR6","unstructured":"Brandt, S., Emek, Y., Uitto, J., Wattenhofer, R.: A tight lower bound for the capture time of the cops and robbers game. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, volume\u00a080 of LIPIcs, pp. 82:1\u201382:13, 2017"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Clarke, N.E., Cox, D., Duffy, C., Dyer, D., Fitzpatrick, S.L., Messinger, M.E.: Limited visibility cops and robber. Discret. Appl. Math. 282, 53\u201364 (2020)","DOI":"10.1016\/j.dam.2019.12.007"},{"key":"13_CR8","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.) AAIM\/FAW -2013. LNCS, vol. 7924, pp. 175\u2013186. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38756-2_19"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Dereniowski, D., Dyer, D., Tifenbach, R.M., Yang, B.: The complexity of zero-visibility cops and robber. Theor. Comput. Sci. 607, 135\u2013148 (2015)","DOI":"10.1016\/j.tcs.2015.03.022"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Dereniowski, D., Dyer, D., Tifenbach, R.M., Yang, B.: Zero-visibility cops and robber and the pathwidth of a graph. J. Comb. Optim. 29, 541\u2013564 (2015)","DOI":"10.1007\/s10878-014-9712-6"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Elberfeld, M., Jakoby, A., Tantau, T.: Logspace versions of the theorems of bodlaender and courcelle. In: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, pp. 143\u2013152, 2010","DOI":"10.1109\/FOCS.2010.21"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Enright, J., Meeks, K., Pettersson, W., Sylvester, J.: Cops and robbers on multi-layer graphs. In: Paulusma, D., Ries, B. (eds.) Graph-Theoretic Concepts in Computer Science. WG 2023. LNCS, vol. 14093, pp. 319\u2013333. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43380-1_23","DOI":"10.1007\/978-3-031-43380-1_23"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1137\/05064299X","volume":"38","author":"U Feige","year":"2008","unstructured":"Feige, U., Hajiaghayi, M.T., Lee, J.R.: Improved approximation algorithms for minimum weight vertex separators. SIAM J. Comput. 38(2), 629\u2013657 (2008)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1002\/jgt.20591","volume":"69","author":"A Frieze","year":"2012","unstructured":"Frieze, A., Krivelevich, M., Loh, P.-S.: Variations on cops and robbers. J. Graph Theory 69(4), 383\u2013402 (2012)","journal-title":"J. Graph Theory"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Govindan, R., Langston, M.A., Yan, X.: Approximating the pathwidth of outerplanar graphs. Inf. Process. Lett. 68(1), 17\u201323 (1998)","DOI":"10.1016\/S0020-0190(98)00139-2"},{"key":"13_CR16","unstructured":"Jeliazkova, D.: Aspects of the cops and robber game played with incomplete information. PhD thesis, Acadia University, 2006"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Joret, G., Kami\u0144ski, M., Theis, D.O.: The cops and robber game on graphs with forbidden (induced) subgraphs. Contrib. Discret. Math. 5(2) (2010)","DOI":"10.55016\/ojs\/cdm.v5i2.62032"},{"key":"13_CR18","unstructured":"Kehagias, A., Papazoglou, A.C.: An algorithm for limited visibility graph searching. arXiv preprint arXiv:2105.06150, 2021"},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.036106","volume":"82","author":"D Krioukov","year":"2010","unstructured":"Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Bogun\u00e1, M.: Hyperbolic geometry of complex networks. Phys. Rev. E-Stat. Nonlinear Soft Matter Phys. 82(3), 036106 (2010)","journal-title":"Phys. Rev. E-Stat. Nonlinear Soft Matter Phys."},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615\u2013627 (1980)","DOI":"10.1137\/0209046"},{"issue":"3","key":"13_CR21","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1002\/jgt.22129","volume":"86","author":"P-S Loh","year":"2017","unstructured":"Loh, P.-S., Siyoung, O.: Cops and robbers on planar-directed graphs. J. Graph Theory 86(3), 329\u2013340 (2017)","journal-title":"J. Graph Theory"},{"issue":"2","key":"13_CR22","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. Discret. Math. 43(2), 235\u2013239 (1983)","journal-title":"Discret. Math."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Peng, S.L., Ho, C.W., Hsu, T.S., Ko, M.T., Tang, C.Y.: Edge and node searching problems on trees. Theor. Comput. Sci. 240(2), 429\u2013446 (2000)","DOI":"10.1016\/S0304-3975(99)00241-8"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-48749-6_1","volume-title":"Combinatorial Optimization and Applications","author":"P Pisantechakool","year":"2016","unstructured":"Pisantechakool, P., Tan, X.: On the capture time of cops and robbers game on a planar graph. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 3\u201317. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48749-6_1"},{"key":"13_CR25","unstructured":"Quilliot, A.: Jeux et pointes fixes sur les graphes. PhD thesis, Ph. D. Dissertation, Universit\u00e9 de Paris VI, 1978"},{"key":"13_CR26","unstructured":"Tang, A.: Cops and robber with bounded visibility. National Library of Canada Bibliothque nationale du Canada, Ottawa (2005)"},{"key":"13_CR27","unstructured":"Tosic, R.: Vertex-to-vertex search in a graph. In: Graph Theory (Dubrovnik 1985), pp. 233\u2013237, 1985"},{"key":"13_CR28","unstructured":"To\u0161i\u0107, R.: Vertex-to-vertex search in a graph. In: Proceedings of the Sixth Yugoslav Seminar on Graph Theory, pp. 233\u2013237. University of Novi Sad, 1985"},{"issue":"3","key":"13_CR29","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.disc.2014.10.012","volume":"338","author":"Zsolt Adam Wagner","year":"2015","unstructured":"Zsolt Adam Wagner: Cops and robbers on diameter two graphs. Discret. Math. 338(3), 107\u2013109 (2015)","journal-title":"Discret. Math."},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-030-25005-8_36","volume-title":"Combinatorial Algorithms","author":"Y Xue","year":"2019","unstructured":"Xue, Y., Yang, B., Zhong, F., Zilles, S.: A partition approach to lower bounds for zero-visibility cops and robber. In: Colbourn, C.J., Grossi, R., Pisanti, N. (eds.) IWOCA 2019. LNCS, vol. 11638, pp. 442\u2013454. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25005-8_36"},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2022.06.011","volume":"928","author":"B Yang","year":"2022","unstructured":"Yang, B.: One-visibility cops and robber on trees: optimal cop-win strategies. Theor. Comput. Sci. 928, 27\u201347 (2022)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09120-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:52:37Z","timestamp":1763466757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09120-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"ISBN":["9783032091192","9783032091208"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09120-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"19 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOWIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmics of Wireless Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}