25 citations · 57 across the 24 of their papers we have counts for
1 paper · 1 filter
Yann Disser, Stefan Kratsch, Manuel Sorge
We introduce and study the Minimum Feasible Tileset problem: Given a set of symbols and subsets of these symbols (scenarios), find a smallest possible number of pairs of symbols (t…