| No. |
Title |
Author |
Year |
| 1 |
Algebraic Complexity and Parallelism (Dagstuhl Seminar 9230) |
von zur Gathen, Joachim et al. |
2021 |
| 2 |
Algorithmic Game Theory and the Internet (Dagstuhl Seminar 03291) |
Karpinski, Marek et al. |
2021 |
| 3 |
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 01231) |
Dyer, Martin et al. |
2021 |
| 4 |
Efficient Interpolation Algorithms (Dagstuhl Seminar 9149) |
Dress, Andreas et al. |
2021 |
| 5 |
Randomized Algorithms (Dagstuhl Seminar 9124) |
Karpinski, Marek et al. |
2021 |
| 6 |
Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242) |
Bürgisser, Peter et al. |
2016 |
| 7 |
Generalized Wong sequences and their applications to Edmonds' problems |
Ivanyos, Gábor et al. |
2014 |
| 8 |
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241) |
Dyer, Martin et al. |
2011 |
| 9 |
08201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms |
Dyer, Martin E. et al. |
2008 |
| 10 |
05201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms |
Dyer, Martin et al. |
2005 |
