"On the Fine-grained Parameterized Complexity of Partial Scheduling to ..."

Jesper Nederlof, Céline M. F. Swennenhuis (2022)

> Home

Details and statistics

DOI: 10.1007/S00453-022-00970-8

access: open

type: Journal Article

metadata version: 2022-08-08

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/NederlofS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/NederlofS22
Jesper Nederlof, Céline M. F. Swennenhuis:
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. Algorithmica 84(8): 2309-2334 (2022)

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.