Tuomo Lehtilä - UTU Research Portal

Tuomo Lehtilä

- Postdoctoral Researcher,
- Docent
Mathematics (Department of Mathematics and Statistics)

tualeh@utu.fi

: 397

: https://orcid.org/0000-0003-2940-8088

Teaching:

Three demonstration groups of Linear Algebra for Mathematics students in the first period of 2018.

1 of 2

On Unique Error Patterns in the Levenshtein’s Sequence Reconstruction Model (2025)
- IEEE Transactions on Information Theory
Junnila, Ville; Laihonen, Tero; Lehtilä, Tuomo
Optimal Local Identifying and Local Locating-dominating Codes (2024)
- Fundamenta Informaticae
Herva, Pyry; Laihonen, Tero; Lehtilä, Tuomo
Partition Strategies for the Maker-Breaker Domination Game (2024)
- Algorithmica
Bagan, Guillaume; Duchêne, Eric; Gledel, Valentin; Lehtilä, Tuomo; Parreau, Aline
Super domination: Graph classes, products and enumeration (2024)
- Discrete Applied Mathematics
Ghanbari Nima, Jäger Gerold, Lehtilä Tuomo
The Levenshtein’s Sequence Reconstruction Problem and the Length of the List (2024)
- IEEE Transactions on Information Theory
Junnila Ville, Laihonen Tero, Lehtilä Tuomo
Bounds and Extremal Graphs for Total Dominating Identifying Codes (2023)
- The Electronic Journal of Combinatorics
Foucaud Florent, Lehtilä Tuomo
Identifying codes in bipartite graphs of given maximum degree (2023)
- Procedia Computer Science
XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023) Chakraborty Dipayan, Foucaud Florent, Lehtilä Tuomo
Levenshtein’s Reconstruction Problem with Different Error Patterns (2023)
- IEEE International Symposium on Information Theory
2023 IEEE International Symposium on Information Theory (ISIT) Junnila Ville, Laihonen Tero, Lehtilä Tuomo
Locating-dominating sets: From graphs to oriented graphs (2023)
- Discrete Mathematics
Bousquet Nicolas, Deschamps Quentin, Lehtilä Tuomo, Parreau Aline
Neighbourhood complexity of graphs of bounded twin-width (2023)
- European Journal of Combinatorics
Bonnet Éouard, Foucaud Florent, Lehtilä Tuomo, Parreau Aline
On radio k-labeling of the power of the infinite path (2023)
- Information Processing Letters
Das Tapas, Lehtilä Tuomo, Nandi Soumen, Sen Sagnik, Supraja DK
The RED-BLUE SEPARATION problem on graphs (2023)
- Theoretical Computer Science
Dev Subhadeep Ranjan, Dey Sanjana, Foucaud Florent, Klasing Ralf, Lehtilä Tuomo
Improved lower bound for locating-dominating codes in binary Hamming spaces (2022)
- Designs, Codes and Cryptography
Junnila Ville, Laihonen Tero, Lehtilä Tuomo
Revisiting and improving upper bounds for identifying codes (2022)
- Siam Journal on Discrete Mathematics
Foucaud Florent, Lehtilä Tuomo
The RED-BLUE SEPARATION Problem on Graphs (2022)
- Lecture Notes in Computer Science
Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022, Proceedings Dev Subhadeep Ranjan, Dey Sanjana, Foucaud Florent, Klasing Ralf, Lehtilä Tuomo
On Levenshtein’s Channel and List Size in Information Retrieval (2021)
- IEEE Transactions on Information Theory
Junnila Ville, Laihonen Tero, Lehtilä Tuomo
Three ways to locate-dominate every vertex in a graph (2021) Proceedings of the Sixth Russian-Finnish Symposium on Discrete Mathematics Lehtilä Tuomo
On location, domination and information retrieval (2020) Lehtilä Tuomo
New Results on Codes for Location in Graphs (2019) Fifth Russian Finnish Symposium on Discrete Mathematics Junnila V, Laihonen T, Lehtilä T
On a Conjecture Regarding Identification in Hamming Graphs (2019)
- The Electronic Journal of Combinatorics
Junnila V, Laihonen T, Lehtila T