| On strongly identifying codes I Honkala, T Laihonen, S Ranto Discrete Mathematics 254 (1-3), 191-205, 2002 | 78 | 2002 |
| On locating–dominating sets in infinite grids I Honkala, T Laihonen European Journal of Combinatorics 27 (2), 218-227, 2006 | 58 | 2006 |
| On codes identifying sets of vertices in Hamming spaces I Honkala, T Laihonen, S Ranto Designs, Codes and Cryptography 24 (2), 193-204, 2001 | 58 | 2001 |
| Codes identifying sets of vertices T Laihonen, S Ranto Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 14th …, 2001 | 48 | 2001 |
| Sequences of optimal identifying codes TK Laihonen IEEE Transactions on Information Theory 48 (3), 774-776, 2002 | 46 | 2002 |
| On identifying codes in the triangular and square grids I Honkala, T Laihonen SIAM Journal on Computing 33 (2), 304-312, 2004 | 42 | 2004 |
| Two families of optimal identifying codes in binary Hamming spaces SM Ranto, IS Honkala, TK Laihonen IEEE Transactions on Information Theory 48 (5), 1200-1203, 2002 | 42 | 2002 |
| Codes for identification in the king lattice I Honkala, T Laihonen Graphs and Combinatorics 19 (4), 505-516, 2003 | 38 | 2003 |
| On a new class of identifying codes in graphs I Honkala, T Laihonen Information Processing Letters 102 (2-3), 92-98, 2007 | 37 | 2007 |
| On locating-dominating codes in binary Hamming spaces I Honkala, T Laihonen, S Ranto Discrete Mathematics & Theoretical Computer Science 6, 2004 | 36 | 2004 |
| Optimal identifying codes in cycles and paths V Junnila, T Laihonen Graphs and Combinatorics 28 (4), 469-481, 2012 | 32 | 2012 |
| On upper bounds for minimum distance and covering radius of non-binary codes T Laihonen, S Litsyn Designs, Codes and Cryptography 14, 71-80, 1998 | 31 | 1998 |
| Linear Multisecret-Sharing Schemes and Error-Correcting Codes. C Ding, T Laihonen, A Renvall J. Univers. Comput. Sci. 3 (9), 1023-1036, 1997 | 31 | 1997 |
| Improved bounds on identifying codes in binary Hamming spaces G Exoo, V Junnila, T Laihonen, S Ranto European Journal of Combinatorics 31 (3), 813-827, 2010 | 29 | 2010 |
| Locally identifying colourings for graphs with given maximum degree F Foucaud, I Honkala, T Laihonen, A Parreau, G Perarnau Discrete Mathematics 312 (10), 1832-1837, 2012 | 27 | 2012 |
| New bounds on binary identifying codes G Exoo, T Laihonen, S Ranto Discrete Applied Mathematics 156 (12), 2250-2263, 2008 | 27 | 2008 |
| Families of optimal codes for strong identification T Laihonen, S Ranto Discrete applied mathematics 121 (1-3), 203-213, 2002 | 26 | 2002 |
| Optimal codes for strong identification T Laihonen European Journal of Combinatorics 23 (3), 307-313, 2002 | 25 | 2002 |
| On the size of identifying codes in binary hypercubes S Janson, T Laihonen Journal of Combinatorial Theory, Series A 116 (5), 1087-1096, 2009 | 24 | 2009 |
| On the identification of sets of points in the square lattice Honkala, Laihonen Discrete & Computational Geometry 29, 139-152, 2002 | 24 | 2002 |
