| On Levenshtein’s channel and list size in information retrieval V Junnila, T Laihonen, T Lehtilä IEEE Transactions on Information Theory 67 (6), 3322-3341, 2020 | 17 | 2020 |
| On regular and new types of codes for location-domination V Junnila, T Laihonen, T Lehtilä Discrete Applied Mathematics 247, 225-241, 2018 | 12 | 2018 |
| Locating-dominating sets: From graphs to oriented graphs N Bousquet, Q Deschamps, T Lehtilä, A Parreau Discrete Mathematics 346 (1), 113124, 2023 | 7 | 2023 |
| Revisiting and improving upper bounds for identifying codes F Foucaud, T Lehtilä SIAM Journal on Discrete Mathematics 36 (4), 2619-2634, 2022 | 7 | 2022 |
| On a conjecture regarding identification in hamming graphs V Junnila, T Laihonen, T Lehtilä The Electronic Journal of Combinatorics, P2. 45-P2. 45, 2019 | 7* | 2019 |
| On stronger types of locating-dominating codes V Junnila, T Laihonen, T Lehtilä, ML Puertas Discrete Mathematics & Theoretical Computer Science 21, 2019 | 6 | 2019 |
| Neighbourhood complexity of graphs of bounded twin-width É Bonnet, F Foucaud, T Lehtilä, A Parreau European Journal of Combinatorics 115, 103772, 2024 | 4 | 2024 |
| Improved lower bound for locating-dominating codes in binary Hamming spaces V Junnila, T Laihonen, T Lehtilä Designs, Codes and Cryptography 90 (1), 67-85, 2022 | 4 | 2022 |
| Improved codes for list decoding in the Levenshtein's channel and information retrieval T Laihonen, T Lehtilä 2017 IEEE International Symposium on Information Theory (ISIT), 2643-2647, 2017 | 4 | 2017 |
| The RED-BLUE SEPARATION problem on graphs SR Dev, S Dey, F Foucaud, R Klasing, T Lehtilä Theoretical Computer Science, 114061, 2023 | 3 | 2023 |
| New results on codes for location in graphs V Junnila, T Laihonen, T Lehtilä ББК 22.176 Т45 Научные редакторы/Editors, 105, 2019 | 3 | 2019 |
| On the list size in the Levenshtein’s sequence reconstruction problem V Junnila, T Laihonen, T Lehtilä 2022 IEEE International Symposium on Information Theory (ISIT), 510-515, 2022 | 2 | 2022 |
| The Levenshtein’s sequence reconstruction problem and the length of the list V Junnila, T Laihonen, T Lehtilä IEEE Transactions on Information Theory, 2023 | 1 | 2023 |
| Levenshtein’s Reconstruction Problem with Different Error Patterns V Junnila, T Laihonen, T Lehtilä 2023 IEEE International Symposium on Information Theory (ISIT), 1300-1305, 2023 | 1 | 2023 |
| On radio k-labeling of the power of the infinite path T Das, T Lehtilä, S Nandi, S Sen, DK Supraja Information Processing Letters 182, 2023 | 1 | 2023 |
| Identifying codes in bipartite graphs of given maximum degree D Chakraborty, F Foucaud, T Lehtilä Procedia Computer Science 223, 157-165, 2023 | 1 | 2023 |
| Three ways to locate-dominate every vertex in a graph T Lehtilä Russian-Finnish Symposium on Discrete Mathematics, 100, 0 | 1 | |
| Super domination: Graph classes, products and enumeration N Ghanbari, G Jäger, T Lehtilä Discrete Applied Mathematics 349, 8-24, 2024 | | 2024 |
| Resolving Sets in Temporal Graphs J Bok, A Dailly, T Lehtilä arXiv preprint arXiv:2403.13183, 2024 | | 2024 |
| Identifying codes in graphs of given maximum degree. II. Triangle-free graphs D Chakraborty, F Foucaud, MA Henning, T Lehtilä arXiv preprint arXiv:2403.17877, 2024 | | 2024 |
