{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T11:43:53Z","timestamp":1785930233054,"version":"3.56.0"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819502141","type":"print"},{"value":"9789819502158","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"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-981-95-0215-8_13","type":"book-chapter","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T16:25:38Z","timestamp":1753979138000},"page":"165-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hunting a\u00a0Rabbit Is Hard"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2865-1123","authenticated-orcid":false,"given":"Walid","family":"Ben-Ameur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7663-6265","authenticated-orcid":false,"given":"Harmender","family":"Gahlawat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1932-8167","authenticated-orcid":false,"given":"Alessandro","family":"Maddaloni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.ejc.2015.08.002","volume":"52","author":"TV Abramovskaya","year":"2016","unstructured":"Abramovskaya, T.V., Fomin, F.V., Golovach, P.A., Pilipczuk, M.: How to hunt an invisible rabbit on a graph. Eur. J. Comb. 52, 12\u201326 (2016)","journal-title":"Eur. J. Comb."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Alejandro\u00a0Isaza, A.I., Lu, J., Bulitko, V., Greiner, R.: A cover-based approach to multi-agent moving target pursuit. In: Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, vol. 4, issue (1), pp. 54\u201359 (2021)","DOI":"10.1609\/aiide.v4i1.18672"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1002\/jgt.21894","volume":"82","author":"J Bang-Jensen","year":"2016","unstructured":"Bang-Jensen, J., Larsen, T.M.: Dag-width and circumference of digraphs. J. Graph Theory 82(2), 194\u2013206 (2016)","journal-title":"J. Graph Theory"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00373-005-0627-y","volume":"22","author":"J Bar\u00e1t","year":"2006","unstructured":"Bar\u00e1t, J.: Directed path-width and monotonicity in digraph searching. Graphs Comb. 22(1), 161\u2013172 (2006)","journal-title":"Graphs Comb."},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1002\/net.22234","volume":"84","author":"W Ben-Ameur","year":"2024","unstructured":"Ben-Ameur, W., Maddaloni, A.: A cops and robber game and the meeting time of synchronous directed walks. Networks 84(2), 238\u2013251 (2024)","journal-title":"Networks"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Ameur, W., Maddaloni, A.: Complexity results for a cops and robber game on directed graphs. Networks (2025)","DOI":"10.1002\/net.22284"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.dam.2022.12.008","volume":"354","author":"W Ben-Ameur","year":"2024","unstructured":"Ben-Ameur, W., Kushik, N., Maddaloni, A., Neto, J., Watel, D.: The no-meet matroid. Discret. Appl. Math. 354, 94\u2013107 (2024)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.disc.2018.10.011","volume":"342","author":"J Bolkema","year":"2019","unstructured":"Bolkema, J., Groothuis, C.: Hunting rabbits on the hypercube. Discret. Math. 342(2), 360\u2013372 (2019)","journal-title":"Discret. Math."},{"key":"13_CR9","unstructured":"Bonato, A.: An invitation to pursuit-evasion games and graph theory. Am. Math. Soc. (2020)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Britnell, J.R., Wildon, M.: Finding a princess in a palace: a pursuit-evasion problem. Electr. J. Comb. 20(1), (2013)","DOI":"10.37236\/2296"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s10514-011-9241-4","volume":"31","author":"T Chung","year":"2011","unstructured":"Chung, T., Hollinger, G., Isler, V.: Search and pursuit-evasion in mobile robotics. Auton. Robots 31, 11 (2011). https:\/\/doi.org\/10.1007\/s10514-011-9241-4","journal-title":"Auton. Robots"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Dissaux, T., Fioravantes, F., Galhawat, H., Nisse, N.: Further results on the hunters and rabbit game through monotonicity. Inf. Comput., 305 (2025)","DOI":"10.1016\/j.ic.2025.105302"},{"key":"13_CR13","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co Ltd. (1979)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. J. Comput. Syst. Sci. 66(4), 775\u2013808 (2003). Special Issue on PODS 2001","DOI":"10.1016\/S0022-0000(03)00030-8"},{"key":"13_CR15","unstructured":"Gruslys, V., M\u00e9roueh, A.: Catching a mouse on a tree. arXiv e-prints, art. arXiv:1502.06591 (2015)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2013.09.004","volume":"314","author":"J Haslegrave","year":"2014","unstructured":"Haslegrave, J.: An evasion game on a graph. Discret. Math. 314, 1\u20135 (2014)","journal-title":"Discret. Math."},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jctb.2000.2031","volume":"82","author":"T Johnson","year":"2001","unstructured":"Johnson, T., Robertson, N., Seymour, P., Thomas, R.: Directed tree-width. J. Comb. Theory. Ser. B 82(1), 138\u2013154 (2001)","journal-title":"J. Comb. Theory. Ser. B"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.jctb.2014.11.002","volume":"111","author":"WB Kinnersley","year":"2015","unstructured":"Kinnersley, W.B.: Cops and robbers is EXPTIME-complete. J. Comb. Theory, Ser. B 111, 201\u2013220 (2015)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Nisse, N.: Network decontamination. In: Flocchini, P., Prencipe, G., Santoro, N., (eds.) Distributed Computing by Mobile Entities: Current Research in Moving and Computing, pp. 516\u2013548 (2019)","DOI":"10.1007\/978-3-030-11072-7_19"},{"issue":"2","key":"13_CR20","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_CR21","doi-asserted-by":"crossref","unstructured":"Obdr\u017e\u00e1lek, J.: DAG-width: connectivity measure for directed graphs. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA \u201906, pp. 814\u2013821, USA (2006). Society for Industrial and Applied Mathematics. ISBN 0898716055","DOI":"10.1145\/1109557.1109647"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Parsons, T.D.: Pursuit-evasion in a graph. Theory Appl. Graphs, LNCS 642, 426\u2013441 (1978)","DOI":"10.1007\/BFb0070400"},{"key":"13_CR23","unstructured":"Quillot, A.: Jeux et pointes fixes sur les graphes. PhD thesis, Universit\u00e9 Paris VI (1978)"},{"issue":"1","key":"13_CR24","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"P Seymour","year":"1993","unstructured":"Seymour, P., Thomas, R.: Graph searching and a min-max theorem for tree-width. J. Comb. Theory, Ser. B 58(1), 22\u201333 (1993)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-030-33274-7_6","volume-title":"Artificial Intelligence","author":"R Stern","year":"2019","unstructured":"Stern, R.: Multi-agent path finding \u2013 an overview. In: Osipov, G.S., Panov, A.I., Yakovlev, K.S. (eds.) Artificial Intelligence. LNCS (LNAI), vol. 11866, pp. 96\u2013115. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-33274-7_6"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0215-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T10:48:41Z","timestamp":1785926921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0215-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"ISBN":["9789819502141","9789819502158"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0215-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,8,1]]},"assertion":[{"value":"1 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they do not have any competing interests.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}