Ville Junnila
viljun@utu.fi +358 29 450 4316 +358 50 432 6427 Vesilinnantie 5 Turku |
- On a Tight Bound for the Maximum Number of Vertices that Belong to Every Metric Basis (2025)
- Lecture Notes in Computer Science
- On Unique Error Patterns in the Levenshtein’s Sequence Reconstruction Model (2025)
- IEEE Transactions on Information Theory
- On Iiro Honkala's Contributions to Identifying Codes (2024)
- Fundamenta Informaticae
- On the unicyclic graphs having vertices that belong to all their (strong) metric bases (2024)
- Discrete Applied Mathematics
- The Levenshtein’s Sequence Reconstruction Problem and the Length of the List (2024)
- IEEE Transactions on Information Theory
- Levenshtein’s Reconstruction Problem with Different Error Patterns (2023)
- IEEE International Symposium on Information Theory
- Improved lower bound for locating-dominating codes in binary Hamming spaces (2022)
- Designs, Codes and Cryptography
- On the List Size in the Levenshtein’s Sequence Reconstruction Problem (2022)
- IEEE International Symposium on Information Theory
- On Vertices Contained in All or in No Metric Basis (2022)
- Discrete Applied Mathematics
- On Levenshtein’s Channel and List Size in Information Retrieval (2021)
- IEEE Transactions on Information Theory
- On Vertices that are in Every Metric Basis of a Unicyclic Graph (2021) Proceedings of the Sixth Russian-Finnish Symposium on Discrete Mathematics Hakanen Anni, Junnila Ville, Laihonen Tero, Yero Ismael G.
- On the Metric Dimensions for Sets of Vertices (2020)
- Discussiones Mathematicae Graph Theory
- Private membership test protocol with low communication complexity (2020)
- Digital Communications and Networks
- The solid-metric dimension (2020)
- Theoretical Computer Science
- Tolerant location detection in sensor networks (2020)
- Advances in Applied Mathematics
- 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
- On Stronger Types of Locating-Dominating Codes (2019)
- Discrete Mathematics and Theoretical Computer Science
- Optimal bounds on codes for location in circulant graphs (2019)
- Cryptography and Communications
- Solving Two Conjectures regarding Codes for Location in Circulant Graphs (2019)
- Discrete Mathematics and Theoretical Computer Science