Improved bounds on binary identifying codes. - Geoffrey Exoo; Ville Junnila; Tero Laihonen; Sanna M. Ranto (ISIT, 2008)

Upper bounds for binary identifying codes. - Geoffrey Exoo; Ville Junnila; Tero Laihonen; Sanna M. Ranto (Adv. Appl. Math., 2009)

Improved bounds on identifying codes in binary Hamming spaces. - Geoffrey Exoo; Ville Junnila; Tero Laihonen; Sanna M. Ranto (Eur. J. Comb., 2010)

Locating-dominating codes in cycles. - Geoffrey Exoo; Ville Junnila; Tero Laihonen (Australas. J Comb., 2011)

Identification in Z2 using Euclidean balls. - Ville Junnila; Tero Laihonen (Discret. Appl. Math., 2011)

Locating-dominating codes in paths. - Geoffrey Exoo; Ville Junnila; Tero Laihonen (Discret. Math., 2011)

New lower bounds for identifying codes in infinite grids. - Ville Junnila; Tero Laihonen (ISIT, 2012)

Codes for locating objects in sensor networks. - Ville Junnila; Tero Laihonen; Aline Parreau (ISIT, 2012)

Optimal Lower Bound for 2-Identifying Codes in the Hexagonal Grid. - Ville Junnila; Tero Laihonen (Electron. J. Comb., 2012)

Optimal lower bound for 2-identifying code in the hexagonal grid - Ville Junnila; Tero Laihonen (CoRR, 2012)

Adaptive Identification of Sets of Vertices in Graphs. - Ville Junnila (Discret. Math. Theor. Comput. Sci., 2012)

Optimal Identifying Codes in Cycles and Paths. - Ville Junnila; Tero Laihonen (Graphs Comb., 2012)

New lower bound for 2-identifying code in the square grid. - Ville Junnila (Discret. Appl. Math., 2013)

Optimal identification of sets of edges using 2-factors. - Ville Junnila; Tero Laihonen (Discret. Math., 2013)

Tolerant identification with Euclidean balls. - Ville Junnila; Tero Laihonen; Aline Parreau (Networks, 2013)

Codes for Information Retrieval With Small Uncertainty. - Ville Junnila; Tero Laihonen (IEEE Trans. Inf. Theory, 2014)

Optimal locating-total dominating sets in strips of height 3. - Ville Junnila (Discuss. Math. Graph Theory, 2015)

Information retrieval with unambiguous output. - Ville Junnila; Tero Laihonen (Inf. Comput., 2015)

Minimum Number of Input Clues in Robust Information Retrieval. - Ville Junnila; Tero Laihonen (Fundam. Informaticae, 2016)

Information Retrieval With Varying Number of Input Clues. - Ville Junnila; Tero Laihonen (IEEE Trans. Inf. Theory, 2016)

On regular and new types of codes for location-domination. - Ville Junnila; Tero Laihonen; Tuomo Lehtila (Discret. Appl. Math., 2018)

Optimal bounds on codes for location in circulant graphs. - Ville Junnila; Tero Laihonen; Gabrielle Paris (Cryptogr. Commun., 2019)

On a Conjecture Regarding Identification in Hamming Graphs. - Ville Junnila; Tero Laihonen; Tuomo Lehtilä (Electron. J. Comb., 2019)

On Stronger Types of Locating-dominating Codes. - Ville Junnila; Tero Laihonen; Tuomo Lehtila; María Luz Puertas (Discret. Math. Theor. Comput. Sci., 2019)

Solving Two Conjectures regarding Codes for Location in Circulant Graphs. - Ville Junnila; Tero Laihonen; Gabrielle Paris (Discret. Math. Theor. Comput. Sci., 2019)

Tolerant location detection in sensor networks. - Ville Junnila; Tero Laihonen (Adv. Appl. Math., 2020)

Private membership test protocol with low communication complexity. - Sara Ramezanian; Tommi Meskanen; Masoud Naderpour; Ville Junnila; Valtteri Niemi (Digit. Commun. Networks, 2020)

The solid-metric dimension. - Anni Hakanen; Ville Junnila; Tero Laihonen (Theor. Comput. Sci., 2020)

On Levenshtein's Channel and List Size in Information Retrieval. - Ville Junnila; Tero Laihonen; Tuomo Lehtilä (IEEE Trans. Inf. Theory, 2021)

On the List Size in the Levenshtein's Sequence Reconstruction Problem. - Ville Junnila; Tero Laihonen; Tuomo Lehtilä (ISIT, 2022)

On vertices contained in all or in no metric basis. - Anni Hakanen; Ville Junnila; Tero Laihonen; Ismael G. Yero (Discret. Appl. Math., 2022)

Improved lower bound for locating-dominating codes in binary Hamming spaces. - Ville Junnila; Tero Laihonen; Tuomo Lehtilä (Des. Codes Cryptogr., 2022)

Levenshtein's Reconstruction Problem with Different Error Patterns. - Ville Junnila; Tero Laihonen; Tuomo Lehtilä (ISIT, 2023)

New Optimal Results on Codes for Location in Graphs. - Ville Junnila; Tero Laihonen; Tuomo Lehtilä (CoRR, 2023)

On the metric dimensions for sets of vertices. - Anni Hakanen; Ville Junnila; Tero Laihonen; María Luz Puertas (Discuss. Math. Graph Theory, 2023)

On the unicyclic graphs having vertices that belong to all their (strong) metric bases. - Anni Hakanen; Ville Junnila; Tero Laihonen; Ismael G. Yero (Discret. Appl. Math., 2024)

On Iiro Honkala's Contributions to Identifying Codes. - Olivier Hudry; Ville Junnila; Antoine Lobstein (Fundam. Informaticae, 2024)

The Levenshtein's Sequence Reconstruction Problem and the Length of the List. - Ville Junnila; Tero Laihonen; Tuomo Lehtilä (IEEE Trans. Inf. Theory, 2024)

On a Tight Bound for the Maximum Number of Vertices that Belong to Every Metric Basis. - Anni Hakanen; Ville Junnila; Tero Laihonen; Havu Miikonen; Ismael G. Yero (CALDAM, 2025)

Levenshtein's sequence reconstruction problem and results for larger alphabet sizes. - Ville Junnila; Tero Laihonen; Tuomo Lehtilä (Theor. Comput. Sci., 2025)

On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model. - Ville Junnila; Tero Laihonen; Tuomo Lehtilä (IEEE Trans. Inf. Theory, 2025)