Tero Laihonen

96 papers B 11Journal 82Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Note on Partitioning the Vertex Set of a Graph into a Dominating Set and a Locating Dominating Set.
Electron. J. Comb.
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning, Tero Laihonen
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
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
Optimal Local Identifying and Local Locating-dominating Codes.
Fundam. Informaticae
Pyry Herva, Tero Laihonen, Tuomo Lehtilä
2024 J jnl
Preface.
Fundam. Informaticae
Vesa Halava, Jarkko Kari, Tero Laihonen
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
2023 J jnl
Optimal local identifying and local locating-dominating codes.
CoRR
Pyry Herva, Tero Laihonen, Tuomo Lehtilä
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
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
Inf. Comput.
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
On {ℓ}-Metric Dimensions in Graphs.
Fundam. Informaticae
Anni Hakanen, Tero Laihonen
2018 J jnl
Optimal bounds on codes for location in circulant graphs.
CoRR
Ville Junnila, Tero Laihonen, Gabrielle Paris
2017 B conf
Improved codes for list decoding in the Levenshtein's channel and information retrieval.
ISIT
Tero Laihonen, Tuomo Lehtila
2017 J jnl
Information retrieval and the average number of input clues.
Adv. Math. Commun.
Tero Laihonen
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
2016 J jnl
The metric dimension for resolving several objects.
Inf. Process. Lett.
Tero Laihonen
2015 J jnl
Information retrieval with unambiguous output.
Inf. Comput.
Ville Junnila, Tero Laihonen
2014 J jnl
An improved lower bound for (1, ≤ 2)-identifying codes in the king grid.
Adv. Math. Commun.
Florent Foucaud, Tero Laihonen, Aline Parreau
2014 J jnl
Codes for Information Retrieval With Small Uncertainty.
IEEE Trans. Inf. Theory
Ville Junnila, Tero Laihonen
2014 J jnl
Graphs where every k-subset of vertices is an identifying set.
Discret. Math. Theor. Comput. Sci.
Sylvain Gravier, Svante Janson, Tero Laihonen, Sanna Maarit Ranto
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 B conf
Codes for locating objects in sensor networks.
ISIT
Ville Junnila, Tero Laihonen, Aline Parreau
2012 J jnl
Locally identifying colourings for graphs with given maximum degree.
Discret. Math.
Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau
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
An improved lower bound for (1,<=2)-identifying codes in the king grid
CoRR
Florent Foucaud, Tero Laihonen, Aline Parreau
2011 J jnl
Identification in Z2 using Euclidean balls.
Discret. Appl. Math.
Ville Junnila, Tero Laihonen
2011 J jnl
Locally identifying colourings for graphs with given maximum degree
CoRR
Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau
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
2010 J jnl
On Vertex-Robust Identifying Codes of Level Three.
Ars Comb.
Iiro S. Honkala, Tero Laihonen
2009 B conf
An optimal result for codes identifying sets of words.
ISIT
Svante Janson, Tero Laihonen
2009 J jnl
On the size of identifying codes in binary hypercubes.
J. Comb. Theory A
Svante Janson, Tero Laihonen
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
2008 J jnl
New bounds on binary identifying codes.
Discret. Appl. Math.
Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto
2008 J jnl
On Identifying Codes in the King Grid that are Robust Against Edge Deletions.
Electron. J. Comb.
Iiro S. Honkala, Tero Laihonen
2008 J jnl
On cages admitting identifying codes.
Eur. J. Comb.
Tero Laihonen
2008 J jnl
On graphs admitting t-ID codes.
Australas. J Comb.
Tero Laihonen, Julien Moncel
2007 B conf
Improved Identifying Codes in F2
ISIT
Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto
2007 J jnl
Improved Upper Bounds on Binary Identifying Codes.
IEEE Trans. Inf. Theory
Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto
2007 J jnl
On a new class of identifying codes in graphs.
Inf. Process. Lett.
Iiro S. Honkala, Tero Laihonen
2007 J jnl
On identifying codes that are robust against edge changes.
Inf. Comput.
Iiro S. Honkala, Tero Laihonen
2006 J jnl
On locating-dominating sets in infinite grids.
Eur. J. Comb.
Iiro S. Honkala, Tero Laihonen
2006 J jnl
On robust identification in the square and king grids.
Discret. Appl. Math.
Tero Laihonen
2006 J jnl
Optimal
Graphs Comb.
Tero Laihonen
2005 J jnl
On Optimal Edge-Robust and Vertex-Robust (1, leq
SIAM J. Discret. Math.
Tero Laihonen
2004 J jnl
On Locating-Dominating Codes in Binary Hamming Spaces.
Discret. Math. Theor. Comput. Sci.
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
2004 J jnl
On identification in the triangular grid.
J. Comb. Theory B
Iiro S. Honkala, Tero Laihonen
2004 J jnl
On identifying codes in the hexagonal mesh.
Inf. Process. Lett.
Iiro S. Honkala, Tero Laihonen
2004 J jnl
On identifying codes in the triangular and square grids.
SIAM J. Comput.
Iiro S. Honkala, Tero Laihonen
2003 J jnl
Codes for Identification in the King Lattice.
Graphs Comb.
Iiro S. Honkala, Tero Laihonen
2003 J jnl
On the Identification of Sets of Points in the Square Lattice.
Discret. Comput. Geom.
Iiro S. Honkala, Tero Laihonen
2002 J jnl
Families of optimal codes for strong identification.
Discret. Appl. Math.
Tero Laihonen, Sanna M. Ranto
2002 J jnl
On strongly identifying codes.
Discret. Math.
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
2002 J jnl
Optimal Codes for Strong Identification.
Eur. J. Comb.
Tero Laihonen
2002 J jnl
Sequences of optimal identifying codes.
IEEE Trans. Inf. Theory
Tero Laihonen
2002 J jnl
Two families of optimal identifying codes in binary Hamming spaces.
IEEE Trans. Inf. Theory
Sanna M. Ranto, Iiro S. Honkala, Tero Laihonen
2001 — conf
Codes Identifying Sets of Vertices.
AAECC
Tero Laihonen, Sanna M. Ranto
2001 J jnl
Codes for Strong Identification.
Electron. Notes Discret. Math.
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
2001 J jnl
On Codes Identifying Sets of Vertices in Hamming Spaces.
Des. Codes Cryptogr.
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
1999 J jnl
New Bounds On Covering Radius as a Function of Dual Distance.
SIAM J. Discret. Math.
Tero Laihonen, Simon Litsyn
1999 — conf
On an algebraic method for bounding the covering radius.
Codes and Association Schemes
Tero Laihonen
1999 J jnl
On relations between covering radius and dual distance.
IEEE Trans. Inf. Theory
Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen, Simon Litsyn
1999 J jnl
The probability of undetected error can have several local maxima.
IEEE Trans. Inf. Theory
Iiro S. Honkala, Tero Laihonen
1998 J jnl
On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes.
Des. Codes Cryptogr.
Tero Laihonen, Simon Litsyn
1997 J jnl
Linear Multisecret-Sharing Schemes and Error-Correcting Codes.
J. Univers. Comput. Sci.
Cunsheng Ding, Tero Laihonen, Ari Renvall
1997 J jnl
On Covering Radius and Discrete Chebyshev Polynomials.
Appl. Algebra Eng. Commun. Comput.
Iiro S. Honkala, Tero Laihonen, Simon Litsyn