"Parameterized Complexity Analysis for the Closest String with Wildcards ..."

Danny Hermelin, Liat Rozenberg (2014)

> Home

Details and statistics

DOI: 10.1007/978-3-319-07566-2_15

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cpm/HermelinR14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpm/HermelinR14
Danny Hermelin, Liat Rozenberg:
Parameterized Complexity Analysis for the Closest String with Wildcards Problem. CPM 2014: 140-149

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.