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

1 |
Exploring Subexponential Parameterized Complexity of Completion Problems |
Drange, Pal Gronas et al. |
2014 |

2 |
Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121) |
Demaine, Erik D. et al. |
2013 |

3 |
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs |
Fomin, Fedor V. et al. |
2013 |

4 |
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs |
Chitnis, Rajesh et al. |
2013 |

5 |
Searching for better fill-in |
Fomin, Fedor V. et al. |
2013 |

6 |
Tight bounds for Parameterized Complexity of Cluster Editing |
Fomin, Fedor V. et al. |
2013 |

7 |
Parameterized Complexity of Connected Even/Odd Subgraph Problems |
Fomin, Fedor V. et al. |
2012 |

8 |
Hitting forbidden minors: Approximation and Kernelization |
Fomin, Fedor V. et al. |
2011 |

9 |
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation |
Fomin, Fedor V. et al. |
2011 |

10 |
Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071) |
Fomin, Fedor V. et al. |
2011 |