| No. |
Title |
Author |
Year |
| 1 |
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 01231) |
Dyer, Martin et al. |
2021 |
| 2 |
A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative Weights |
Govorov, Artem et al. |
2020 |
| 3 |
Discordant Voting Processes on Finite Graphs |
Cooper, Colin et al. |
2016 |
| 4 |
The complexity of approximating conservative counting CSPs |
Chen, Xi et al. |
2013 |
| 5 |
Log-supermodular functions, functional clones and counting CSPs |
Bulatov, Andrei A. et al. |
2012 |
| 6 |
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241) |
Dyer, Martin et al. |
2011 |
| 7 |
The #CSP Dichotomy is Decidable |
Dyer, Martin et al. |
2011 |
| 8 |
The Complexity of Approximating Bounded-Degree Boolean #CSP |
Dyer, Martin et al. |
2010 |
| 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 |
