Tuomo Lehtilä

Available identifiers

zbMath Open lehtila.tuomoMaRDI QIDQ1671338

List of research outcomes

Publication	Date of Publication	Type
Optimal local identifying and local locating-dominating codes	2024-10-07	Paper
The Levenshtein's sequence reconstruction problem and the length of the list	2024-07-22	Paper
Super domination: graph classes, products and enumeration	2024-04-02	Paper
Neighbourhood complexity of graphs of bounded twin-width	2023-10-25	Paper
Bounds and extremal graphs for total dominating identifying codes	2023-08-18	Paper
The \textsc{Red-Blue Separation} problem on graphs	2023-08-08	Paper
New Optimal Results on Codes for Location in Graphs	2023-06-13	Paper
On radio \(k\)-labeling of the power of the infinite path	2023-06-05	Paper
Optimal local identifying and local locating-dominating codes	2023-02-26	Paper
The Levenshtein's Sequence Reconstruction Problem and the Length of the List	2022-11-16	Paper
Revisiting and improving upper bounds for identifying codes	2022-11-15	Paper
Locating-dominating sets: from graphs to oriented graphs	2022-11-02	Paper
The \textsc{red-blue separation} problem on graphs	2022-08-30	Paper
Improved lower bound for locating-dominating codes in binary Hamming spaces	2022-01-19	Paper
On Levenshtein’s Channel and List Size in Information Retrieval	2021-07-23	Paper
On a conjecture regarding identification in Hamming graphs	2019-07-11	Paper
On Stronger Types of Locating-dominating Codes	2019-05-23	Paper
On regular and new types of codes for location-domination	2018-09-06	Paper
Solving a Conjecture on Identification in Hamming Graphs	2018-05-04	Paper
Identifying codes in graphs of given maximum degree. I. Trees	N/A	Paper
Resolving Sets in Temporal Graphs	N/A	Paper
Identifying codes in graphs of given maximum degree. II. Triangle-free graphs	N/A	Paper

Research outcomes over time

This page was built for person: Tuomo Lehtilä