The following pages link to Tuomo Lehtilä (Q1671338):
Displaying 19 items.
- On regular and new types of codes for location-domination (Q1671339) (← links)
- On a conjecture regarding identification in Hamming graphs (Q2001977) (← links)
- Improved lower bound for locating-dominating codes in binary Hamming spaces (Q2068380) (← links)
- Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
- The \textsc{red-blue separation} problem on graphs (Q2169962) (← links)
- On Levenshtein’s Channel and List Size in Information Retrieval (Q5001721) (← links)
- Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
- On Stronger Types of Locating-dominating Codes (Q5377220) (← links)
- Neighbourhood complexity of graphs of bounded twin-width (Q6081102) (← links)
- Super domination: graph classes, products and enumeration (Q6130203) (← links)
- On radio \(k\)-labeling of the power of the infinite path (Q6161446) (← links)
- The \textsc{Red-Blue Separation} problem on graphs (Q6168089) (← links)
- Identifying codes in graphs of given maximum degree. I. Trees (Q6526800) (← links)
- Resolving Sets in Temporal Graphs (Q6526804) (← links)
- Identifying codes in graphs of given maximum degree. II. Triangle-free graphs (Q6527822) (← links)
- The Levenshtein's sequence reconstruction problem and the length of the list (Q6576022) (← links)
- Optimal local identifying and local locating-dominating codes (Q6614544) (← links)
- Partition strategies for the Maker-Breaker domination game (Q6733517) (← links)
- The $n/2$-bound for locating-dominating sets in subcubic graphs (Q6734271) (← links)
