The Minimum Feasible Tileset Problem

Yann Disser, Stefan Kratsch, Manuel Sorge. The Minimum Feasible Tileset Problem. Algorithmica, 81(3):1126-1151, 2019. [doi]

@article{DisserKS19,
  title = {The Minimum Feasible Tileset Problem},
  author = {Yann Disser and Stefan Kratsch and Manuel Sorge},
  year = {2019},
  doi = {10.1007/s00453-018-0460-3},
  url = {https://doi.org/10.1007/s00453-018-0460-3},
  researchr = {https://researchr.org/publication/DisserKS19},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {81},
  number = {3},
  pages = {1126-1151},
}