{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:27:17Z","timestamp":1743125237173,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031754081"},{"type":"electronic","value":"9783031754098"}],"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-75409-8_2","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:22Z","timestamp":1737497422000},"page":"21-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Winning Strategies for\u00a0the\u00a0Attacker in\u00a0Eternal Domination"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Bagan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0170-0503","authenticated-orcid":false,"given":"Nicolas","family":"Bousquet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8313-639X","authenticated-orcid":false,"given":"Nacim","family":"Oijid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5586-5613","authenticated-orcid":false,"given":"Th\u00e9o","family":"Pierron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"key":"2_CR1","first-page":"111","volume":"61","author":"M Anderson","year":"2007","unstructured":"Anderson, M., Barrientos, C., Brigham, R., Carrington, R., Vitray, J., Yellen, J.: Maximum demand graphs for eternal security. J. Combin. Math. Combin. Comput. 61, 111\u2013128 (2007)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Anuradha, V., Jain, C., Snoeyink, J., Szab\u00f3, T.: How long can a graph be kept planar? Electron. J. Combin. 15(1) (2008)","DOI":"10.37236\/889"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.dam.2020.10.024","volume":"291","author":"G Bagan","year":"2021","unstructured":"Bagan, G., Joffard, A., Kheddouci, H.: Eternal dominating sets on digraphs and orientations of graphs. Discret. Appl. Math. 291, 99\u2013115 (2021)","journal-title":"Discret. Appl. Math."},{"key":"2_CR4","first-page":"121","volume":"101","author":"S Bard","year":"2017","unstructured":"Bard, S., Duffy, C., Edwards, M., Macgillivray, G., Yang, F.: Eternal domination in split graphs. J. Comb. Math. Comb. Comput. 101, 121\u2013130 (2017)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"2_CR5","unstructured":"Bla\u017eej, V., K\u0159i\u0161\u0165an, J.M., Valla, T.: Efficient attack sequences in m-eternal domination. arXiv:2204.02720 (2022)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Bla\u017eej, V., K\u0159i\u0161\u0165an, J.M., Valla, T.: Computing m-eternal domination number of cactus graphs in linear time. arxiv:2301.05155 (2023)","DOI":"10.2139\/ssrn.4453501"},{"issue":"6","key":"2_CR7","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.ipl.2015.02.004","volume":"115","author":"A Braga","year":"2015","unstructured":"Braga, A., de Souza, C.C., Lee, O.: The eternal dominating set problem for proper interval graphs. Inf. Process. Lett. 115(6), 582\u2013587 (2015)","journal-title":"Inf. Process. Lett."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.07.025","volume":"648","author":"B Bre\u0161ar","year":"2016","unstructured":"Bre\u0161ar, B., Dorbec, P., Klav\u017ear, S., Ko\u0161mrlj, G., Renault, G.: Complexity of the game domination problem. Theoret. Comput. Sci. 648, 1\u20137 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR9","first-page":"159","volume":"49","author":"A Burger","year":"2004","unstructured":"Burger, A., Cockayne, E., Grundlingh, W., Mynhardt, C., Van Vuuren, J., Winterbach, W.: Finite order domination in graphs. J. Comb. Math. Comb. Comput. 49, 159\u2013176 (2004)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"2_CR10","first-page":"179","volume":"50","author":"A Burger","year":"2004","unstructured":"Burger, A., Cockayne, E., Gr\u00fcndlingh, W., Mynhardt, C., Vuuren, J.V., Winterbach, W.: Infinite order domination in graphs. J. Comb. Math. Comb. Comput. 50, 179\u2013194 (2004)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.11.015","volume":"725","author":"N Cohen","year":"2018","unstructured":"Cohen, N., Martins, N.A., Mc Inerney, F., Nisse, N., P\u00e9rennes, S., Sampaio, R.: Spy-game on graphs: complexity and simple topologies. Theoret. Comput. Sci. 725, 1\u201315 (2018)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14(4), 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory: Springer Graduate Text GTM 173. Springer Graduate Texts in Mathematics (GTM). Springer (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2015.11.024","volume":"613","author":"FV Fomin","year":"2016","unstructured":"Fomin, F.V., Heggernes, P., van Leeuwen, E.J.: The firefighter problem on graph classes. Theoret. Comput. Sci. 613, 38\u201350 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.entcs.2019.08.042","volume":"346","author":"V Gledel","year":"2019","unstructured":"Gledel, V., Ir\u0161i\u010d, V., Klav\u017ear, S.: Fast winning strategies for the maker-breaker domination game. Electron. Notes Theor. Comput. Sci. 346, 473\u2013484 (2019)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"2_CR16","unstructured":"Goddard, W., Hedetniemi, S., Hedetniemi, S.: Eternal security in graphs. J. Combin. Math. Combin. Comput. 52 (2005)"},{"issue":"12","key":"2_CR17","doi-asserted-by":"publisher","first-page":"2589","DOI":"10.1016\/j.disc.2007.06.005","volume":"308","author":"JL Goldwasser","year":"2008","unstructured":"Goldwasser, J.L., Klostermeyer, W.F.: Tight bounds for eternal dominating sets in graphs. Discret. Math. 308(12), 2589\u20132593 (2008)","journal-title":"Discret. Math."},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.jctb.2008.04.001","volume":"99","author":"D Hefetz","year":"2009","unstructured":"Hefetz, D., Krivelevich, M., Stojakovi\u0107, M., Szab\u00f3, T.: Fast winning strategies in maker-breaker games. J. Combin. Theory Ser. B 99(1), 39\u201347 (2009)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"5","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1007\/s00453-020-00790-8","volume":"83","author":"FM Inerney","year":"2021","unstructured":"Inerney, F.M., Nisse, N., P\u00e9rennes, S.: Eternal domination: D-dimensional cartesian and strong grids and everything in between. Algorithmica 83(5), 1459\u20131492 (2021)","journal-title":"Algorithmica"},{"issue":"5","key":"2_CR20","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0020-0190(88)90194-9","volume":"28","author":"AV Iyer","year":"1988","unstructured":"Iyer, A.V., Ratliff, H.D., Vijayan, G.: Optimal node ranking of trees. Inf. Process. Lett. 28(5), 225\u2013229 (1988)","journal-title":"Inf. Process. Lett."},{"key":"2_CR21","first-page":"11","volume":"63","author":"W Klostermeyer","year":"2007","unstructured":"Klostermeyer, W., MacGillivray, G.: Eternal security in graphs of fixed independence number. J. Comb. Math. Comb. Comput. 63, 11 (2007)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"2_CR22","first-page":"97","volume":"68","author":"W Klostermeyer","year":"2009","unstructured":"Klostermeyer, W., MacGillivray, G.: Eternal dominating sets in graphs. J. Combin. Math. Combin. Comput. 68, 97\u2013111 (2009)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Klostermeyer, W.F., Mynhardt, C.: Eternal and secure domination in graphs. In: Topics in Domination in Graphs, pp. 445\u2013478. Springer (2020)","DOI":"10.1007\/978-3-030-51117-3_13"},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2018.09.008","volume":"794","author":"I Lamprou","year":"2019","unstructured":"Lamprou, I., Martin, R., Schewe, S.: Eternally dominating large grids. Theoret. Comput. Sci. 794, 27\u201346 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity: Graphs, Structures, and Algorithms","author":"J Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il, J., De Mendez, P.O.: Sparsity: Graphs, Structures, and Algorithms, vol. 28. Springer, Heidelberg (2012)"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"06","DOI":"10.1016\/j.ipl.2019.01.013","volume":"146","author":"M Rinemberg","year":"2019","unstructured":"Rinemberg, M., Soulignac, F.: The eternal dominating set problem for interval graphs. Inf. Process. Lett. 146, 06 (2019)","journal-title":"Inf. Process. Lett."},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.tcs.2013.11.034","volume":"521","author":"R \u0160\u00e1mal","year":"2014","unstructured":"\u0160\u00e1mal, R., Valla, T.: The guarding game is E-complete. Theoret. Comput. Sci. 521, 92\u2013106 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR28","unstructured":"Virgile, V.: Mobile guards\u2019 strategies for graph surveillance and protection. Ph.D. thesis, University of Victoria (2024)"}],"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-031-75409-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:26Z","timestamp":1737497426000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75409-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031754081","9783031754098"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75409-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 January 2025","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":"Gozd Martuljek","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.famnit.upr.si\/event\/31\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}