Tero Laihonen
terolai@utu.fi +358 29 450 4303 +358 46 923 7614 Vesilinnantie 5 Turku |
Coding theory and graph theory
Research interests: Information retrieval in advanced memory systems and error-correcting codes, metric dimension in graphs, locating-dominating set, identifying codes
1 of 10
- A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set (2026)
- The Electronic Journal of Combinatorics
- New Results on Vertices that Belong to Every Minimum Locating-Dominating Code (2026)
- Discrete Mathematics and Theoretical Computer Science
- On the vertices belonging to all edge metric bases (2026)
- Discrete Applied Mathematics
- Levenshtein's sequence reconstruction problem and results for larger alphabet sizes (2025)
- Theoretical Computer Science
- On a Tight Bound for the Maximum Number of Vertices that Belong to Every Metric Basis (2025)
- Lecture Notes in Computer Science
- 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
- Codes, Graphs, Coverings, and Identification: Special Issue Honoring the 60-th Birthday of Professor Iiro Honkala (2024)
- Fundamenta Informaticae
- Codes, Graphs, Coverings, and Identification: Special Issue Honoring the 60-th Birthday of Professor Iiro Honkala (Preface) (2024)
- Fundamenta Informaticae
UTU Research Portal