Tuomo Lehtilä

37 papers B 6C 3Journal 28
YearRankTypeTitle / Venue / Authors
2026 J jnl
Identifying codes in graphs of given maximum degree: Characterizing trees.
Discret. Math.
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning, Tuomo Lehtilä
2026 J jnl
The generalized double pouring problem: Analysis, bounds and algorithms.
Discret. Appl. Math.
Gerold Jäger, Tuomo Lehtilä
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 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 B conf
On the Intersections of q-ary Hamming Balls.
ITW
Ville Junnila, Tero Laihonen, Tuomo Lehtilä, Pavan Padavu Devaraj
2025 J jnl
Partition Strategies for the Maker-Breaker Domination Game.
Algorithmica
Guillaume Bagan, Éric Duchêne, Valentin Gledel, Tuomo Lehtilä, Aline Parreau
2025 B conf
Reconstructing Graphs from Subgraph Compositions.
ISIT
Antoine Dailly, Tuomo Lehtilä
2025 J jnl
Reconstructing graphs with subgraph compositions.
CoRR
Antoine Dailly, Tuomo Lehtilä
2025 J jnl
The Generalized Double Pouring Problem: Analysis, Bounds and Algorithms.
CoRR
Gerold Jäger, Tuomo Lehtilä
2024 J jnl
Neighbourhood complexity of graphs of bounded twin-width.
Eur. J. Comb.
Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau
2024 J jnl
On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model.
CoRR
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2024 J jnl
Optimal Local Identifying and Local Locating-dominating Codes.
Fundam. Informaticae
Pyry Herva, Tero Laihonen, Tuomo Lehtilä
2024 J jnl
Partition strategies for the Maker-Breaker domination game.
CoRR
Guillaume Bagan, Éric Duchêne, Valentin Gledel, Tuomo Lehtilä, Aline Parreau
2024 C conf
Resolving Sets in Temporal Graphs.
IWOCA
Jan Bok, Antoine Dailly, Tuomo Lehtilä
2024 J jnl
Resolving Sets in Temporal Graphs.
CoRR
Jan Bok, Antoine Dailly, Tuomo Lehtilä
2024 J jnl
Super domination: Graph classes, products and enumeration.
Discret. Appl. Math.
Nima Ghanbari, Gerold Jäger, Tuomo Lehtilä
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 J jnl
Bounds and Extremal Graphs for Total Dominating Identifying Codes.
Electron. J. Comb.
Florent Foucaud, Tuomo Lehtilä
2023 C conf
Identifying codes in bipartite graphs of given maximum degree.
LAGOS
Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä
2023 B conf
Levenshtein's Reconstruction Problem with Different Error Patterns.
ISIT
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2023 J jnl
Locating-dominating sets: From graphs to oriented graphs.
Discret. Math.
Nicolas Bousquet, Quentin Deschamps, Tuomo Lehtilä, Aline Parreau
2023 J jnl
Neighbourhood complexity of graphs of bounded twin-width.
CoRR
Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau
2023 J jnl
New Optimal Results on Codes for Location in Graphs.
CoRR
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2023 J jnl
On radio
Inf. Process. Lett.
Tapas Das, Tuomo Lehtilä, Soumen Nandi, Sagnik Sen, D. K. Supraja
2023 J jnl
Optimal local identifying and local locating-dominating codes.
CoRR
Pyry Herva, Tero Laihonen, Tuomo Lehtilä
2023 J jnl
The RED-BLUE SEPARATION problem on graphs.
Theor. Comput. Sci.
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, 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
Revisiting and Improving Upper Bounds for Identifying Codes.
SIAM J. Discret. Math.
Florent Foucaud, Tuomo Lehtilä
2022 J jnl
The Levenshtein's Sequence Reconstruction Problem and the Length of the List.
CoRR
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2022 J jnl
The RED-BLUE SEPARATION problem on graphs.
CoRR
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
2022 C conf
The Red-Blue Separation Problem on Graphs.
IWOCA
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, 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ä
2019 J jnl
On a Conjecture Regarding Identification in Hamming Graphs.
Electron. J. Comb.
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
2019 B conf
The Levenshtein's Channel and the List Size in Information Retrieval.
ISIT
Ville Junnila, Tero Laihonen, Tuomo Lehtilä