Tuomo Lehtilä

According to our database, Tuomo Lehtilä authored at least 22 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

The Levenshtein's Sequence Reconstruction Problem and the Length of the List.

Ville Junnila, Tero Laihonen, Tuomo Lehtilä

IEEE Trans. Inf. Theory, February, 2024

Neighbourhood complexity of graphs of bounded twin-width.

Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau

Eur. J. Comb., January, 2024

Optimal Local Identifying and Local Locating-dominating Codes.

Pyry Herva, Tero Laihonen, Tuomo Lehtilä

Fundam. Informaticae, 2024

Super domination: Graph classes, products and enumeration.

Nima Ghanbari, Gerold Jäger, Tuomo Lehtilä

Discret. Appl. Math., 2024

Partition strategies for the Maker-Breaker domination game.

Guillaume Bagan, Éric Duchêne, Valentin Gledel, Tuomo Lehtilä, Aline Parreau

CoRR, 2024

On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model.

Ville Junnila, Tero Laihonen, Tuomo Lehtilä

CoRR, 2024

Resolving Sets in Temporal Graphs.

Jan Bok, Antoine Dailly, Tuomo Lehtilä

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2023

The RED-BLUE SEPARATION problem on graphs.

Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä

Theor. Comput. Sci., August, 2023

On radio <i>k</i>-labeling of the power of the infinite path.

Tapas Das, Tuomo Lehtilä, Soumen Nandi, Sagnik Sen, D. K. Supraja

Inf. Process. Lett., August, 2023

Locating-dominating sets: From graphs to oriented graphs.

Nicolas Bousquet, Quentin Deschamps, Tuomo Lehtilä, Aline Parreau

Discret. Math., 2023

New Optimal Results on Codes for Location in Graphs.

Ville Junnila, Tero Laihonen, Tuomo Lehtilä

CoRR, 2023

Bounds and Extremal Graphs for Total Dominating Identifying Codes.

Florent Foucaud, Tuomo Lehtilä

Electron. J. Comb., 2023

Identifying codes in bipartite graphs of given maximum degree.

Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Levenshtein's Reconstruction Problem with Different Error Patterns.

Ville Junnila, Tero Laihonen, Tuomo Lehtilä

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Revisiting and Improving Upper Bounds for Identifying Codes.

Florent Foucaud, Tuomo Lehtilä

SIAM J. Discret. Math., December, 2022

Improved lower bound for locating-dominating codes in binary Hamming spaces.

Ville Junnila, Tero Laihonen, Tuomo Lehtilä

Des. Codes Cryptogr., 2022

On the List Size in the Levenshtein's Sequence Reconstruction Problem.

Ville Junnila, Tero Laihonen, Tuomo Lehtilä

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

On Levenshtein's Channel and List Size in Information Retrieval.

Ville Junnila, Tero Laihonen, Tuomo Lehtilä

IEEE Trans. Inf. Theory, 2021

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 a Conjecture Regarding Identification in Hamming Graphs.

Ville Junnila, Tero Laihonen, Tuomo Lehtilä

Electron. J. Comb., 2019

2018

On regular and new types of codes for location-domination.

Ville Junnila, Tero Laihonen, Tuomo Lehtila

Discret. Appl. Math., 2018

2017

Improved codes for list decoding in the Levenshtein's channel and information retrieval.

Tero Laihonen, Tuomo Lehtila

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017