Tuomo Lehtilä

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 26

Top Topics

Bipartite Graph

Temporal Events

Information Retrieval

Top Venues

IEEE Trans. Inf. Theory

Publications

Jan Bok, Antoine Dailly, Tuomo Lehtilä
Resolving Sets in Temporal Graphs. IWOCA (2024)
Jan Bok, Antoine Dailly, Tuomo Lehtilä
Resolving Sets in Temporal Graphs. CoRR (2024)
Pyry Herva, Tero Laihonen, Tuomo Lehtilä
Optimal Local Identifying and Local Locating-dominating Codes. Fundam. Informaticae 191 (3-4) (2024)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model. CoRR (2024)
Nima Ghanbari, Gerold Jäger, Tuomo Lehtilä
Super domination: Graph classes, products and enumeration. Discret. Appl. Math. 349 (2024)
Guillaume Bagan, Éric Duchêne, Valentin Gledel, Tuomo Lehtilä, Aline Parreau
Partition strategies for the Maker-Breaker domination game. CoRR (2024)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. IEEE Trans. Inf. Theory 70 (2) (2024)
Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau
Neighbourhood complexity of graphs of bounded twin-width. Eur. J. Comb. 115 (2024)
Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau
Neighbourhood complexity of graphs of bounded twin-width. CoRR (2023)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
Levenshtein's Reconstruction Problem with Different Error Patterns. ISIT (2023)
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The RED-BLUE SEPARATION problem on graphs. Theor. Comput. Sci. 970 (2023)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
New Optimal Results on Codes for Location in Graphs. CoRR (2023)
Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä
Identifying codes in bipartite graphs of given maximum degree. LAGOS (2023)
Nicolas Bousquet, Quentin Deschamps, Tuomo Lehtilä, Aline Parreau
Locating-dominating sets: From graphs to oriented graphs. Discret. Math. 346 (1) (2023)
Tapas Das, Tuomo Lehtilä, Soumen Nandi, Sagnik Sen, D. K. Supraja
-labeling of the power of the infinite path. Inf. Process. Lett. 182 (2023)
Florent Foucaud, Tuomo Lehtilä
Bounds and Extremal Graphs for Total Dominating Identifying Codes. Electron. J. Comb. 30 (3) (2023)
Pyry Herva, Tero Laihonen, Tuomo Lehtilä
Optimal local identifying and local locating-dominating codes. CoRR (2023)
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The Red-Blue Separation Problem on Graphs. IWOCA (2022)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
Improved lower bound for locating-dominating codes in binary Hamming spaces. Des. Codes Cryptogr. 90 (1) (2022)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
On the List Size in the Levenshtein's Sequence Reconstruction Problem. ISIT (2022)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. CoRR (2022)
Florent Foucaud, Tuomo Lehtilä
Revisiting and Improving Upper Bounds for Identifying Codes. SIAM J. Discret. Math. 36 (4) (2022)
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The RED-BLUE SEPARATION problem on graphs. CoRR (2022)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
On Levenshtein's Channel and List Size in Information Retrieval. IEEE Trans. Inf. Theory 67 (6) (2021)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
On a Conjecture Regarding Identification in Hamming Graphs. Electron. J. Comb. 26 (2) (2019)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
The Levenshtein's Channel and the List Size in Information Retrieval. ISIT (2019)