1 citations · 1 across the 3 of their papers we have counts for
4 papers · 1 filter
The Generalized Double Pouring Problem: Analysis, Bounds and Algorithms
Gerold Jäger, Tuomo Lehtilä
We consider a logical puzzle which we call double pouring problem, which was original defined for vessels. We generalize this definition to as follows. Each of the…
Reconstructing graphs with subgraph compositions
Antoine Dailly, Tuomo Lehtilä
We generalize the problem of reconstructing strings from their substring compositions first introduced by Acharya et al. in 2015 motivated by polymer-based advanced data storage sy…
Super Domination: Graph Classes, Products and Enumeration
Nima Ghanbari, Gerold Jäger, Tuomo Lehtilä
The dominating set problem (DSP) is one of the most famous problems in combinatorial optimization. It is defined as follows. For a given simple graph , a dominating set of…
Improved Lower Bound for Locating-Dominating Codes in Binary Hamming Spaces
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
In this article, we study locating-dominating codes in binary Hamming spaces . Locating-dominating codes have been widely studied since their introduction in 1980s by…