| No. |
Title |
Author |
Year |
| 1 |
Pebble Games and Linear Equations |
Grohe, Martin et al. |
2012 |
| 2 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121) |
Grohe, Martin et al. |
2011 |
| 3 |
L-Recursion and a new Logic for Logarithmic Space |
Grohe, Martin et al. |
2011 |
| 4 |
09441 Abstracts Collection -- The Constraint Satisfaction Problem: Complexity and Approximability |
Bulatov, Andrei A. et al. |
2010 |
| 5 |
09441 Executive Summary -- The Constraint Satisfaction Problem: Complexity and Approximability |
Bulatov, Andrei A. et al. |
2010 |
| 6 |
A Complexity Dichotomy for Partition Functions with Mixed Signs |
Goldberg, Leslie Ann et al. |
2009 |
| 7 |
Enumerating Homomorphisms |
Bulatov, Andrei A. et al. |
2009 |
| 8 |
05301 Abstracts Collection -- Exact Algorithms and Fixed-Parameter Tractability |
Downey, Rod et al. |
2006 |
| 9 |
05301 Summary -- Exact Algorithms and Fixed-Parameter Tractability |
Downey, Rod et al. |
2006 |
| 10 |
Constraint Satisfaction with Succinctly Specified Relations |
Chen, Hubie et al. |
2006 |
