{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:46:58Z","timestamp":1743043618388,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_3","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"27-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New Lower Bound for the Eternal Vertex Cover Number of Graphs"],"prefix":"10.1007","author":[{"given":"Jasine","family":"Babu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Veena","family":"Prabhakaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"3_CR1","unstructured":"Anderson, M., Brigham, R., Carrington, J., Dutton, R., Vitray, R., Yellen, J.: Graphs simultaneously achieving three vertex cover numbers. J. Comb. Math. Comb. Comput. 91, 275\u2013290 (2014)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Babu, J., Chandran, L.S., Francis, M., Prabhakaran, V., Rajendraprasad, D., Warrier, J.N.: On graphs whose eternal vertex cover number and vertex cover number coincide. arxiv, https:\/\/arxiv.org\/abs\/1812.05125v2 (April 2019)","DOI":"10.1007\/978-3-030-11509-8_22"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-030-11509-8_22","volume-title":"Algorithms and Discrete Applied Mathematics","author":"J Babu","year":"2019","unstructured":"Babu, J., Chandran, L.S., Francis, M., Prabhakaran, V., Rajendraprasad, D., Warrier, J.N.: On graphs with minimal eternal vertex cover number. In: Pal, S.P., Vijayakumar, A. (eds.) CALDAM 2019. LNCS, vol. 11394, pp. 263\u2013273. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11509-8_22"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"158","DOI":"10.21136\/CPM.1974.117838","volume":"99","author":"G Chartrand","year":"1974","unstructured":"Chartrand, G., Pippert, R.E.: Locally connected graphs. \u010casopis pro p\u011bstov\u00e1n\u00ed matematiky 99(2), 158\u2013163 (1974)","journal-title":"\u010casopis pro p\u011bstov\u00e1n\u00ed matematiky"},{"issue":"16","key":"3_CR6","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.ipl.2010.05.029","volume":"110","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Gaspers, S., Golovach, P.A., Kratsch, D., Saurabh, S.: Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. 110(16), 702\u2013706 (2010)","journal-title":"Inf. Process. Lett."},{"key":"3_CR7","first-page":"169","volume":"52","author":"W Goddard","year":"2005","unstructured":"Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T.: Eternal security in graphs. J. Combin. Math. Combin. Comput. 52, 169\u2013180 (2005)","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"12","key":"3_CR8","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. Discrete Math. 308(12), 2589\u20132593 (2008)","journal-title":"Discrete Math."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.disc.2014.07.011","volume":"335","author":"B Hartnell","year":"2014","unstructured":"Hartnell, B., Mynhardt, C.: Independent protection in graphs. Discrete Math. 335, 100\u2013109 (2014)","journal-title":"Discrete Math."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1016\/j.disc.2011.03.026","volume":"311","author":"WF Klostermeyer","year":"2011","unstructured":"Klostermeyer, W.F., Mynhardt, C.M.: Graphs with equal eternal vertex cover and eternal domination numbers. Discrete Math. 311, 1371\u20131379 (2011)","journal-title":"Discrete Math."},{"key":"3_CR11","first-page":"235","volume":"45","author":"W Klostermeyer","year":"2009","unstructured":"Klostermeyer, W., Mynhardt, C.: Edge protection in graphs. Austr. J. Comb. 45, 235\u2013250 (2009)","journal-title":"Austr. J. Comb."},{"issue":"7","key":"3_CR12","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.: Vertex covers and eternal dominating sets. Discrete Appl. Math. 160(7), 1183\u20131190 (2012)","journal-title":"Discrete Appl. Math."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ipl.2019.01.013","volume":"146","author":"M Rinemberg","year":"2019","unstructured":"Rinemberg, M., Soulignac, F.J.: The eternal dominating set problem for interval graphs. Inf. Process. Lett. 146, 27\u201329 (2019)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:34:16Z","timestamp":1619242456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"126","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":"54","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":"43% - 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":"2.7","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":"10.2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}