Tuomo Lehtilä
tualeh@utu.fi Office: 397 ORCID identifier: https://orcid.org/0000-0003-2940-8088 |
Teaching
Teaching:
Three demonstration groups of Linear Algebra for Mathematics students in the first period of 2018.
Publications 
1 of 2
- On Unique Error Patterns in the Levenshtein’s Sequence Reconstruction Model (2025)
- IEEE Transactions on Information Theory
(A1 Refereed original research article in a scientific journal) - Optimal Local Identifying and Local Locating-dominating Codes (2024)
- Fundamenta Informaticae
(A1 Refereed original research article in a scientific journal) - Partition Strategies for the Maker-Breaker Domination Game (2024)
- Algorithmica
(A1 Refereed original research article in a scientific journal) - Super domination: Graph classes, products and enumeration (2024)
- Discrete Applied Mathematics
(A1 Refereed original research article in a scientific journal) - The Levenshtein’s Sequence Reconstruction Problem and the Length of the List (2024)
- IEEE Transactions on Information Theory
(A1 Refereed original research article in a scientific journal) - Bounds and Extremal Graphs for Total Dominating Identifying Codes (2023)
- The Electronic Journal of Combinatorics
(A1 Refereed original research article in a scientific journal) - Identifying codes in bipartite graphs of given maximum degree (2023)
- Procedia Computer Science
(A4 Refereed article in a conference publication ) - Levenshtein’s Reconstruction Problem with Different Error Patterns (2023)
- IEEE International Symposium on Information Theory
(A4 Refereed article in a conference publication ) - Locating-dominating sets: From graphs to oriented graphs (2023)
- Discrete Mathematics
(A1 Refereed original research article in a scientific journal) - Neighbourhood complexity of graphs of bounded twin-width (2023)
- European Journal of Combinatorics
(A1 Refereed original research article in a scientific journal) - On radio k-labeling of the power of the infinite path (2023)
- Information Processing Letters
(A1 Refereed original research article in a scientific journal) - The RED-BLUE SEPARATION problem on graphs (2023)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Improved lower bound for locating-dominating codes in binary Hamming spaces (2022)
- Designs, Codes and Cryptography
(A1 Refereed original research article in a scientific journal) - Revisiting and improving upper bounds for identifying codes (2022)
- Siam Journal on Discrete Mathematics
(A1 Refereed original research article in a scientific journal) - The RED-BLUE SEPARATION Problem on Graphs (2022)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - On Levenshtein’s Channel and List Size in Information Retrieval (2021)
- IEEE Transactions on Information Theory
(A1 Refereed original research article in a scientific journal) - Three ways to locate-dominate every vertex in a graph (2021) Proceedings of the Sixth Russian-Finnish Symposium on Discrete Mathematics Lehtilä Tuomo
(Other publication) - On location, domination and information retrieval (2020) Lehtilä Tuomo
(G5 Article dissertation ) - New Results on Codes for Location in Graphs (2019) Fifth Russian Finnish Symposium on Discrete Mathematics Junnila V, Laihonen T, Lehtilä T
(A4 Refereed article in a conference publication ) - On a Conjecture Regarding Identification in Hamming Graphs (2019)
- The Electronic Journal of Combinatorics
(A1 Refereed original research article in a scientific journal)
UTU Research Portal