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

1 |
Covering Vectors by Spaces: Regular Matroids |
Fomin, Fedor V. et al. |
2017 |

2 |
Exact Algorithms for Terrain Guarding |
Ashok, Pradeesha et al. |
2017 |

3 |
Finding Detours is Fixed-Parameter Tractable |
Bezáková, Ivona et al. |
2017 |

4 |
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs |
Fomin, Fedor V. et al. |
2017 |

5 |
Matrix Rigidity from the Viewpoint of Parameterized Complexity |
Fomin, Fedor V. et al. |
2017 |

6 |
Randomization in Parameterized Complexity (Dagstuhl Seminar 17041) |
Cygan, Marek et al. |
2017 |

7 |
Editing to Connected f-Degree Graph |
Fomin, Fedor V. et al. |
2016 |

8 |
Graph Decompositions and Algorithms (Invited Talk) |
Fomin, Fedor V. |
2016 |

9 |
Kernelization and Sparseness: the Case of Dominating Set |
Drange, Pål Grønås et al. |
2016 |

10 |
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems |
Fomin, Fedor et al. |
2016 |