No. |
Title |
Author |
Year |
---|

1 |
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421) |
Borradaile, Glencora et al. |
2014 |

2 |
Chordal Editing is Fixed-Parameter Tractable |
Cao, Yixin et al. |
2014 |

3 |
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask) |
Marx, Dániel et al. |
2014 |

4 |
Algorithmic Graph Structure Theory (Tutorial) |
Marx, Dániel |
2013 |

5 |
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 12451) |
Hastad, Johan et al. |
2013 |

6 |
Data Reduction and Problem Kernels (Dagstuhl Seminar 12241) |
Fellows, Michael R. et al. |
2012 |

7 |
09511 Abstracts Collection -- Parameterized complexity and approximation algorithms |
Demaine, Erik D. et al. |
2010 |

8 |
09511 Executive Summary -- Parameterized complexity and approximation algorithms |
Demaine, Erik D. et al. |
2010 |

9 |
09511 Open Problems -- Parameterized complexity and approximation algorithms |
Demaine, Erik D. et al. |
2010 |

10 |
Treewidth Reduction for Constrained Separation and Bipartization Problems |
Marx, Dániel et al. |
2010 |