{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T14:05:20Z","timestamp":1784383520630,"version":"3.55.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031987397","type":"print"},{"value":"9783031987403","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-98740-3_20","type":"book-chapter","created":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:35Z","timestamp":1752796115000},"page":"273-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Closed Geodetic Game: Algorithms and\u00a0Strategies"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Dailly","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Harmender","family":"Gahlawat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zin Mar","family":"Myint","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,18]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Albert, M., Nowakowski, R., Wolfe, D.: Lessons in Play: An Introduction to Combinatorial Game Theory. AK Peters\/CRC Press (2019)","DOI":"10.1201\/9781482243048"},{"key":"20_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114534","volume":"998","author":"SN Ara\u00fajo","year":"2024","unstructured":"Ara\u00fajo, S.N., Brito, J.M., Folz, R., de Freitas, R., Sampaio, R.M.: Graph convexity impartial games: complexity and winning strategies. Theoret. Comput. Sci. 998, 114534 (2024)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"20_CR3","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1080\/00207160210954","volume":"79","author":"M Atici","year":"2002","unstructured":"Atici, M.: Computational complexity of geodetic set. Int. J. Comput. Math. 79(5), 587\u2013591 (2002)","journal-title":"Int. J. Comput. Math."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Benesh, B.J., Ernst, D.C., Meyer, M., Salmon, S.K., Sieben, N.: Impartial geodetic building games on graphs. Int. J. Game Theory 1\u201334 (2025)","DOI":"10.2139\/ssrn.6889865"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays. AK Peters\/CRC Press (2001\u20132004)","DOI":"10.1201\/9780429487309"},{"key":"20_CR6","first-page":"17","volume":"2A","author":"F Buckley","year":"1988","unstructured":"Buckley, F., Harary, F., Quintas, L.: Extremal results on the geodetic number of a graph. Scientia 2A, 17\u201326 (1988)","journal-title":"Scientia"},{"key":"20_CR7","first-page":"131","volume":"47","author":"F Buckley","year":"1985","unstructured":"Buckley, F., Harary, F.: Closed geodetic games for graphs. Congr. Numer. 47, 131\u2013138 (1985)","journal-title":"Congr. Numer."},{"issue":"4","key":"20_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1080\/16073606.1985.9631921","volume":"8","author":"F Buckley","year":"1985","unstructured":"Buckley, F., Harary, F.: Geodetic games for graphs. Quaest. Math. 8(4), 321\u2013334 (1985)","journal-title":"Quaest. Math."},{"key":"20_CR9","volume-title":"Distance in Graphs","author":"F Buckley","year":"1990","unstructured":"Buckley, F., Harary, F.: Distance in Graphs. Addison and Wesley, New York (1990)"},{"key":"20_CR10","unstructured":"Chakraborty, D., Das, S., Foucaud, F., Gahlawat, H., Lajou, D., Roy, B.: Algorithms and complexity for geodetic sets on planar and chordal graphs. In: 31st International Symposium on Algorithms and Computation (ISAAC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"20_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114217","volume":"979","author":"D Chakraborty","year":"2023","unstructured":"Chakraborty, D., Gahlawat, H., Roy, B.: Algorithms and complexity for geodetic sets on partial grids. Theoret. Comput. Sci. 979, 114217 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Conway, J.H.: On Numbers and Games. CRC Press (2000)","DOI":"10.1201\/9781439864159"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Dailly, A., Gahlawat, H., Myint, Z.M.: The closed geodetic game: algorithms and strategies. arXiv preprint arXiv:2409.20505 (2024)","DOI":"10.1007\/978-3-031-98740-3_20"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Ekim, T., Erey, A., Heggernes, P., van\u2019t Hof, P., Meister, D.: Computing minimum geodetic sets of proper interval graphs. In: Latin American Symposium on Theoretical Informatics, pp. 279\u2013290. Springer (2012)","DOI":"10.1007\/978-3-642-29344-3_24"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01254296","volume":"18","author":"AS Fraenkel","year":"1989","unstructured":"Fraenkel, A.S., Harary, F.: Geodetic contraction games on graphs. Internat. J. Game Theory 18, 327\u2013338 (1989)","journal-title":"Internat. J. Game Theory"},{"key":"20_CR16","first-page":"6","volume":"2","author":"PM Grundy","year":"1939","unstructured":"Grundy, P.M.: Mathematics and games. Eureka 2, 6\u20138 (1939)","journal-title":"Eureka"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Harary, F.: Convexity in graphs: achievement and avoidance games. In: North-Holland Mathematics Studies, vol.\u00a087, p.\u00a0323. Elsevier (1984)","DOI":"10.1016\/S0304-0208(08)72843-3"},{"issue":"11","key":"20_CR18","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0895-7177(93)90259-2","volume":"17","author":"F Harary","year":"1993","unstructured":"Harary, F., Loukakis, E., Tsouros, C.: The geodetic number of a graph. Math. Comput. Model. 17(11), 89\u201395 (1993)","journal-title":"Math. Comput. Model."},{"issue":"2","key":"20_CR19","doi-asserted-by":"publisher","first-page":"185","DOI":"10.4310\/jdg\/1214436096","volume":"16","author":"F Harary","year":"1981","unstructured":"Harary, F., Nieminen, J.: Convexity in graphs. J. Differ. Geom. 16(2), 185\u2013190 (1981)","journal-title":"J. Differ. Geom."},{"issue":"4","key":"20_CR20","doi-asserted-by":"publisher","first-page":"389","DOI":"10.2989\/16073600309486069","volume":"26","author":"TW Haynes","year":"2003","unstructured":"Haynes, T.W., Henning, M., Tiller, C.A.: Geodetic achievement and avoidance games for graphs. Quaest. Math. 26(4), 389\u2013397 (2003)","journal-title":"Quaest. Math."},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2018.05.032","volume":"745","author":"M Mezzini","year":"2018","unstructured":"Mezzini, M.: Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs. Theoret. Comput. Sci. 745, 63\u201374 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/16073606.1988.9632167","volume":"12","author":"M Ne\u010d\u00e1skov\u00e1","year":"1988","unstructured":"Ne\u010d\u00e1skov\u00e1, M.: A note on the achievement geodetic games. Quaestiones Math. 12, 115\u2013119 (1988)","journal-title":"Quaestiones Math."},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Sieben, N.: Impartial hypergraph games. Electron. J. Comb. P2\u201313 (2023)","DOI":"10.37236\/11665"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Siegel, A.N.: Combinatorial Game Theory, vol.\u00a0146. American Mathematical Society (2013)","DOI":"10.1090\/gsm\/146"},{"key":"20_CR25","first-page":"438","volume":"41","author":"R Sprague","year":"1935","unstructured":"Sprague, R.: \u00dcber mathematische kampfspiele. Tohoku Math. J. First Ser. 41, 438\u2013444 (1935)","journal-title":"Tohoku Math. J. First Ser."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-98740-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T13:58:05Z","timestamp":1784383085000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98740-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031987397","9783031987403"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98740-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bozeman, MT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.montana.edu\/bhz\/iwoca2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}