{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:11Z","timestamp":1780783151231,"version":"3.54.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_17","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:50Z","timestamp":1780780490000},"page":"236-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On $$(1,\\le l)$$-Locating-Dominating Codes in\u00a0Infinite Triangular Grid"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8712-5276","authenticated-orcid":false,"given":"Soura Sena","family":"Das","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2940-8088","authenticated-orcid":false,"given":"Tuomo","family":"Lehtil\u00e4","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sagnik","family":"Sen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"103772","DOI":"10.1016\/j.ejc.2023.103772","volume":"115","author":"\u00c9 Bonnet","year":"2024","unstructured":"Bonnet, \u00c9., Foucaud, F., Lehtil\u00e4, T., Parreau, A.: Neighbourhood complexity of graphs of bounded twin-width. Eur. J. Comb. 115, 103772 (2024)","journal-title":"Eur. J. Comb."},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1137\/S0895480199360990","volume":"13","author":"GD Cohen","year":"2000","unstructured":"Cohen, G.D., Honkala, I., Lobstein, A., Z\u00e9mor, G.: Bounds for codes identifying vertices in the hexagonal grid. SIAM J. Discret. Math. 13(4), 492\u2013504 (2000)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/j.disc.2016.11.022","volume":"340","author":"DW Cranston","year":"2017","unstructured":"Cranston, D.W., West, D.B.: An introduction to the discharging method via graph coloring. Discret. Math. 340(4), 766\u2013793 (2017)","journal-title":"Discret. Math."},{"issue":"18","key":"17_CR4","doi-asserted-by":"publisher","first-page":"2910","DOI":"10.1016\/j.dam.2013.06.002","volume":"161","author":"A Cukierman","year":"2013","unstructured":"Cukierman, A., Yu, G.: New bounds on the minimum density of an identifying code for the infinite hexagonal grid. Discret. Appl. Math. 161(18), 2910\u20132924 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"21","key":"17_CR5","doi-asserted-by":"publisher","first-page":"2670","DOI":"10.1016\/j.disc.2006.04.028","volume":"306","author":"I Honkala","year":"2006","unstructured":"Honkala, I.: An optimal locating-dominating set in the infinite triangular grid. Discret. Math. 306(21), 2670\u20132681 (2006)","journal-title":"Discret. Math."},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.ejc.2004.09.002","volume":"27","author":"I Honkala","year":"2006","unstructured":"Honkala, I., Laihonen, T.: On locating-dominating sets in infinite grids. Eur. J. Comb. 27(2), 218\u2013227 (2006)","journal-title":"Eur. J. Comb."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Honkala, I., Laihonen, T., Ranto, S.: On locating-dominating codes in binary hamming spaces. Discrete Math. Theor. Comput. Sci. 6(2) (2004)","DOI":"10.46298\/dmtcs.322"},{"key":"17_CR8","unstructured":"Jean, D., Lobstein, A.: Watching systems, identifying, locating-dominating and discriminating codes in graphs. https:\/\/dragazo.github.io\/bibdom\/main.pdf"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/net.22254","volume":"85","author":"DC Jean","year":"2025","unstructured":"Jean, D.C., Seo, S.J.: Optimal error-detection system for identifying codes. Networks 85(1), 61\u201375 (2025)","journal-title":"Networks"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"M Karpovsky","year":"1998","unstructured":"Karpovsky, M., Chakrabarty, K., Levitin, L.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory 44(2), 599\u2013611 (1998). https:\/\/doi.org\/10.1109\/18.661507","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-45624-4_9","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"T Laihonen","year":"2001","unstructured":"Laihonen, T., Ranto, S.: Codes identifying sets of vertices. In: Bozta\u015f, S., Shparlinski, I.E. (eds.) AAECC 2001. LNCS, vol. 2227, pp. 82\u201391. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45624-4_9"},{"key":"17_CR12","unstructured":"Lehtil\u00e4, T.: Three ways to locate-dominate every vertex in a graph. In: Proceedings of Sixth Russian-Finnish Symposium on Discrete Mathematics, pp. 100\u2013105 (2021)"},{"key":"17_CR13","unstructured":"Pelto, M.: On locating-dominating codes for locating large numbers of vertices in the infinite king grid. Australas. J. Comb. (2011)"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.3934\/amc.2012.6.27","volume":"6","author":"M Pelto","year":"2012","unstructured":"Pelto, M.: On (r,$$\\le $$ 2)-locating-dominating codes in the infinite king grid. Adv. Math. Commun. 6(1), 27\u201338 (2012)","journal-title":"Adv. Math. Commun."},{"issue":"16\u201317","key":"17_CR15","doi-asserted-by":"publisher","first-page":"2597","DOI":"10.1016\/j.dam.2013.04.027","volume":"161","author":"M Pelto","year":"2013","unstructured":"Pelto, M.: Optimal (r,$$\\le $$ 3)-locating-dominating codes in the infinite king grid. Discret. Appl. Math. 161(16\u201317), 2597\u20132603 (2013)","journal-title":"Discret. Appl. Math."},{"key":"17_CR16","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."},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-031-42250-8_3","volume-title":"Cellular Automata and Discrete Complex Systems","author":"V Salo","year":"2023","unstructured":"Salo, V., T\u00f6rm\u00e4, I.: Diddy: a python toolbox for infinite discrete dynamical systems. In: Manzoni, L., Mariot, L., Roy Chowdhury, D. (eds.) Cellular Automata and Discrete Complex Systems, pp. 33\u201347. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-42250-8_3"},{"issue":"3\u20134","key":"17_CR18","first-page":"331","volume":"191","author":"V Salo","year":"2024","unstructured":"Salo, V., T\u00f6rm\u00e4, I.: Finding codes on infinite grids automatically. Fund. Inform. 191(3\u20134), 331\u2013349 (2024)","journal-title":"Fund. Inform."},{"key":"17_CR19","unstructured":"Salo, V., T\u00f6rm\u00e4, I.: Griddy. http:\/\/github.com\/ilkka-torma\/griddy. Accessed 04 Apr 2026"},{"issue":"2","key":"17_CR20","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1051\/ro\/2024046","volume":"58","author":"RM Sampaio","year":"2024","unstructured":"Sampaio, R.M., Sobral, G.A., Wakabayashi, Y.: Density of identifying codes of hexagonal grids with finite number of rows. RAIRO Oper. Res. 58(2), 1633\u20131651 (2024)","journal-title":"RAIRO Oper. Res."},{"issue":"1","key":"17_CR21","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"},{"issue":"4","key":"17_CR22","first-page":"445","volume":"22","author":"PJ Slater","year":"1988","unstructured":"Slater, P.J.: Dominating and reference sets in a graph. J. Math. Phys. Sci. 22(4), 445\u2013455 (1988)","journal-title":"J. Math. Phys. Sci."},{"issue":"1\u20133","key":"17_CR23","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0012-365X(01)00244-8","volume":"249","author":"PJ Slater","year":"2002","unstructured":"Slater, P.J.: Fault-tolerant locating-dominating sets. Discret. Math. 249(1\u20133), 179\u2013189 (2002)","journal-title":"Discret. Math."},{"key":"17_CR24","unstructured":"Stolee, D.: Adage. http:\/\/github.com\/derrickstolee\/ADAGE. Accessed 04 Apr 2026"},{"key":"17_CR25","unstructured":"Stolee, D.: Automated discharging arguments for density problems in grids. arXiv:1409.5922 (2014)"},{"key":"17_CR26","unstructured":"West, D.B.: Introduction to Graph Theory (2nd Edition). Prentice Hall (2001)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:52Z","timestamp":1780780492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}