"Hardness of Vertex Deletion and Project Scheduling."

Ola Svensson (2013)

> Home

Details and statistics

DOI: 10.4086/TOC.2013.V009A024

access: open

type: Journal Article

metadata version: 2020-06-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/toc/Svensson13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toc/Svensson13
Ola Svensson:
Hardness of Vertex Deletion and Project Scheduling. Theory Comput. 9: 759-781 (2013)

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.