Improved codes for list decoding in the Levenshtein's channel and information retrieval. - Tero Laihonen; Tuomo Lehtila (ISIT, 2017)

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

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)

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)

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

Revisiting and Improving Upper Bounds for Identifying Codes. - Florent Foucaud; Tuomo Lehtilä (SIAM J. Discret. Math., 2022)

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

Identifying codes in bipartite graphs of given maximum degree. - Dipayan Chakraborty; Florent Foucaud; Tuomo Lehtilä (LAGOS, 2023)

Bounds and Extremal Graphs for Total Dominating Identifying Codes. - Florent Foucaud; Tuomo Lehtilä (Electron. J. Comb., 2023)

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

Locating-dominating sets: From graphs to oriented graphs. - Nicolas Bousquet 001; Quentin Deschamps; Tuomo Lehtilä; Aline Parreau (Discret. Math., 2023)

On radio k-labeling of the power of the infinite path. - Tapas Das; Tuomo Lehtilä; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (Inf. Process. Lett., 2023)

The RED-BLUE SEPARATION problem on graphs. - Subhadeep Ranjan Dev; Sanjana Dey; Florent Foucaud; Ralf Klasing; Tuomo Lehtilä (Theor. Comput. Sci., 2023)

Resolving Sets in Temporal Graphs. - Jan Bok; Antoine Dailly; Tuomo Lehtilä (IWOCA, 2024)

Super domination: Graph classes, products and enumeration. - Nima Ghanbari; Gerold Jäger; Tuomo Lehtilä (Discret. Appl. Math., 2024)

Optimal Local Identifying and Local Locating-dominating Codes. - Pyry Herva; Tero Laihonen; Tuomo Lehtilä (Fundam. Informaticae, 2024)

Neighbourhood complexity of graphs of bounded twin-width. - Édouard Bonnet; Florent Foucaud; Tuomo Lehtilä; Aline Parreau (Eur. J. Comb., 2024)

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

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

Partition Strategies for the Maker-Breaker Domination Game. - Guillaume Bagan; Éric Duchêne; Valentin Gledel; Tuomo Lehtilä; Aline Parreau (Algorithmica, 2025)

Reconstructing graphs with subgraph compositions. - Antoine Dailly; Tuomo Lehtilä (CoRR, 2025)

The Generalized Double Pouring Problem: Analysis, Bounds and Algorithms. - Gerold Jäger; Tuomo Lehtilä (CoRR, 2025)

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