7 citations · 18 across the 14 of their papers we have counts for
4 papers · 1 filter
Optimal -locating-dominating codes in infinite triangular grid
Soura Sena Das, Tuomo Lehtilä, Sagnik Sen
We study two variants of location-domination in infinite triangular grids which allow locating up to vertices simultaneously. A locating-dominating code is a dominating…
Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth
Gaétan Berthe, Florent Foucaud, Tuomo Lehtilä +1
The neighbourhood complexity of a graph is a quantity measuring, for a graph and an integer , the maximum possible number (over all vertex subsets of size…
Unique Insertion Error Patterns in Levenshtein's Reconstruction Problem
Ville Junnila, Tero Laihonen, Tuomo Lehtilä +1
Levenshtein's sequence reconstruction model plays an essential role in information retrieval of advanced memory systems, such as the DNA-based storage systems. In the model, a word…
The Size of the Intersection of -ary Hamming Balls
Ville Junnila, Tero Laihonen, Tuomo Lehtilä +1
The interest in studying the size of the intersection of multiple -ary Hamming balls has grown due to the recent advances in DNA-based data storage systems. We present an exact…