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

1 |
(Re)packing Equal Disks into Rectangle |
Fomin, Fedor V. et al. |
2022 |

2 |
Detours in Directed Graphs |
Fomin, Fedor V. et al. |
2022 |

3 |
Exact Exponential Algorithms for Clustering Problems |
Fomin, Fedor V. et al. |
2022 |

4 |
FPT Approximation for Fair Minimum-Load Clustering |
Bandyapadhyay, Sayan et al. |
2022 |

5 |
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk) |
Fomin, Fedor V. et al. |
2022 |

6 |
Longest Cycle Above ErdÅ‘s-Gallai Bound |
Fomin, Fedor V. et al. |
2022 |

7 |
Diverse Collections in Matroids and Graphs |
Fomin, Fedor V. et al. |
2021 |

8 |
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space |
Fomin, Fedor V. et al. |
2021 |

9 |
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications |
Bandyapadhyay, Sayan et al. |
2021 |

10 |
Parameterized Complexity of Feature Selection for Categorical Data Clustering |
Bandyapadhyay, Sayan et al. |
2021 |

11 |
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL |
Fomin, Fedor V. et al. |
2020 |

12 |
Building Large k-Cores from Sparse Graphs |
Fomin, Fedor V. et al. |
2020 |

13 |
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds |
Fomin, Fedor V. et al. |
2020 |

14 |
Diverse Pairs of Matchings |
Fomin, Fedor V. et al. |
2020 |

15 |
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs |
Fomin, Fedor V. et al. |
2020 |

16 |
Kernelization of Whitney Switches |
Fomin, Fedor V. et al. |
2020 |

17 |
Low-Rank Binary Matrix Approximation in Column-Sum Norm |
Fomin, Fedor V. et al. |
2020 |

18 |
On the Complexity of Recovering Incidence Matrices |
Fomin, Fedor V. et al. |
2020 |

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

20 |
Parameterized Complexity of Directed Spanner Problems |
Fomin, Fedor V. et al. |
2020 |

21 |
Parameterized Complexity of PCA (Invited Talk) |
Fomin, Fedor V. et al. |
2020 |

22 |
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs |
Fomin, Fedor V. et al. |
2020 |

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

24 |
Decomposition of Map Graphs with Applications |
Fomin, Fedor V. et al. |
2019 |

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

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

27 |
New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) |
Fomin, Fedor V. et al. |
2019 |

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

29 |
Path Contraction Faster Than 2^n |
Agrawal, Akanksha et al. |
2019 |

30 |
A Fixed-Parameter Perspective on #BIS |
Curticapean, Radu et al. |
2018 |