"Scaffolding Problems Revisited: Complexity, Approximation and Fixed ..."

Mathias Weller et al. (2018)

> Home

Details and statistics

DOI: 10.1007/S00453-018-0405-X

access: closed

type: Journal Article

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/WellerCDG18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/WellerCDG18
Mathias Weller, Annie Chateau, Clément Dallard, Rodolphe Giroudeau:
Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases. Algorithmica 80(6): 1771-1803 (2018)

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.