| No. |
Title |
Author |
Year |
| 1 |
Approximating Long Cycle Above Dirac’s Guarantee |
Fomin, Fedor V. et al. |
2023 |
| 2 |
Detours in Directed Graphs |
Fomin, Fedor V. et al. |
2022 |
| 3 |
FPT Approximation for Fair Minimum-Load Clustering |
Bandyapadhyay, Sayan et al. |
2022 |
| 4 |
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk) |
Fomin, Fedor V. et al. |
2022 |
| 5 |
Longest Cycle Above Erdős-Gallai Bound |
Fomin, Fedor V. et al. |
2022 |
| 6 |
Parameterized Algorithms for Upward Planarity |
Chaplick, Steven et al. |
2022 |
| 7 |
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width |
Ganian, Robert et al. |
2022 |
| 8 |
Weighted Model Counting with Twin-Width |
Ganian, Robert et al. |
2022 |
| 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 |
Building Large k-Cores from Sparse Graphs |
Fomin, Fedor V. et al. |
2020 |
| 12 |
Low-Rank Binary Matrix Approximation in Column-Sum Norm |
Fomin, Fedor V. et al. |
2020 |
| 13 |
Parameterized Complexity of PCA (Invited Talk) |
Fomin, Fedor V. et al. |
2020 |
| 14 |
Parameterized k-Clustering: Tractability Island |
Fomin, Fedor V. et al. |
2019 |
