{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:46:19Z","timestamp":1725860779136},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411675"},{"type":"electronic","value":"9783319411682"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41168-2_7","type":"book-chapter","created":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T01:26:28Z","timestamp":1467595588000},"page":"77-88","source":"Crossref","is-referenced-by-count":4,"title":["Minimum-Density Identifying Codes in Square Grids"],"prefix":"10.1007","author":[{"given":"Marwane","family":"Bouznif","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Havet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myriam","family":"Preissmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1137\/S0895480104444089","volume":"19","author":"Y Ben-Haim","year":"2005","unstructured":"Ben-Haim, Y., Litsyn, S.: Exact minimum density of codes identifying vertices in the square grid. SIAM J. Discrete Math. 19, 69\u201382 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Charon, I., Honkala, I., Hudry, O., Lobstein, A.: General bounds for identifying codes in some infinite regular graphs. Electron. J. Comb. 8(1), Research Paper 39, 21 pp. (2001)","DOI":"10.37236\/1583"},{"key":"7_CR3","unstructured":"Cohen, G., Gravier, S., Honkala, I., Lobstein, A., Mollard, M., Payan, C., Z\u00e9mor, G.: Improved identifying codes for the grid, Comment to [4]"},{"issue":"1","key":"7_CR4","doi-asserted-by":"crossref","first-page":"R19","DOI":"10.37236\/1451","volume":"6","author":"G Cohen","year":"1999","unstructured":"Cohen, G., Honkala, I., Lobstein, A., Z\u00e9mor, G.: New bounds for codes identifying vertices in graphs. Electron. J. Comb. 6(1), R19 (1999)","journal-title":"Electron. J. Comb."},{"key":"7_CR5","first-page":"2910","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 discrete. Appl. Math. 161, 2910\u20132924 (2013)","journal-title":"Appl. Math."},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.tcs.2004.02.007","volume":"319","author":"M Daniel","year":"2004","unstructured":"Daniel, M., Gravier, S., Moncel, J.: Identifying codes in some subgraphs of the square lattice. Theoret. Comput. Sci. 319, 411\u2013421 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"8","key":"7_CR7","doi-asserted-by":"crossref","first-page":"1760","DOI":"10.1016\/j.jcta.2006.03.011","volume":"113","author":"I Honkala","year":"2006","unstructured":"Honkala, I.: A family of optimal identifying codes in $$\\mathbb{Z}^2$$ Z 2 . J. Comb. Theor. Ser. A 113(8), 1760\u20131763 (2006)","journal-title":"J. Comb. Theor. Ser. A"},{"issue":"13\u201314","key":"7_CR8","doi-asserted-by":"crossref","first-page":"2042","DOI":"10.1016\/j.dam.2013.02.032","volume":"161","author":"V Junnila","year":"2013","unstructured":"Junnila, V.: New lower bound for 2-identifying code in the square grid. Discrete Appl. Math. 161(13\u201314), 2042\u20132051 (2013)","journal-title":"Discrete Appl. Math."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Junnila, V., Laihonen, T.: Optimal lower bound for 2-identifying codes in the hexagonal grid. Electron. J. Comb. 19(2), Paper 38 (2012)","DOI":"10.37236\/2414"},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"M Karpovsky","year":"1998","unstructured":"Karpovsky, M., 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"},{"issue":"6","key":"7_CR11","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1109\/JSAC.2004.830895","volume":"22","author":"S Ray","year":"2004","unstructured":"Ray, S., Starobinski, D., Trachtenberg, A., Ungrangsi, R.: Robust location detection with sensor networks. IEEE J. Sel. Areas Commun. 22(6), 1016\u20131025 (2004)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"1\u20133","key":"7_CR12","doi-asserted-by":"crossref","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. Discrete Math. 249(1\u20133), 179\u2013189 (2002)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41168-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,23]],"date-time":"2020-09-23T08:06:00Z","timestamp":1600848360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41168-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411675","9783319411682"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41168-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}