| No. |
Title |
Author |
Year |
| 1 |
Algorithmic Graph Structure Theory (Tutorial) |
Marx, Dániel |
2013 |
| 2 |
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 12451) |
Hastad, Johan et al. |
2013 |
| 3 |
Data Reduction and Problem Kernels (Dagstuhl Seminar 12241) |
Fellows, Michael R. et al. |
2012 |
| 4 |
09511 Abstracts Collection -- Parameterized complexity and approximation algorithms |
Demaine, Erik D. et al. |
2010 |
| 5 |
09511 Executive Summary -- Parameterized complexity and approximation algorithms |
Demaine, Erik D. et al. |
2010 |
| 6 |
09511 Open Problems -- Parameterized complexity and approximation algorithms |
Demaine, Erik D. et al. |
2010 |
| 7 |
Treewidth Reduction for Constrained Separation and Bipartization Problems |
Marx, Dániel et al. |
2010 |
| 8 |
Enumerating Homomorphisms |
Bulatov, Andrei A. et al. |
2009 |
| 9 |
Tractable Structures for Constraint Satisfaction with Truth Tables |
Marx, Daniel |
2009 |
| 10 |
07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs |
Demaine, Erik et al. |
2007 |
