{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:34Z","timestamp":1759063774160,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030532611"},{"type":"electronic","value":"9783030532628"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-53262-8_1","type":"book-chapter","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T23:12:23Z","timestamp":1595373143000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs"],"prefix":"10.1007","author":[{"given":"Gabriela","family":"Argiroffo","sequence":"first","affiliation":[]},{"given":"Silvia","family":"Bianchi","sequence":"additional","affiliation":[]},{"given":"Yanina","family":"Lucarini","sequence":"additional","affiliation":[]},{"given":"Annegret","family":"Wagler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,22]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.disopt.2008.11.001","volume":"6","author":"G Argiroffo","year":"2009","unstructured":"Argiroffo, G., Bianchi, S.: On the set covering polyhedron of circulant matrices. Discrete Optim. 6(2), 162\u2013173 (2009)","journal-title":"Discrete Optim."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.dam.2017.06.005","volume":"245","author":"G Argiroffo","year":"2018","unstructured":"Argiroffo, G., Bianchi, S., Lucarini, Y., Wagler, A.: Polyhedra associated with identifying codes in graphs. Discrete Appl. Math. 245, 16\u201327 (2018)","journal-title":"Discrete Appl. Math."},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-09174-7_2","volume-title":"Combinatorial Optimization","author":"G Argiroffo","year":"2014","unstructured":"Argiroffo, G., Bianchi, S., Wagler, A.: Study of Identifying code polyhedra for some families of split graphs. In: Fouilhoux, P., Gouveia, L.E.N., Mahjoub, A.R., Paschos, V.T. (eds.) ISCO 2014. LNCS, vol. 8596, pp. 13\u201325. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09174-7_2"},{"key":"1_CR4","unstructured":"Argiroffo, G., Bianchi, S., Wagler, A.: On identifying code polyhedra of families of suns. In: VIII ALIO\/EURO Workshop on Applied Combinatorial Optimization (2014)"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.disopt.2016.06.002","volume":"22","author":"G Argiroffo","year":"2016","unstructured":"Argiroffo, G., Bianchi, S., Wagler, A.: Progress on the description of identifying code polyhedra for some families of split graphs. Discrete Optim. 22, 225\u2013240 (2016)","journal-title":"Discrete Optim."},{"key":"1_CR6","unstructured":"Argiroffo, G., Carr, M.: On the set covering polyhedron of $$q$$-roses, In: Proceedings of the VI ALIO\/EURO Workshop on Applied Combinatorial Optimization 2008, Buenos Aires, Argentina (2008)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01582278","volume":"43","author":"E Balas","year":"1989","unstructured":"Balas, E., Ng, S.M.: On the set covering polytope: I. All the facets with coefficients in $$\\{0, 1, 2\\}$$. Math. Program. 43, 57\u201369 (1989). https:\/\/doi.org\/10.1007\/BF01582278","journal-title":"Math. Program."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/j.ejc.2003.12.013","volume":"25","author":"N Bertrand","year":"2004","unstructured":"Bertrand, N., Charon, I., Hudry, O., Lobstein, A.: Identifying and locating dominating codes on chains and cycles. Eur. J. Comb. 25, 969\u2013987 (2004)","journal-title":"Eur. J. Comb."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1016\/S0304-3975(02)00536-4","volume":"290","author":"I Charon","year":"2003","unstructured":"Charon, I., Hudry, O., Lobstein, A.: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theoret. Comput. Sci. 290, 2109\u20132120 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-642-45278-9_14","volume-title":"Combinatorial Algorithms","author":"F Foucaud","year":"2013","unstructured":"Foucaud, F.: The complexity of the identifying code problem in restricted graph classes. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013. LNCS, vol. 8288, pp. 150\u2013163. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45278-9_14"},{"key":"1_CR11","unstructured":"F\u00f6ldes, S., Hammer, P.: Split graphs. In: Proceedings of the VIII Southeastern Conference on Combinatorics, Graph Theory and Computing (Baton Rouge, La.), Congressus Numerantium XIX, Winnipeg: Utilitas Math, pp. 311\u2013315 (1977)"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.disc.2005.09.035","volume":"307","author":"S Gravier","year":"2007","unstructured":"Gravier, S., Moncel, J.: On graphs having a $$V \\{x\\}$$-set as an identifying code. Discrete Math. 307, 432\u2013434 (2007)","journal-title":"Discrete Math."},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.dam.2006.01.002","volume":"154","author":"TW Haynes","year":"2006","unstructured":"Haynes, T.W., Henning, M.A., Howard, J.: Locating and total-dominating sets in trees. Discrete Appl. Math. 154, 1293\u20131300 (2006)","journal-title":"Discrete Appl. Math."},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"1986","DOI":"10.1016\/j.dam.2012.04.004","volume":"160","author":"MA Henning","year":"2012","unstructured":"Henning, M.A., Rad, N.J.: Locating-total domination in graphs. Discrete Appl. Math. 160, 1986\u20131993 (2012)","journal-title":"Discrete Appl. Math."},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"MG Karpovsky","year":"1998","unstructured":"Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory 44, 599\u2013611 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR16","unstructured":"Lobstein, A.: Watching systems, identifying, locating-dominating and discriminating codes in graphs. https:\/\/www.lri.enst.fr\/lobstein\/debutBIBidetlocdom.pdf"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01589100","volume":"45","author":"P Nobili","year":"1989","unstructured":"Nobili, P., Sassano, A.: Facets and lifting procedures for the set covering polytope. Math. Program. 45, 111\u2013137 (1989)","journal-title":"Math. Program."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Pandey, A.: Open neighborhood locating-dominating set in graphs: complexity and algorithms. In: International Conference on Information Technology (ICIT). IEEE (2015)","DOI":"10.1109\/ICIT.2015.14"},{"key":"1_CR19","first-page":"109","volume":"46","author":"SJ Seo","year":"2010","unstructured":"Seo, S.J., Slater, P.J.: Open neighborhood locating dominating sets. Australas. J. Comb. 46, 109\u2013119 (2010)","journal-title":"Australas. J. Comb."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53262-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:08:13Z","timestamp":1710266893000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-53262-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030532611","9783030532628"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53262-8_1","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":"22 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"4 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.lamsade.dauphine.fr\/~isco\/","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":"Symposia","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","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":"24","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":"36% - 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.26","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":"3.85","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)"}}]}}