default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTuomo Lehtilä
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j14]Nima Ghanbari
, Gerold Jäger, Tuomo Lehtilä:
Super domination: Graph classes, products and enumeration. Discret. Appl. Math. 349: 8-24 (2024)- [j13]Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau:
Neighbourhood complexity of graphs of bounded twin-width. Eur. J. Comb. 115: 103772 (2024) - [j12]Pyry Herva, Tero Laihonen, Tuomo Lehtilä:
Optimal Local Identifying and Local Locating-dominating Codes. Fundam. Informaticae 191(3-4): 351-378 (2024) - [j11]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. IEEE Trans. Inf. Theory 70(2): 1050-1066 (2024) - 2023
- [j10]Florent Foucaud, Tuomo Lehtilä:
Bounds and Extremal Graphs for Total Dominating Identifying Codes. Electron. J. Comb. 30(3) (2023) - [j9]Nicolas Bousquet, Quentin Deschamps, Tuomo Lehtilä, Aline Parreau:
Locating-dominating sets: From graphs to oriented graphs. Discret. Math. 346(1): 113124 (2023) - [j8]Tapas Das, Tuomo Lehtilä, Soumen Nandi, Sagnik Sen, D. K. Supraja:
On radio k-labeling of the power of the infinite path. Inf. Process. Lett. 182: 106386 (2023) - [j7]Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä:
The RED-BLUE SEPARATION problem on graphs. Theor. Comput. Sci. 970: 114061 (2023) - 2022
- [j6]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
Improved lower bound for locating-dominating codes in binary Hamming spaces. Des. Codes Cryptogr. 90(1): 67-85 (2022) - [j5]Florent Foucaud, Tuomo Lehtilä:
Revisiting and Improving Upper Bounds for Identifying Codes. SIAM J. Discret. Math. 36(4): 2619-2634 (2022) - 2021
- [j4]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
On Levenshtein's Channel and List Size in Information Retrieval. IEEE Trans. Inf. Theory 67(6): 3322-3341 (2021) - 2019
- [j3]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
On a Conjecture Regarding Identification in Hamming Graphs. Electron. J. Comb. 26(2): 2 (2019) - [j2]Ville Junnila, Tero Laihonen, Tuomo Lehtila, María Luz Puertas:
On Stronger Types of Locating-dominating Codes. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - 2018
- [j1]Ville Junnila, Tero Laihonen, Tuomo Lehtila:
On regular and new types of codes for location-domination. Discret. Appl. Math. 247: 225-241 (2018)
Conference and Workshop Papers
- 2024
- [c7]Jan Bok, Antoine Dailly, Tuomo Lehtilä:
Resolving Sets in Temporal Graphs. IWOCA 2024: 287-300 - 2023
- [c6]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
Levenshtein's Reconstruction Problem with Different Error Patterns. ISIT 2023: 1300-1305 - [c5]Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä:
Identifying codes in bipartite graphs of given maximum degree. LAGOS 2023: 157-165 - 2022
- [c4]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
On the List Size in the Levenshtein's Sequence Reconstruction Problem. ISIT 2022: 510-515 - [c3]Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä:
The Red-Blue Separation Problem on Graphs. IWOCA 2022: 285-298 - 2019
- [c2]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
The Levenshtein's Channel and the List Size in Information Retrieval. ISIT 2019: 295-299 - 2017
- [c1]Tero Laihonen, Tuomo Lehtila:
Improved codes for list decoding in the Levenshtein's channel and information retrieval. ISIT 2017: 2643-2647
Informal and Other Publications
- 2024
- [i8]Jan Bok, Antoine Dailly, Tuomo Lehtilä:
Resolving Sets in Temporal Graphs. CoRR abs/2403.13183 (2024) - [i7]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model. CoRR abs/2406.14125 (2024) - [i6]Guillaume Bagan, Éric Duchêne, Valentin Gledel, Tuomo Lehtilä, Aline Parreau:
Partition strategies for the Maker-Breaker domination game. CoRR abs/2406.15165 (2024) - 2023
- [i5]Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau:
Neighbourhood complexity of graphs of bounded twin-width. CoRR abs/2301.04217 (2023) - [i4]Pyry Herva, Tero Laihonen, Tuomo Lehtilä:
Optimal local identifying and local locating-dominating codes. CoRR abs/2302.13351 (2023) - [i3]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
New Optimal Results on Codes for Location in Graphs. CoRR abs/2306.07862 (2023) - 2022
- [i2]Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä:
The RED-BLUE SEPARATION problem on graphs. CoRR abs/2211.08283 (2022) - [i1]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. CoRR abs/2211.08812 (2022)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
