New bounds for (r, <= 2)-identifying codes in the infinite king grid. - Mikko Pelto (Cryptogr. Commun., 2010)

On locating-dominating codes for locating large numbers of vertices in the infinite king grid. - Mikko Pelto (Australas. J Comb., 2011)

On (r, ≤ 2)-locating-dominating codes in the infinite king grid. - Mikko Pelto (Adv. Math. Commun., 2012)

Optimal (r, ≤3)-locating-dominating codes in the infinite king grid. - Mikko Pelto (Discret. Appl. Math., 2013)

Optimal identifying codes in the infinite 3-dimensional king grid. - Mikko Pelto (Eur. J. Comb., 2014)

Maximum difference about the size of optimal identifying codes in graphs differing by one vertex. - Mikko Pelto (Discret. Math. Theor. Comput. Sci., 2015)

On locating-dominating codes in the infinite king grid. - Mikko Pelto (Ars Comb., 2016)

The number of completely different optimal identifying codes in the infinite square grid. - Mikko Pelto (Discret. Appl. Math., 2017)

Identifying codes on directed de Bruijn graphs. - Debra L. Boutin; Victoria Horan Goliber; Mikko Pelto (Discret. Appl. Math., 2019)