Y. Ben-haim and S. Litsyn, Exact Minimum Density of Codes Identifying Vertices in the Square Grid, SIAM Journal on Discrete Mathematics, vol.19, issue.1, pp.69-82, 2005.
DOI : 10.1137/S0895480104444089

I. Charon, I. Honkala, O. Hudry, and A. Lobstein, General bounds for identifying codes in some infinite regular graphs, Electron. J. Combin, vol.8, issue.1, 2001.

I. Charon, I. Honkala, O. Hudry, and A. Lobstein, The minimum density of an identifying code in the king lattice, Discrete Mathematics, vol.276, issue.1-3, pp.95-109, 2004.
DOI : 10.1016/S0012-365X(03)00306-6

I. Charon, O. Hudry, and A. Lobstein, Identifying codes with small radius in some infinite regular graphs, Electron. J. Combin, vol.9, issue.1, 2002.

G. Cohen, I. Honkala, A. Lobstein, and G. Zémor, Bounds for Codes Identifying Vertices in the Hexagonal Grid, SIAM Journal on Discrete Mathematics, vol.13, issue.4, pp.492-504, 2000.
DOI : 10.1137/S0895480199360990

D. W. Cranston and G. Yu, A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid, Electron. J. Combin, vol.16, issue.16, 2009.

I. Honkala and T. Laihonen, On Identifying Codes in the Triangular and Square Grids, SIAM Journal on Computing, vol.33, issue.2, pp.304-312, 2004.
DOI : 10.1137/S0097539703433110

V. Junnila and T. Laihonen, Optimal lower bound for 2-identifying code in the hexagonal grid, 2010.

M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin, On a new class of codes for identifying vertices in graphs, IEEE Transactions on Information Theory, vol.44, issue.2, pp.599-611, 1998.
DOI : 10.1109/18.661507

R. Martin and B. Stanton, Lower bounds for identifying codes in some infinite grids, Electron. J. Combin, vol.17, issue.122, 2010.

P. J. Slater, Fault-tolerant locating-dominating sets, Discrete Mathematics, vol.249, issue.1-3, pp.179-189, 2002.
DOI : 10.1016/S0012-365X(01)00244-8
URL : http://doi.org/10.1016/s0012-365x(01)00244-8