{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:36:16Z","timestamp":1767314176101,"version":"3.48.0"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032118349","type":"print"},{"value":"9783032118356","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-11835-6_17","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:32:40Z","timestamp":1767313960000},"page":"230-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Playing Snake on\u00a0a\u00a0Graph"],"prefix":"10.1007","author":[{"given":"Denise","family":"Graafsma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bodo","family":"Manthey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Skopalik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"issue":"1","key":"17_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). https:\/\/doi.org\/10.1016\/0166-218X(84)90073-8","journal-title":"Discret. Appl. Math."},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Bonato, A., Golovach, P., Hahn, G., Kratochv\u00edl, J.: The capture time of a graph. Discret. Math. 309(18), 5588\u20135595 (2009). https:\/\/doi.org\/10.1016\/j.disc.2008.04.004. Combinatorics 2006, A Meeting in Celebration of Pavol Hell\u2019s 60th Birthday (2006)","DOI":"10.1016\/j.disc.2008.04.004"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Bonato, A., Nowakowski, R.: The Game of Cops and Robbers on Graphs, vol.\u00a061. Student Mathematical Library (2011). https:\/\/doi.org\/10.1090\/stml\/061","DOI":"10.1090\/stml\/061"},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"Chv\u00e1tal, V., Erd\u0151s, P.: Biased positional games. In: Alspach, B., Hell, P., Miller, D. (eds.) Algorithmic Aspects of Combinatorics. Annals of Discrete Mathematics, vol.\u00a02, pp. 221\u2013229. Elsevier (1978). https:\/\/doi.org\/10.1016\/S0167-5060(08)70335-2","DOI":"10.1016\/S0167-5060(08)70335-2"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2017.10.031","volume":"748","author":"M De Biasi","year":"2018","unstructured":"De Biasi, M., Ophelders, T.: The complexity of snake and undirected NCL variants. Theoret. Comput. Sci. 748, 55\u201365 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2017.10.031","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hearn, R.A.: Playing games with algorithms: algorithmic combinatorial game theory. In: Albert, M.H., Nowakowski, R.J. (eds.) Games of No Chance 3, pp. 3\u201356. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511807251.002"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/j.dam.2024.11.012","volume":"361","author":"E Duch\u00eane","year":"2025","unstructured":"Duch\u00eane, E., et al.: Complexity of maker-breaker games on edge sets of graphs. Discret. Appl. Math. 361, 502\u2013522 (2025). https:\/\/doi.org\/10.1016\/j.dam.2024.11.012","journal-title":"Discret. Appl. Math."},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Hefetz, D., Krivelevich, M., Stojakovi\u0107, M., Szab\u00f3, T.: Maker-breaker games. In: Hefetz, D., Krivelevich, M., Stojakovi\u0107, M., Szab\u00f3, T. (eds.) Positional Games. OS, vol. 44, pp. 13\u201325. Springer, Basel (2014). https:\/\/doi.org\/10.1007\/978-3-0348-0825-5_2","DOI":"10.1007\/978-3-0348-0825-5_2"},{"issue":"4","key":"17_CR9","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676\u2013686 (1982). https:\/\/doi.org\/10.1137\/0211056","journal-title":"SIAM J. Comput."},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3233\/ICG-2008-31103","volume":"31","author":"G Kendall","year":"2008","unstructured":"Kendall, G., Parkes, A., Spoerer, K.: A survey of NP-complete puzzles. ICGA J. 31(1), 13\u201334 (2008). https:\/\/doi.org\/10.3233\/ICG-2008-31103","journal-title":"ICGA J."},{"issue":"2","key":"17_CR11","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). https:\/\/doi.org\/10.1016\/0012-365X(83)90160-7","journal-title":"Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11835-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:32:41Z","timestamp":1767313961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Otzenhausen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.uni-trier.de\/wg2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}