Tuomo Lehtilä
tualeh@utu.fi +358 29 450 4333 +358 50 331 7634 Vesilinnantie 5 Turku : 397 |
Teaching:
Three demonstration groups of Linear Algebra for Mathematics students in the first period of 2018.
- (2026)
- Discrete Mathematics
- Identifying Codes in Triangle‐Free Graphs of Bounded Maximum Degree (2026)
- Journal of Graph Theory
- (2026)
- Discrete Applied Mathematics
- The generalized double pouring problem: Analysis, bounds and algorithms (2026)
- Discrete Applied MathematicsTheoretical Computer Science
- Levenshtein's sequence reconstruction problem and results for larger alphabet sizes (2025)
- On Levenshtein’s Reconstruction Problem for Channels with Unique Insertion Error Patterns (2025)
- Proceedings: Information Theory Workshop
- On the Intersections of q-ary Hamming Balls (2025)
- Proceedings: Information Theory Workshop
- On Unique Error Patterns in the Levenshtein’s Sequence Reconstruction Model (2025)
- IEEE Transactions on Information Theory
- Reconstructing Graphs from Subgraph Compositions (2025)
- IEEE International Symposium on Information Theory
- (2024)
- Fundamenta Informaticae
- (2024)
- AlgorithmicaDiscrete Applied Mathematics
- Super domination: Graph classes, products and enumeration (2024)
- The Levenshtein’s Sequence Reconstruction Problem and the Length of the List (2024)
- IEEE Transactions on Information Theory
- (2023)
- The Electronic Journal of CombinatoricsProcedia Computer Science
- Identifying codes in bipartite graphs of given maximum degree (2023)
- Levenshtein’s Reconstruction Problem with Different Error Patterns (2023)
- IEEE International Symposium on Information Theory
- Locating-dominating sets: From graphs to oriented graphs (2023)
- Discrete MathematicsInformation Processing Letters
- Neighbourhood complexity of graphs of bounded twin-width (2023)
- European Journal of Combinatorics
- On radio k-labeling of the power of the infinite path (2023)
- The RED-BLUE SEPARATION problem on graphs (2023)
- Theoretical Computer Science



