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

1 |
Parameterization Above a Multiplicative Guarantee |
Fomin, Fedor V. et al. |
2020 |

2 |
Clustering to Given Connectivities |
Golovach, Petr A. et al. |
2019 |

3 |
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals |
Fomin, Fedor V. et al. |
2019 |

4 |
Cyclability in Graph Classes |
Crespelle, Christophe et al. |
2019 |

5 |
Going Far From Degeneracy |
Fomin, Fedor V. et al. |
2019 |

6 |
Modification to Planarity is Fixed Parameter Tractable |
Fomin, Fedor V. et al. |
2019 |

7 |
Parameterized k-Clustering: Tractability Island |
Fomin, Fedor V. et al. |
2019 |

8 |
Finding Connected Secluded Subgraphs |
Golovach, Petr A. et al. |
2018 |

9 |
On the Tractability of Optimization Problems on H-Graphs |
Fomin, Fedor V. et al. |
2018 |

10 |
Parameterized Aspects of Strong Subgraph Closure |
Golovach, Petr A. et al. |
2018 |

11 |
Parameterized Low-Rank Binary Matrix Approximation |
Fomin, Fedor V. et al. |
2018 |

12 |
Partial Complementation of Graphs |
Fomin, Fedor V. et al. |
2018 |

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

14 |
Structured Connectivity Augmentation |
Fomin, Fedor V. et al. |
2017 |

15 |
A Linear Kernel for Finding Square Roots of Almost Planar Graphs |
Golovach, Petr A. et al. |
2016 |

16 |
Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality |
Golovach, Petr A. et al. |
2015 |

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

18 |
Variants of Plane Diameter Completion |
Golovach, Petr A. et al. |
2015 |

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

20 |
Editing to Eulerian Graphs |
Dabrowski, Konrad K. et al. |
2014 |

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

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

23 |
Approximating Acyclicity Parameters of Sparse Hypergraphs |
Fomin, Fedor V. et al. |
2009 |