{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:28Z","timestamp":1772283688415,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,1,11]],"date-time":"2012-01-11T00:00:00Z","timestamp":1326240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00373-011-1124-0","type":"journal-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T10:54:10Z","timestamp":1326192850000},"page":"333-347","source":"Crossref","is-referenced-by-count":6,"title":["Watching Systems in the King Grid"],"prefix":"10.1007","volume":"29","author":[{"given":"David","family":"Auger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iiro","family":"Honkala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,1,11]]},"reference":[{"key":"1124_CR1","unstructured":"Auger, D., Charon, I., Hudry, O., Lobstein, A.: Maximum size of a minimum watching system and the graphs achieving the bound (submitted)"},{"key":"1124_CR2","unstructured":"Auger, D., Charon, I., Hudry, O., Lobstein, A.: Watching systems in graphs: an extension of identifying codes. Discret. Appl. Math. (2011) (in press)"},{"key":"1124_CR3","doi-asserted-by":"crossref","unstructured":"Charon, I., Hudry, O., Lobstein, A.: Identifying codes with small radius in some infinite regular graphs. Electron. J. Comb. 9(1) (2002)","DOI":"10.37236\/1628"},{"key":"1124_CR4","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1137\/S0895480199360990","volume":"13","author":"G.D. 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, 492 (2000)","journal-title":"SIAM J. Discret. Math"},{"issue":"2","key":"1124_CR5","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/12.908992","volume":"50","author":"G.D. Cohen","year":"2001","unstructured":"Cohen G.D., Honkala L., Lobstein A., Z\u00e9mor G.: On codes identifying vertices in the two-dimensional square lattice with diagonals. IEEE Trans. Comput. 50(2), 174\u2013176 (2001)","journal-title":"IEEE Trans. Comput."},{"issue":"R113","key":"1124_CR6","first-page":"1","volume":"16","author":"D.W. Cranston","year":"2009","unstructured":"Cranston D.W., Yu G.: A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid. Electron. J. Comb. 16(R113), 1 (2009)","journal-title":"Electron. J. Comb."},{"issue":"4","key":"1124_CR7","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/TIT.1982.1056526","volume":"28","author":"S. Golomb","year":"1982","unstructured":"Golomb S., Taylor H.: Two-dimensional synchronization patterns for minimum ambiguity. IEEE Trans. Inf. Theory 28(4), 600\u2013604 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1124_CR8","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s00373-003-0531-2","volume":"19","author":"I. Honkala","year":"2003","unstructured":"Honkala I., Laihonen T.: Codes for identification in the king lattice. Graphs Comb. 19(4), 505\u2013516 (2003)","journal-title":"Graphs Comb."},{"issue":"10","key":"1124_CR9","first-page":"1204","volume":"9","author":"I. Honkala","year":"2003","unstructured":"Honkala I., Lobstein A.: On identification in Z 2 using translates of given patterns. J. Univ. Comput. Sci 9(10), 1204\u20131219 (2003)","journal-title":"J. Univ. Comput. Sci"},{"issue":"2","key":"1124_CR10","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"M.G. 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"},{"key":"1124_CR11","unstructured":"Lobstein A. Identifying and locating-dominating codes in graphs, a bibliography. http:\/\/perso.enst.fr\/~lobstein\/debutBIBidetlocdom.pdf"},{"key":"1124_CR12","doi-asserted-by":"crossref","unstructured":"Pelto M.: New bounds for (r,\u00a0\u2264\u00a02)-identifying codes in the infinite king grid. Cryptogr. Commun., pp. 1\u20137 (2009)","DOI":"10.1007\/s12095-009-0015-1"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1124-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1124-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1124-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T15:00:58Z","timestamp":1593529258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1124-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,11]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["1124"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1124-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,11]]}}}