{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:09Z","timestamp":1742913729667,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319575858"},{"type":"electronic","value":"9783319575865"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-57586-5_33","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T15:23:34Z","timestamp":1492097014000},"page":"393-404","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Perpetually Dominating Large Grids"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Lamprou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Schewe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"key":"33_CR1","first-page":"111","volume":"61","author":"M Anderson","year":"2007","unstructured":"Anderson, M., et al.: Maximum demand graphs for eternal security. J. Comb. Math. Comb. Comput. 61, 111\u2013128 (2007)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"33_CR2","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. Combin. Math. Combin. Comput. 85, 33\u201348 (2013)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"33_CR3","doi-asserted-by":"publisher","DOI":"10.1090\/stml\/061","volume-title":"The Game of Cops and Robbers on Graphs","author":"A Bonato","year":"2011","unstructured":"Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence (2011)"},{"key":"33_CR4","first-page":"179","volume":"50","author":"AP Burger","year":"2004","unstructured":"Burger, A.P., et al.: Infinite order domination in graphs. J. Comb. Math. Comb. Comput. 50, 179\u2013194 (2004)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"33_CR5","first-page":"159","volume":"49","author":"AP Burger","year":"2004","unstructured":"Burger, A.P., Cockayne, E.J., Gr\u00fcndlingh, W.R., Mynhardt, C.M., van Vuuren, J.H., Winterbach, W.: Finite order domination in graphs. J. Combin. Math. Combin. Comput. 49, 159\u2013175 (2004)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"33_CR6","unstructured":"Chang, T.Y.: Domination numbers of grid graphs. Ph.D. thesis, Department of Mathematics, University of South Florida (1992)"},{"key":"33_CR7","unstructured":"Finbow, S., Gaspers, S., Messinger, M.E., Ottaway, P.: A note on the eternal dominating set problem (2016, submitted)"},{"key":"33_CR8","first-page":"156","volume":"61","author":"S Finbow","year":"2015","unstructured":"Finbow, S., Messinger, M.-E., Bommel, M.: Eternal domination in $$3\\times n$$ grids. Australas. J. Combin. 61, 156\u2013174 (2015)","journal-title":"Australas. J. Combin."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.ipl.2010.05.029","volume":"110","author":"F Fomin","year":"2010","unstructured":"Fomin, F., et al.: Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. 110, 702\u2013706 (2010)","journal-title":"Inf. Process. Lett."},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.01.009","volume":"526","author":"FV Fomin","year":"2014","unstructured":"Fomin, F.V., Giroire, F., Jean-Marie, A., Mazauric, D., Nisse, N.: To satisfy impatient web surfers is hard. Theoret. Comput. Sci. 526, 1\u201317 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2014.11.025","volume":"584","author":"F Giroire","year":"2015","unstructured":"Giroire, F., Lamprou, I., Mazauric, D., Nisse, N., P\u00e9rennes, S., Soares, R.: Connected surveillance game. Theoret. Comput. Sci. 584, 131\u2013143 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR12","first-page":"169","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, 169\u2013180 (2005)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"2589","DOI":"10.1016\/j.disc.2007.06.005","volume":"308","author":"J Goldwasser","year":"2008","unstructured":"Goldwasser, J., Klostermeyer, W.F.: Tight bounds for eternal dominating sets in graphs. Discret. Math. 308, 2589\u20132593 (2008)","journal-title":"Discret. Math."},{"issue":"3","key":"33_CR14","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1137\/11082574","volume":"25","author":"D Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, D., et al.: The domination number of grids. SIAM J. Discret. Math. 25(3), 1443\u20131453 (2011)","journal-title":"SIAM J. Discret. Math."},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0012-365X(02)00811-7","volume":"266","author":"MA Henning","year":"2003","unstructured":"Henning, M.A., Hedetniemi, S.T.: Defending the Roman Empire: a new strategy. Discret. Math. 266, 239\u2013251 (2003)","journal-title":"Discret. Math."},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.dam.2016.04.021","volume":"211","author":"MA Henning","year":"2016","unstructured":"Henning, M.A., Klostermeyer, W.F.: Trees with large m-eternal domination number. Discret. Appl. Math. 211, 79\u201385 (2016)","journal-title":"Discret. Appl. Math."},{"key":"33_CR17","unstructured":"Henning, M.A., Klostermeyer, W.F., MacGillivray, G.: Bounds for the m-eternal domination number of a graph, Manuscript (2015)"},{"key":"33_CR18","first-page":"235","volume":"45","author":"WF Klostermeyer","year":"2009","unstructured":"Klostermeyer, W.F., Mynhardt, C.M.: Edge protection in graphs. Australas. J. Comb. 45, 235\u2013250 (2009)","journal-title":"Australas. J. Comb."},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2298\/AADM151109021K","volume":"10","author":"WF Klostermeyer","year":"2016","unstructured":"Klostermeyer, W.F., Mynhardt, C.M.: Protecting a graph with mobile guards. Appl. Anal. Discret. Math. 10, 1\u201329 (2016)","journal-title":"Appl. Anal. Discret. Math."},{"key":"33_CR20","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1016\/j.dam.2011.11.034","volume":"160","author":"WF Klostermeyer","year":"2012","unstructured":"Klostermeyer, W.F., Mynhardt, C.M.: Vertex covers and eternal dominating sets. Discret. Appl. Math. 160, 1183\u20131190 (2012)","journal-title":"Discret. Appl. Math."},{"key":"33_CR21","doi-asserted-by":"publisher","first-page":"585","DOI":"10.2307\/2589113","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":"33_CR22","volume-title":"Defend the Roman Empire","author":"I Stewart","year":"1999","unstructured":"Stewart, I.: Defend the Roman Empire. Scientific American, New York City (1999). pp. 136\u2013138"},{"key":"33_CR23","unstructured":"van Bommel, C.M., van Bommel, M.F.: Eternal domination numbers of $$5\\times n$$ grid graphs. J. Combin. Math. Combin. Comput., to appear"}],"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-319-57586-5_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:50:59Z","timestamp":1710341459000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57586-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319575858","9783319575865"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57586-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","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":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/ciac2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}