| 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 | Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk) | Fomin, Fedor V. et al. | 2022 |
| 4 | Longest Cycle Above Erdős-Gallai Bound | Fomin, Fedor V. et al. | 2022 |
| 5 | Building Large k-Cores from Sparse Graphs | Fomin, Fedor V. et al. | 2020 |
| 6 | Diverse Pairs of Matchings | Fomin, Fedor V. et al. | 2020 |
| 7 | Solving Target Set Selection with Bounded Thresholds Faster than 2^n | Bliznets, Ivan et al. | 2019 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |