{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:35:23Z","timestamp":1762252523228,"version":"build-2065373602"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"IDEX-ISITE initiative CAP 20-25"},{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"publisher","award":["ANR-10-LABX-0016"],"award-info":[{"award-number":["ANR-10-LABX-0016"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"International Research Center \"Innovation Transportation and Production Systems\" of the I-SITE CAP 20-25"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1016\/j.dam.2025.05.045","type":"journal-article","created":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T11:17:36Z","timestamp":1750159056000},"page":"215-238","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On open-separating dominating codes in graphs"],"prefix":"10.1016","volume":"375","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7169-7288","authenticated-orcid":false,"given":"Dipayan","family":"Chakraborty","sequence":"first","affiliation":[]},{"given":"Annegret K.","family":"Wagler","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2025.05.045_b1","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.disopt.2008.11.001","article-title":"On the set covering polyhedron of circulant matrices","volume":"6","author":"Argiroffo","year":"2009","journal-title":"Discrete Optim."},{"key":"10.1016\/j.dam.2025.05.045_b2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.dam.2017.06.005","article-title":"Polyhedra associated with identifying codes in graphs","volume":"245","author":"Argiroffo","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.05.045_b3","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/j.dam.2019.08.001","article-title":"Linear-time algorithms for three domination-based separation problems in block graphs","volume":"281","author":"Argiroffo","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.05.045_b4","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.dam.2022.06.025","article-title":"Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs","volume":"322","author":"Argiroffo","year":"2022","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.05.045_b5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.dam.2018.05.011","article-title":"Selecting and covering colored points","volume":"250","author":"Arkin","year":"2018","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2025.05.045_b6","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1137\/0209018","article-title":"On the complexity of canonical labeling of strongly regular graphs","volume":"9","author":"Babai","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2025.05.045_b7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01582278","article-title":"On the set covering polytope: I. All the facets with coefficients in {0, 1 2}","volume":"43","author":"Balas","year":"1989","journal-title":"Math. Program."},{"key":"10.1016\/j.dam.2025.05.045_b8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0095-8956(72)90025-1","article-title":"Induced subsets","volume":"12(B)","author":"Bondy","year":"1972","journal-title":"J. Comb. Theory"},{"key":"10.1016\/j.dam.2025.05.045_b9","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.dam.2022.04.010","article-title":"Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs","volume":"323","author":"Cappelle","year":"2022","journal-title":"Discrete Appl. Math."},{"issue":"3\u20134","key":"10.1016\/j.dam.2025.05.045_b10","first-page":"197","article-title":"On three domination-based identification problems in block graphs","volume":"191","author":"Chakraborty","year":"2024","journal-title":"Fund. Inform."},{"key":"10.1016\/j.dam.2025.05.045_b11","series-title":"Combinatorial Optimization","first-page":"137","article-title":"Open-separating dominating codes in graphs","volume":"Vol. 14594","author":"Chakraborty","year":"2024"},{"key":"10.1016\/j.dam.2025.05.045_b12","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1016\/S0304-3975(02)00536-4","article-title":"Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard","volume":"290","author":"Charon","year":"2003","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2025.05.045_b13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.5614\/ejgta.2014.2.2.1","article-title":"On open neighbourhood locating-dominating in graphs","volume":"2","author":"Chellali","year":"2014","journal-title":"Electron. J. Graph Theory Appl."},{"key":"10.1016\/j.dam.2025.05.045_b14","first-page":"135","article-title":"Locating-dominating sets in series-parallel networks","volume":"56","author":"Colburn","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/j.dam.2025.05.045_b15","article-title":"Combinatorial optimization: Packing and covering, SIAM","volume":"74","author":"Cornu\u00e9jols","year":"2001","journal-title":"CBMS"},{"key":"10.1016\/j.dam.2025.05.045_b16","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.dam.2021.06.006","article-title":"Characterizing extremal graphs for open neighbourhood location-domination","volume":"302","author":"Foucaud","year":"2021","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.05.045_b17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.tcs.2017.01.006","article-title":"Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds","volume":"668","author":"Foucaud","year":"2017","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2025.05.045_b18","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1007\/s00453-016-0184-1","article-title":"Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity","volume":"78","author":"Foucaud","year":"2017","journal-title":"Algorithmica"},{"year":"2013","series-title":"Private communication","author":"Foucaud","key":"10.1016\/j.dam.2025.05.045_b19"},{"key":"10.1016\/j.dam.2025.05.045_b20","first-page":"47","article-title":"Open locating-dominating sets in circulant graphs","volume":"42","author":"Givens","year":"2022","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2025.05.045_b21","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1016\/j.dam.2006.01.002","article-title":"Locating and total-dominating sets in trees","volume":"154","author":"Haynes","year":"2006","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.05.045_b22","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1007\/s00373-013-1311-2","article-title":"Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs","volume":"30","author":"Henning","year":"2014","journal-title":"Graphs Combin."},{"issue":"1\u20133","key":"10.1016\/j.dam.2025.05.045_b23","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0012-365X(01)00357-0","article-title":"On strongly identifying codes","volume":"254","author":"Honkala","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2025.05.045_b24","unstructured":"J. Jean, A. Lobstein, Watching systems, identifying, locating-dominating and discriminating codes in graphs, https:\/\/dragazo.github.io\/bibdom\/main.pdf."},{"key":"10.1016\/j.dam.2025.05.045_b25","doi-asserted-by":"crossref","first-page":"445","DOI":"10.7151\/dmgt.2374","article-title":"Optimal error-detecting open-locating-dominating set on the infinite triangular grid","volume":"43","author":"Jean","year":"2023","journal-title":"Discuss. Math. Graph Theory"},{"issue":"2","key":"10.1016\/j.dam.2025.05.045_b26","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.661507","article-title":"On a new class of codes for identifying vertices in graphs","volume":"44","author":"Karpovsky","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dam.2025.05.045_b27","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.dam.2015.04.024","article-title":"Optimal open-locating-dominating sets in infinite triangular grids","volume":"193","author":"Kincaid","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.05.045_b28","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01589100","article-title":"Facets and lifting procedures for the set covering polytope","volume":"45","author":"Nobili","year":"1989","journal-title":"Math. Program."},{"key":"10.1016\/j.dam.2025.05.045_b29","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.dam.2015.03.002","article-title":"Algorithmic aspects of open neighborhood location\u2013domination in graphs","volume":"216","author":"Panda","year":"2017","journal-title":"Discrete Appl. Math."},{"issue":"17","key":"10.1016\/j.dam.2025.05.045_b30","doi-asserted-by":"crossref","first-page":"2511","DOI":"10.1016\/j.dam.2006.03.002","article-title":"The first order definability of graphs: Upper bounds forquantifier depth","volume":"154","author":"Pikhurko","year":"2006","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.05.045_b31","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01587087","article-title":"On the facial structure of the set covering polytope","volume":"44","author":"Sassano","year":"1989","journal-title":"Math. Program."},{"key":"10.1016\/j.dam.2025.05.045_b32","first-page":"109","article-title":"Open neighborhood locating dominating sets","volume":"46","author":"Seo","year":"2010","journal-title":"Australas. J. Combina- Torics"},{"key":"10.1016\/j.dam.2025.05.045_b33","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.dam.2010.12.010","article-title":"Open neighborhood locating-dominating in trees","volume":"159","author":"Seo","year":"2011","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.05.045_b34","first-page":"445","article-title":"Dominating and reference sets in a graph","volume":"22","author":"Slater","year":"1988","journal-title":"J. Math. Phys. Sci."},{"key":"10.1016\/j.dam.2025.05.045_b35","series-title":"Intelligence in Communication Systems","first-page":"175","article-title":"An implementation of indoor location detection systems based on identifying codes","author":"Ungrangsi","year":"2004"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25002999?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25002999?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:31:32Z","timestamp":1762252292000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X25002999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":35,"alternative-id":["S0166218X25002999"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2025.05.045","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On open-separating dominating codes in graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2025.05.045","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}