Diverse Pairs of Matchings FV Fomin, PA Golovach, L Jaffke, G Philip, D Sagunov
Algorithmica 86 (6), 2026-2040, 2024
37 * 2024 Algorithmic Extensions of Dirac's Theorem∗ FV Fomin, PA Golovach, D Sagunov, K Simonov
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
16 2022 Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs D Itsykson, A Riazanov, D Sagunov, P Smirnov
computational complexity 30 (2), 13, 2021
10 2021 Longest cycle above Erdős–Gallai bound FV Fomin, PA Golovach, D Sagunov, K Simonov
SIAM Journal on Discrete Mathematics 38 (4), 2721-2749, 2024
8 2024 Detours in directed graphs FV Fomin, PA Golovach, W Lochet, D Sagunov, S Saurabh, K Simonov
Journal of Computer and System Sciences 137, 66-86, 2023
8 2023 On happy colorings, cuts, and structural parameterizations I Bliznets, D Sagunov
Graph-Theoretic Concepts in Computer Science: 45th International Workshop …, 2019
7 2019 Lower bounds for the happy coloring problems I Bliznets, D Sagunov
International Computing and Combinatorics Conference, 490-502, 2019
6 2019 Solving Target Set Selection with Bounded Thresholds Faster than I Bliznets, D Sagunov
arXiv preprint arXiv:1807.10789, 2018
5 * 2018 Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective FV Fomin, PA Golovach, D Sagunov, K Simonov
arXiv preprint arXiv:2403.05943, 2024
3 2024 Approximating long cycle above Dirac’s guarantee FV Fomin, PA Golovach, D Sagunov, K Simonov
Algorithmica 86 (8), 2676-2713, 2024
2 2024 Fair division with minimal withheld information in social networks I Bliznets, A Bukov, D Sagunov
Theoretical Computer Science 991, 114446, 2024
2 2024 Building large k-cores from sparse graphs FV Fomin, D Sagunov, K Simonov
Journal of Computer and System Sciences 132, 68-88, 2023
2 2023 Fine-grained Complexity of Partial Minimum Satisfiability. I Bliznets, D Sagunov, K Simonov
IJCAI, 1774-1780, 2022
2 2022 Maximizing happiness in graphs of bounded clique-width I Bliznets, D Sagunov
Latin American Symposium on Theoretical Informatics, 91-103, 2020
2 2020 Turán’s Theorem Through Algorithmic Lens FV Fomin, PA Golovach, D Sagunov, K Simonov
International Workshop on Graph-Theoretic Concepts in Computer Science, 348-362, 2023
1 2023 Tree Containment Above Minimum Degree is FPT FV Fomin, PA Golovach, D Sagunov, K Simonov
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
2024 Enumeration of Minimal Tropical Connected Sets I Bliznets, D Sagunov, E Tagin
International Conference on Algorithms and Complexity, 127-141, 2023
2023 Two Generalizations of Proper Coloring: Hardness and Approximability I Bliznets, D Sagunov
International Computing and Combinatorics Conference, 82-93, 2022
2022 Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk) FV Fomin, PA Golovach, D Sagunov, K Simonov
47th International Symposium on Mathematical Foundations of Computer Science …, 2022
2022 
Fedor V. FominProfessor of Computer Science, University of BergenEmail verificata su uib.no