"The Minimum Feasible Tileset Problem."

Yann Disser, Stefan Kratsch, Manuel Sorge (2019)

> Home

Details and statistics

DOI: 10.1007/S00453-018-0460-3

access: closed

type: Journal Article

metadata version: 2019-03-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/DisserKS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/DisserKS19
Yann Disser, Stefan Kratsch, Manuel Sorge:
The Minimum Feasible Tileset Problem. Algorithmica 81(3): 1126-1151 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.