{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T15:50:38Z","timestamp":1768319438186,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031252105","type":"print"},{"value":"9783031252112","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-25211-2_21","type":"book-chapter","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T19:02:42Z","timestamp":1674673362000},"page":"271-283","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Three Domination-Based Identification Problems in\u00a0Block Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7169-7288","authenticated-orcid":false,"given":"Dipayan","family":"Chakraborty","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8198-693X","authenticated-orcid":false,"given":"Florent","family":"Foucaud","sequence":"additional","affiliation":[]},{"given":"Aline","family":"Parreau","sequence":"additional","affiliation":[]},{"given":"Annegret K.","family":"Wagler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,26]]},"reference":[{"key":"21_CR1","unstructured":"Argiroffo, G.R., Bianchi, S.M., Lucarini, Y., Wagler, A.K.: On the identifying code number of block graphs. In: Proceedings of ICGT 2018, Lyon, France (2018)"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.dam.2019.08.001","volume":"281","author":"GR Argiroffo","year":"2020","unstructured":"Argiroffo, G.R., Bianchi, S.M., Lucarini, Y., Wagler, A.K.: Linear-time algorithms for three domination-based separation problems in block graphs. Discret. Appl. Math. 281, 6\u201341 (2020)","journal-title":"Discret. Appl. Math."},{"key":"21_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":"21_CR4","doi-asserted-by":"crossref","unstructured":"Balbuena, C., Foucaud, F., Hansberg, A.: Locating-dominating sets and identifying codes in graphs of girth at least 5. Electron. J. Comb. 22, P2.15 (2015)","DOI":"10.37236\/4562"},{"key":"21_CR5","first-page":"21","volume":"31","author":"N Bertrand","year":"2005","unstructured":"Bertrand, N., Charon, I., Hudry, O., Lobstein, A.: 1-identifying codes on trees. Australas. J Comb. 31, 21\u201336 (2005)","journal-title":"Australas. J Comb."},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1137\/14097879X","volume":"29","author":"N Bousquet","year":"2015","unstructured":"Bousquet, N., Lagoutte, A., Li, Z., Parreau, A., Thomass\u00e9, S.: Identifying codes in hereditary classes of graphs and VC-dimension. SIAM J. Discret. Math. 29(4), 2047\u20132064 (2015)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"21_CR7","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(3), 2109\u20132120 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-69115-4_74","volume-title":"Rough Sets and Current Trends in Computing","author":"BS Chlebus","year":"1998","unstructured":"Chlebus, B.S., Nguyen, S.H.: On finding optimal discretizations for two attributes. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 537\u2013544. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-69115-4_74"},{"issue":"4","key":"21_CR9","doi-asserted-by":"publisher","first-page":"2619","DOI":"10.1137\/22M148999X","volume":"36","author":"F Foucaud","year":"2022","unstructured":"Foucaud, F., Lehtil\u00e4, T.: Revisiting and improving upper bounds for identifying codes. SIAM J. Discret. Math. 36(4), 2619\u20132634 (2022)","journal-title":"SIAM J. Discret. Math."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.jda.2014.08.004","volume":"31","author":"F Foucaud","year":"2015","unstructured":"Foucaud, F.: Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes. J. Discret. Algorithms 31, 48\u201368 (2015). https:\/\/doi.org\/10.1016\/j.jda.2014.08.004","journal-title":"J. Discret. Algorithms"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.dam.2021.06.006","volume":"302","author":"F Foucaud","year":"2021","unstructured":"Foucaud, F., Ghareghani, N., Roshany-Tabrizi, A., Sharifani, P.: Characterizing extremal graphs for open neighbourhood location-domination. Discret. Appl. Math. 302, 76\u201379 (2021)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"21_CR12","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1002\/jgt.21686","volume":"73","author":"F Foucaud","year":"2013","unstructured":"Foucaud, F., Gravier, S., Naserasr, R., Parreau, A., Valicov, P.: Identifying codes in line graphs. J. Graph Theory 73(4), 425\u2013448 (2013)","journal-title":"J. Graph Theory"},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1016\/j.disc.2015.11.016","volume":"339","author":"F Foucaud","year":"2016","unstructured":"Foucaud, F., Henning, M.A.: Location-domination and matching in cubic graphs. Discret. Math. 339(4), 1221\u20131231 (2016)","journal-title":"Discret. Math."},{"key":"21_CR14","doi-asserted-by":"publisher","unstructured":"Foucaud, F., Mertzios, G.B., Naserasr, R., Parreau, A., Valicov, P.: Identification, location-domination and metric dimension on interval and permutation graphs. I. bounds. Theor. Comput. Sci. 668, 43\u201358 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.01.006","DOI":"10.1016\/j.tcs.2017.01.006"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Foucaud, F., Mertzios, G.B., Naserasr, R., Parreau, A., Valicov, P.: Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity. Algorithmica 78(3), 914\u2013944 (2017)","DOI":"10.1007\/s00453-016-0184-1"},{"key":"21_CR16","first-page":"487","volume":"249","author":"D Garijo","year":"2014","unstructured":"Garijo, D., Gonz\u00e1lez, A., M\u00e1rquez, A.: The difference between the metric dimension and the determining number of a graph. Appl. Math. Comput. 249, 487\u2013501 (2014)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4153\/CMB-1963-001-x","volume":"6","author":"F Harary","year":"1963","unstructured":"Harary, F.: A characterization of block-graphs. Can. Math. Bull. 6(1), 1\u20136 (1963)","journal-title":"Can. Math. Bull."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1007\/s00373-013-1311-2","volume":"30","author":"MA Henning","year":"2014","unstructured":"Henning, M.A., Yeo, A.: Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs. Graphs Comb. 30, 909\u2013932 (2014)","journal-title":"Graphs Comb."},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(79)90069-8","volume":"27","author":"E Howorka","year":"1979","unstructured":"Howorka, E.: On metric properties of certain clique graphs. J. Comb. Theory Ser. B 27(1), 67\u201374 (1979)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"21_CR20","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(2), 599\u2013611 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"21_CR21","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1137\/0906067","volume":"6","author":"BME Moret","year":"1985","unstructured":"Moret, B.M.E., Shapiro, H.D.: On minimizing a set of tests. SIAM J. Sci. Stat. Comput. 6(4), 983\u20131003 (1985)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"21_CR22","first-page":"97","volume":"45","author":"DF Rall","year":"1984","unstructured":"Rall, D.F., Slater, P.J.: On location-domination numbers for certain classes of graphs. Congr. Numer. 45, 97\u2013106 (1984)","journal-title":"Congr. Numer."},{"issue":"4","key":"21_CR23","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1109\/12.214691","volume":"42","author":"N Rao","year":"1993","unstructured":"Rao, N.: Computational complexity issues in operative diagnosis of graph-based systems. IEEE Trans. Comput. 42(4), 447\u2013457 (1993)","journal-title":"IEEE Trans. Comput."},{"key":"21_CR24","first-page":"75","volume":"22","author":"A R\u00e9nyi","year":"1961","unstructured":"R\u00e9nyi, A.: On random generating elements of a finite boolean algebra. Acta Scientiarum Mathematicarum Szeged 22, 75\u201381 (1961)","journal-title":"Acta Scientiarum Mathematicarum Szeged"},{"key":"21_CR25","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\u2013120 (2010)","journal-title":"Australas. J. Comb."},{"issue":"1","key":"21_CR26","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/net.3230170105","volume":"17","author":"PJ Slater","year":"1987","unstructured":"Slater, P.J.: Domination and location in acyclic graphs. Networks 17(1), 55\u201364 (1987)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25211-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T22:44:13Z","timestamp":1767134653000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25211-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031252105","9783031252112"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25211-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gandhinagar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam2023.daiict.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}