I agree that this site is using cookies. You can find further informations here.
X
Lehtilä, Tuomo
78  results:
Search for persons X
?
1

The Levenshtein's Sequence Reconstruction Problem and the L..:

Junnila, Ville ; Laihonen, Tero ; Lehtilä, Tuomo
IEEE Transactions on Information Theory.  70 (2024)  2 - p. 1050-1066 , 2024
Link: https://doi.org/10.1109/..
 
?
2

Resolving Sets in Temporal Graphs:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Bok, Jan ; Dailly, Antoine ; Lehtilä, Tuomo - p. 287-300 , 2024
Link: https://doi.org/10.1007/..
 
?
3

Neighbourhood complexity of graphs of bounded twin-width:

Bonnet, Édouard ; Foucaud, Florent ; Lehtilä, Tuomo.
European Journal of Combinatorics.  115 (2024)  - p. 103772 , 2024
Link: https://doi.org/10.1016/..
 
?
4

Super domination: Graph classes, products and enumeration:

Ghanbari, Nima ; Jäger, Gerold ; Lehtilä, Tuomo
Discrete Applied Mathematics.  349 (2024)  - p. 8-24 , 2024
Link: https://doi.org/10.1016/..
 
?
5

The RED-BLUE SEPARATION problem on graphs:

Dev, Subhadeep Ranjan ; Dey, Sanjana ; Foucaud, Florent..
Theoretical Computer Science.  970 (2023)  - p. 114061 , 2023
Link: https://doi.org/10.1016/..
 
?
6

Locating-dominating sets: From graphs to oriented graphs:

Bousquet, Nicolas ; Deschamps, Quentin ; Lehtilä, Tuomo.
Discrete Mathematics.  346 (2023)  1 - p. 113124 , 2023
Link: https://doi.org/10.1016/..
 
?
7

On radio k-labeling of the power of the infinite path:

Das, Tapas ; Lehtilä, Tuomo ; Nandi, Soumen..
Information Processing Letters.  182 (2023)  - p. 106386 , 2023
Link: https://doi.org/10.1016/..
 
?
8

Levenshtein's Reconstruction Problem with Different Error P..:

, In: 2023 IEEE International Symposium on Information Theory (ISIT),
Junnila, Ville ; Laihonen, Tero ; Lehtila, Tuomo - p. 1300-1305 , 2023
Link: https://doi.org/10.1109/..
 
?
9

Identifying codes in bipartite graphs of given maximum degr..:

Chakraborty, Dipayan ; Foucaud, Florent ; Lehtilä, Tuomo
Procedia Computer Science.  223 (2023)  - p. 157-165 , 2023
Link: https://doi.org/10.1016/..
 
?
10

Revisiting and Improving Upper Bounds for Identifying Codes:

Foucaud, Florent ; Lehtilä, Tuomo
SIAM Journal on Discrete Mathematics.  36 (2022)  4 - p. 2619-2634 , 2022
Link: https://doi.org/10.1137/..
 
?
11

The Red-Blue Separation Problem on Graphs:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Dev, Subhadeep Ranjan ; Dey, Sanjana ; Foucaud, Florent.. - p. 285-298 , 2022
Link: https://doi.org/10.1007/..
 
?
12

On the List Size in the Levenshtein's Sequence Reconstructi..:

, In: 2022 IEEE International Symposium on Information Theory (ISIT),
Junnila, Ville ; Laihonen, Tero ; Lehtila, Tuomo - p. 510-515 , 2022
Link: https://doi.org/10.1109/..
 
?
13

Improved lower bound for locating-dominating codes in binar..:

Junnila, Ville ; Laihonen, Tero ; Lehtilä, Tuomo
Designs, Codes and Cryptography.  90 (2021)  1 - p. 67-85 , 2021
Link: https://doi.org/10.1007/..
 
?
14

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

Junnila, Ville ; Laihonen, Tero ; Lehtilä, Tuomo
Discrete Applied Mathematics.  247 (2018)  - p. 225-241 , 2018
Link: https://doi.org/10.1016/..
 
?
15

Neighbourhood complexity of graphs of bounded twin-width:

Bonnet, Édouard ; Foucaud, Florent ; Lehtilä, Tuomo.
info:eu-repo/semantics/altIdentifier/arxiv/2301.04217.  , 2024
Link: https://hal.science/hal-..
 
1-15