Tero Laihonen
terolai@utu.fi +358 29 450 4303 +358 46 923 7614 Vesilinnantie 5 Turku ORCID identifier: https://orcid.org/0000-0002-2688-2166 |
Areas of expertise
Coding theory and graph theory
Coding theory and graph theory
Research
Research interests: Information retrieval in advanced memory systems and error-correcting codes, metric dimension in graphs, locating-dominating set, identifying codes
Publications 
3 of 10
- Proceedings of the Sixth Russian-Finnish Symposium on Discrete Mathematics (2021) Proceedings of the Sixth Russian-Finnish Symposium on Discrete Mathematics Hakanen Anni, Halava Vesa, Herva Pyry, Kari Jarkko, Laihonen Tero, Petre Ion, Saarela Aleksi
(Other publication) - On the Metric Dimensions for Sets of Vertices (2020)
- Discussiones Mathematicae Graph Theory
(A1 Refereed original research article in a scientific journal) - The solid-metric dimension (2020)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Tolerant location detection in sensor networks (2020)
- Advances in Applied Mathematics
(A1 Refereed original research article in a scientific journal) - 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) - On Stronger Types of Locating-Dominating Codes (2019)
- Discrete Mathematics and Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - On t-revealing codes in binary Hamming spaces (2019)
- Information and Computation
(A1 Refereed original research article in a scientific journal) - Optimal bounds on codes for location in circulant graphs (2019)
- Cryptography and Communications
(A1 Refereed original research article in a scientific journal) - Solving Two Conjectures regarding Codes for Location in Circulant Graphs (2019)
- Discrete Mathematics and Theoretical Computer Science
(A1 Refereed original research article in a scientific journal)
UTU Research Portal