Tuomo Lehtilä
tualeh@utu.fi +358 29 450 4333 +358 50 331 7634 Vesilinnantie 5 Turku 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
- Identifying codes in graphs of given maximum degree: Characterizing trees (2026)
- Discrete Mathematics
(A1 Refereed original research article in a scientific journal) - Identifying Codes in Triangle‐Free Graphs of Bounded Maximum Degree (2026)
- Journal of Graph Theory
(A1 Refereed original research article in a scientific journal) - On the density of (1,≤ℓ)-locating-dominating codes in the infinite square grid (2026)
- Discrete Mathematics
(A1 Refereed original research article in a scientific journal) - Reconstructing graphs with subgraph compositions (2026)
- Discrete Applied Mathematics
(A1 Refereed original research article in a scientific journal) - The generalized double pouring problem: Analysis, bounds and algorithms (2026)
- Discrete Applied Mathematics
(A1 Refereed original research article in a scientific journal) - Levenshtein's sequence reconstruction problem and results for larger alphabet sizes (2025)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - On Levenshtein’s Reconstruction Problem for Channels with Unique Insertion Error Patterns (2025)
- Proceedings: Information Theory Workshop
(A4 Refereed article in a conference publication ) - On the Intersections of q-ary Hamming Balls (2025)
- Proceedings: Information Theory Workshop
(A4 Refereed article in a conference publication ) - 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) - Reconstructing Graphs from Subgraph Compositions (2025)
- IEEE International Symposium on Information Theory
(A4 Refereed article in a conference publication )



