|
11 |
Parameterized Complexity Dichotomy for Steiner Multicut
Bringmann, Karl. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2015
|
|
|
|
12 |
Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs
Hermelin, Danny. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2015
|
|
|
13 |
A general scheme for solving a large set of scheduling problems with rejection in FPT time
Enthalten in Journal of scheduling Bd. 25, 6.4.2022, Nr. 2, date:4.2022: 229-255
|
|
|
|
14 |
Faster Minimization of Tardy Processing Time on a Single Machine
Enthalten in Algorithmica Bd. 84, 27.1.2022, Nr. 5, date:5.2022: 1341-1356
|
|
|
|
15 |
New algorithms for minimizing the weighted number of tardy jobs on a single machine
Enthalten in Annals of operations research Bd. 298, 12.4.2018, Nr. 1-2, date:3.2021: 271-287
|
|
|
|
16 |
On the parameterized tractability of the just-in-time flow-shop scheduling problem
Enthalten in Journal of scheduling Bd. 22, 14.8.2019, Nr. 6, date:12.2019: 663-676
|
|
|
|
17 |
Parameterized Multi-Scenario Single-Machine Scheduling Problems
Enthalten in Algorithmica Bd. 82, 28.3.2020, Nr. 9, date:9.2020: 2644-2667
|
|
|
|
18 |
Serial batching to minimize the weighted number of tardy jobs
Enthalten in Journal of scheduling Bd. 27, 22.10.2024, Nr. 6, date:12.2024: 545-556
|
|
Administration
