{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:59:55Z","timestamp":1743119995115,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174019"},{"type":"electronic","value":"9783030174026"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_26","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"311-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Eternal Domination in Grids"],"prefix":"10.1007","author":[{"given":"Fionn","family":"Mc Inerney","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"P\u00e9rennes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"3","key":"26_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.5711\/morj.1.3.3","volume":"1","author":"J Arquilla","year":"1995","unstructured":"Arquilla, J., Fredricksen, H.: \u201cGraphing\u201d an optimal grand strategy. Mil. Oper. Res. 1(3), 3\u201317 (1995)","journal-title":"Mil. Oper. Res."},{"key":"26_CR2","unstructured":"Bagan, G., Joffard, A., Kheddouci, H.: Eternal dominating sets on digraphs and orientations of graphs. CoRR, abs\/1805.09623 (2018)"},{"key":"26_CR3","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":"26_CR4","first-page":"33","volume":"85","author":"I Beaton","year":"2013","unstructured":"Beaton, I., Finbow, S., MacDonald, J.A.: Eternal domination numbers of $$4\\times n$$ grid graphs. J. Comb. Math. Comb. Comput. 85, 33\u201348 (2013)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"26_CR5","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., Souza, C., Lee, O.: The eternal dominating set problem for proper interval graphs. Inf. Process. Lett. 115, 582\u2013587 (2015)","journal-title":"Inf. Process. Lett."},{"key":"26_CR6","first-page":"179","volume":"50","author":"A Burger","year":"2004","unstructured":"Burger, A., Cockayne, E.J., Gr\u00fcndlingh, W.R., Mynhardt, C.M., van Vuuren, J.H., Winterbach, W.: Infinite order domination in graphs. J. Comb. Math. Comb. Comput. 50, 179\u2013194 (2004)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, N., Mc Inerney, F., Nisse, N., P\u00e9rennes, S.: Study of a combinatorial game in graphs through linear programming. Algorithmica (2018, to appear)","DOI":"10.1007\/s00453-018-0503-9"},{"key":"26_CR8","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. Theor. Comput. Sci. 725, 1\u201315 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR9","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)","edition":"4"},{"key":"26_CR10","first-page":"156","volume":"61","author":"S Finbow","year":"2015","unstructured":"Finbow, S., Messinger, M.E., van Bommel, M.F.: Eternal domination in $$3 \\times n$$ grids. Australas. J. Comb. 61, 156\u2013174 (2015)","journal-title":"Australas. J. Comb."},{"key":"26_CR11","first-page":"160","volume":"52","author":"W Goddard","year":"2005","unstructured":"Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T.: Eternal security in graphs. J. Comb. Math. Comb. Comput. 52, 160\u2013180 (2005)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"26_CR12","first-page":"47","volume":"91","author":"JL Goldwasser","year":"2013","unstructured":"Goldwasser, J.L., Klostermeyer, W.F., Mynhardt, C.M.: Eternal protection in grid graphs. Util. Math. 91, 47\u201364 (2013)","journal-title":"Util. Math."},{"issue":"3","key":"26_CR13","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1137\/11082574","volume":"25","author":"D Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, D., Pinlou, A., Rao, M., Thomass\u00e9, S.: The domination number of grids. SIAM J. Discrete Math. 25(3), 1443\u20131453 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Mc Inerney, F., Nisse, N., P\u00e9rennes, S.: Eternal domination in grids. Technical report, INRIA (2018). RR, https:\/\/hal.archives-ouvertes.fr\/hal-01790322","DOI":"10.1007\/978-3-030-17402-6_26"},{"key":"26_CR15","unstructured":"Klostermeyer, W.F., Lawrence, M., MacGillivray, G.: Dynamic dominating sets: the eviction model for eternal domination. Manuscript (2014)"},{"key":"26_CR16","first-page":"97","volume":"68","author":"WF Klostermeyer","year":"2009","unstructured":"Klostermeyer, W.F., MacGillivray, G.: Eternal dominating sets in graphs. J. Comb. Math. Comb. Comput. 68, 97\u2013111 (2009)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"26_CR17","first-page":"473","volume":"68","author":"WF Klostermeyer","year":"2012","unstructured":"Klostermeyer, W.F., Mynhardt, C.M.: Eternal total domination in graphs. Ars Comb. 68, 473\u2013492 (2012)","journal-title":"Ars Comb."},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2298\/AADM151109021K","volume":"10","author":"WF Klostermeyer","year":"2014","unstructured":"Klostermeyer, W.F., Mynhardt, C.M.: Protecting a graph with mobile guards. Appl. Anal. Discrete Math. 10, 1\u201329 (2014)","journal-title":"Appl. Anal. Discrete Math."},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-319-57586-5_33","volume-title":"Algorithms and Complexity","author":"I Lamprou","year":"2017","unstructured":"Lamprou, I., Martin, R., Schewe, S.: Perpetually dominating large grids. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 393\u2013404. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_33"},{"issue":"1","key":"26_CR20","first-page":"47","volume":"12","author":"ME Messinger","year":"2017","unstructured":"Messinger, M.E., Delaney, A.Z.: Closing the gap: eternal domination on $$3\\times n$$ grids. Contrib. Discrete Math. 12(1), 47\u201361 (2017)","journal-title":"Contrib. Discrete Math."},{"issue":"2","key":"26_CR21","first-page":"40","volume":"50","author":"CS Revelle","year":"1997","unstructured":"Revelle, C.S.: Can you protect the Roman Empire? Johns Hopkins Mag. 50(2), 40 (1997)","journal-title":"Johns Hopkins Mag."},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1080\/00029890.2000.12005243","volume":"107","author":"CS Revelle","year":"2000","unstructured":"Revelle, C.S., Rosing, K.E.: Defendens imperium romanum: a classical problem in military strategy. Am. Math. Mon. 107, 585\u2013594 (2000)","journal-title":"Am. Math. Mon."},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Stewart, I.: Defend the Roman Empire! Sci. Am. 281, 136\u2013138 (1999)","DOI":"10.1038\/scientificamerican1299-136"},{"key":"26_CR24","first-page":"83","volume":"97","author":"CM van Bommel","year":"2016","unstructured":"van Bommel, C.M., van Bommel, M.F.: Eternal domination numbers of $$5\\times n$$ grid graphs. J. Comb. Math. Comb. Comput. 97, 83\u2013102 (2016)","journal-title":"J. Comb. Math. Comb. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:58:02Z","timestamp":1710334682000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}