Ville Junnila

53 papers B 8Journal 44Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the vertices belonging to all edge metric bases.
Discret. Appl. Math.
Anni Hakanen, Ville Junnila, Tero Laihonen, Ismael G. Yero
2025 J jnl
Levenshtein's Sequence Reconstruction Problem and Results for Larger Alphabet Sizes.
CoRR
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2025 J jnl
Levenshtein's sequence reconstruction problem and results for larger alphabet sizes.
Theor. Comput. Sci.
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2025 J jnl
New Results on Vertices that Belong to Every Minimum Locating-Dominating Code.
CoRR
Ville Junnila, Tero Laihonen, Havu Miikonen
2025 B conf
On Levenshtein's Reconstruction Problem for Channels with Unique Insertion Error Patterns.
ITW
Ville Junnila, Tero Laihonen, Tuomo Lehtilä, Pavan Padavu Devaraj
2025 J jnl
On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model.
IEEE Trans. Inf. Theory
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2025 — conf
On a Tight Bound for the Maximum Number of Vertices that Belong to Every Metric Basis.
CALDAM
Anni Hakanen, Ville Junnila, Tero Laihonen, Havu Miikonen, Ismael G. Yero
2025 B conf
On the Intersections of q-ary Hamming Balls.
ITW
Ville Junnila, Tero Laihonen, Tuomo Lehtilä, Pavan Padavu Devaraj
2024 J jnl
Iiro Honkala's contributions to identifying codes.
CoRR
Olivier Hudry, Ville Junnila, Antoine Lobstein
2024 J jnl
On Iiro Honkala's Contributions to Identifying Codes.
Fundam. Informaticae
Olivier Hudry, Ville Junnila, Antoine Lobstein
2024 J jnl
On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model.
CoRR
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2024 J jnl
On the unicyclic graphs having vertices that belong to all their (strong) metric bases.
Discret. Appl. Math.
Anni Hakanen, Ville Junnila, Tero Laihonen, Ismael G. Yero
2024 J jnl
The Levenshtein's Sequence Reconstruction Problem and the Length of the List.
IEEE Trans. Inf. Theory
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2023 B conf
Levenshtein's Reconstruction Problem with Different Error Patterns.
ISIT
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2023 J jnl
New Optimal Results on Codes for Location in Graphs.
CoRR
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2023 J jnl
On the metric dimensions for sets of vertices.
Discuss. Math. Graph Theory
Anni Hakanen, Ville Junnila, Tero Laihonen, María Luz Puertas
2022 J jnl
Improved lower bound for locating-dominating codes in binary Hamming spaces.
Des. Codes Cryptogr.
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2022 B conf
On the List Size in the Levenshtein's Sequence Reconstruction Problem.
ISIT
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2022 J jnl
On vertices contained in all or in no metric basis.
Discret. Appl. Math.
Anni Hakanen, Ville Junnila, Tero Laihonen, Ismael G. Yero
2022 J jnl
The Levenshtein's Sequence Reconstruction Problem and the Length of the List.
CoRR
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2021 J jnl
On Levenshtein's Channel and List Size in Information Retrieval.
IEEE Trans. Inf. Theory
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2020 J jnl
Private membership test protocol with low communication complexity.
Digit. Commun. Networks
Sara Ramezanian, Tommi Meskanen, Masoud Naderpour, Ville Junnila, Valtteri Niemi
2020 J jnl
The solid-metric dimension.
Theor. Comput. Sci.
Anni Hakanen, Ville Junnila, Tero Laihonen
2020 J jnl
Tolerant location detection in sensor networks.
Adv. Appl. Math.
Ville Junnila, Tero Laihonen
2019 J jnl
On Stronger Types of Locating-dominating Codes.
Discret. Math. Theor. Comput. Sci.
Ville Junnila, Tero Laihonen, Tuomo Lehtila, María Luz Puertas
2019 J jnl
On a Conjecture Regarding Identification in Hamming Graphs.
Electron. J. Comb.
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2019 J jnl
Optimal bounds on codes for location in circulant graphs.
Cryptogr. Commun.
Ville Junnila, Tero Laihonen, Gabrielle Paris
2019 J jnl
Solving Two Conjectures regarding Codes for Location in Circulant Graphs.
Discret. Math. Theor. Comput. Sci.
Ville Junnila, Tero Laihonen, Gabrielle Paris
2019 B conf
The Levenshtein's Channel and the List Size in Information Retrieval.
ISIT
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2018 J jnl
On regular and new types of codes for location-domination.
Discret. Appl. Math.
Ville Junnila, Tero Laihonen, Tuomo Lehtila
2018 J jnl
Optimal bounds on codes for location in circulant graphs.
CoRR
Ville Junnila, Tero Laihonen, Gabrielle Paris
2016 J jnl
Information Retrieval With Varying Number of Input Clues.
IEEE Trans. Inf. Theory
Ville Junnila, Tero Laihonen
2016 J jnl
Minimum Number of Input Clues in Robust Information Retrieval.
Fundam. Informaticae
Ville Junnila, Tero Laihonen
2015 J jnl
Information retrieval with unambiguous output.
Inf. Comput.
Ville Junnila, Tero Laihonen
2015 J jnl
Optimal locating-total dominating sets in strips of height 3.
Discuss. Math. Graph Theory
Ville Junnila
2014 J jnl
Codes for Information Retrieval With Small Uncertainty.
IEEE Trans. Inf. Theory
Ville Junnila, Tero Laihonen
2013 J jnl
New lower bound for 2-identifying code in the square grid.
Discret. Appl. Math.
Ville Junnila
2013 J jnl
Optimal identification of sets of edges using 2-factors.
Discret. Math.
Ville Junnila, Tero Laihonen
2013 J jnl
Tolerant identification with Euclidean balls.
Networks
Ville Junnila, Tero Laihonen, Aline Parreau
2012 J jnl
Adaptive Identification of Sets of Vertices in Graphs.
Discret. Math. Theor. Comput. Sci.
Ville Junnila
2012 B conf
Codes for locating objects in sensor networks.
ISIT
Ville Junnila, Tero Laihonen, Aline Parreau
2012 J jnl
New lower bound for 2-identifying code in the square grid
CoRR
Ville Junnila
2012 B conf
New lower bounds for identifying codes in infinite grids.
ISIT
Ville Junnila, Tero Laihonen
2012 J jnl
Optimal Identifying Codes in Cycles and Paths.
Graphs Comb.
Ville Junnila, Tero Laihonen
2012 J jnl
Optimal Lower Bound for 2-Identifying Codes in the Hexagonal Grid.
Electron. J. Comb.
Ville Junnila, Tero Laihonen
2012 J jnl
Optimal lower bound for 2-identifying code in the hexagonal grid
CoRR
Ville Junnila, Tero Laihonen
2011 J jnl
Identification in Z2 using Euclidean balls.
Discret. Appl. Math.
Ville Junnila, Tero Laihonen
2011 J jnl
Locating-dominating codes in cycles.
Australas. J Comb.
Geoffrey Exoo, Ville Junnila, Tero Laihonen
2011 J jnl
Locating-dominating codes in paths.
Discret. Math.
Geoffrey Exoo, Ville Junnila, Tero Laihonen
2011 J jnl
Tolerant identification with Euclidean balls
CoRR
Ville Junnila, Tero Laihonen, Aline Parreau
2010 J jnl
Improved bounds on identifying codes in binary Hamming spaces.
Eur. J. Comb.
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto
2009 J jnl
Upper bounds for binary identifying codes.
Adv. Appl. Math.
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto
2008 B conf
Improved bounds on binary identifying codes.
ISIT
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto