| No. |
Title |
Author |
Year |
| 1 |
An Investigation of the Recoverable Robust Assignment Problem |
Fischer, Dennis et al. |
2021 |
| 2 |
Combinatorial Approximation Algorithms (Dagstuhl Seminar 9734) |
Rabani, Yuval et al. |
2021 |
| 3 |
Competitive Algorithms (Dagstuhl Seminar 99251) |
Fiat, Amos et al. |
2021 |
| 4 |
Graph Colorings (Dagstuhl Seminar 03391) |
Nesetril, Jaroslav et al. |
2021 |
| 5 |
On-line Algorithms (Dagstuhl Seminar 9626) |
Fiat, Amos et al. |
2021 |
| 6 |
Online Algorithms (Dagstuhl Seminar 02271) |
Albers, Susanne et al. |
2021 |
| 7 |
The Travelling Salesman Problem (Dagstuhl Seminar 02261) |
Johnson, David S. et al. |
2021 |
| 8 |
Dispersing Obnoxious Facilities on a Graph |
Grigoriev, Alexander et al. |
2019 |
| 9 |
Graph Similarity and Approximate Isomorphism |
Grohe, Martin et al. |
2018 |
| 10 |
The Dominating Set Problem in Geometric Intersection Graphs |
de Berg, Mark et al. |
2018 |
| 11 |
The Open Shop Scheduling Problem |
Woeginger, Gerhard J. |
2018 |
| 12 |
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points |
de Berg, Mark et al. |
2017 |
| 13 |
Fine-Grained Complexity Analysis of Two Classic TSP Variants |
de Berg, Mark et al. |
2016 |
| 14 |
Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs |
Hermelin, Danny et al. |
2015 |
| 15 |
Motion planning with pulley, rope, and baskets |
Eggermont, Christian E.J. et al. |
2012 |
| 16 |
Analysis of multi-stage open shop processing systems |
Eggermont, Christian E.J. et al. |
2011 |
| 17 |
The Traveling Salesman Problem under Squared Euclidean Distances |
van Nijnatten, Fred et al. |
2010 |
| 18 |
05301 Abstracts Collection -- Exact Algorithms and Fixed-Parameter Tractability |
Downey, Rod et al. |
2006 |
| 19 |
05301 Summary -- Exact Algorithms and Fixed-Parameter Tractability |
Downey, Rod et al. |
2006 |
