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

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

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

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

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

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

6 |
Parameterized Complexity of Secluded Connectivity Problems |
Fomin, Fedor V. et al. |
2015 |

7 |
Connecting Vertices by Independent Trees |
Basavaraju, Manu et al. |
2014 |

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

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

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