Tuomo Lehtilä

Orcid: 0000-0003-2940-8088

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Levenshtein's Sequence Reconstruction Problem and the Length of the List.
IEEE Trans. Inf. Theory, February, 2024

Neighbourhood complexity of graphs of bounded twin-width.
Eur. J. Comb., January, 2024

Resolving Sets in Temporal Graphs.
CoRR, 2024

2023
The RED-BLUE SEPARATION problem on graphs.
Theor. Comput. Sci., August, 2023

On radio <i>k</i>-labeling of the power of the infinite path.
Inf. Process. Lett., August, 2023

Locating-dominating sets: From graphs to oriented graphs.
Discret. Math., 2023

New Optimal Results on Codes for Location in Graphs.
CoRR, 2023

Optimal local identifying and local locating-dominating codes.
CoRR, 2023

Bounds and Extremal Graphs for Total Dominating Identifying Codes.
Electron. J. Comb., 2023

Identifying codes in bipartite graphs of given maximum degree.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Levenshtein's Reconstruction Problem with Different Error Patterns.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Revisiting and Improving Upper Bounds for Identifying Codes.
SIAM J. Discret. Math., December, 2022

Improved lower bound for locating-dominating codes in binary Hamming spaces.
Des. Codes Cryptogr., 2022

On the List Size in the Levenshtein's Sequence Reconstruction Problem.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
On Levenshtein's Channel and List Size in Information Retrieval.
IEEE Trans. Inf. Theory, 2021

2019
On Stronger Types of Locating-dominating Codes.
Discret. Math. Theor. Comput. Sci., 2019

On a Conjecture Regarding Identification in Hamming Graphs.
Electron. J. Comb., 2019

2018
On regular and new types of codes for location-domination.
Discret. Appl. Math., 2018

2017
Improved codes for list decoding in the Levenshtein's channel and information retrieval.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017


  Loading...