Get started
Author

Danil Sagunov

Algorithmic Extensions of Dirac's Theorem
2022 · Fedor V. Fomin, Petr A. Golovach, et al. · Society for Industrial and Applied Mathematics eBooks · 11
PDF
Diverse Pairs of Matchings
2024 · Fedor V. Fomin, Petr A. Golovach, et al. · Algorithmica · 9
PDF
Detours in directed graphs
2023 · Fedor V. Fomin, Petr A. Golovach, et al. · Journal of Computer and System Sciences · 7
Lower Bounds for the Happy Coloring Problems
2019 · Ivan Bliznets, Danil Sagunov · Lecture notes in computer science · 7
On Happy Colorings, Cuts, and Structural Parameterizations
2019 · Ivan Bliznets, Danil Sagunov · Lecture notes in computer science · 7
PDF
Building large k-cores from sparse graphs
2022 · Fedor V. Fomin, Danil Sagunov, et al. · Journal of Computer and System Sciences · 5
Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs
2021 · Dmitry Itsykson, Artur Riazanov, et al. · Computational Complexity · 5
Diverse Pairs of Matchings
2020 · Fomin, Fedor V., Golovach, Petr A., et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 5
PDF
Solving Target Set Selection with Bounded Thresholds Faster than $$2^n$$
2022 · Ivan Bliznets, Danil Sagunov · Algorithmica · 4
PDF
Longest Cycle above Erdős–Gallai Bound
2024 · Fedor V. Fomin, Petr A. Golovach, et al. · SIAM Journal on Discrete Mathematics · 3
Turán’s Theorem Through Algorithmic Lens
2023 · Fedor V. Fomin, Petr A. Golovach, et al. · Lecture notes in computer science · 2
PDF
Longest Cycle Above Erdős-Gallai Bound
2022 · Fomin, Fedor V., Golovach, Petr A., et al. · arXiv (Cornell University) · 2
PDF
Maximizing Happiness in Graphs of Bounded Clique-Width
2020 · Ivan Bliznets, Danil Sagunov · Lecture notes in computer science · 2
PDF
Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
2026 · Fedor V. Fomin, Petr A. Golovach, et al. · ACM Symposium on Theory of Computing (STOC) · 1
Tree Containment above Minimum Degree Is FPT
2025 · Fedor V. Fomin, Petr A. Golovach, et al. · ACM Transactions on Algorithms · 1
PDF
Fair division with minimal withheld information in social networks
2024 · Ivan Bliznets, Anton Bukov, et al. · Theoretical Computer Science · 1
Enumeration of Minimal Tropical Connected Sets
2023 · Ivan Bliznets, Danil Sagunov, et al. · Lecture notes in computer science · 1
Fine-grained Complexity of Partial Minimum Satisfiability
2022 · Ivan Bliznets, Danil Sagunov, et al. · International Joint Conference on Artificial Intelligence · 1
PDF
Subexponential Algorithm for High Multiplicity Fair Division of Mixed Instances via Stereometry
2026 · Dementiev, Yuriy, Pribytkov, Fedor, et al. · arXiv (Cornell University)
PDF
Learning Augmented Exact Exponential Algorithms
2026 · Belova, Tatiana, Dementiev, Yuriy, et al. · arXiv (Cornell University)
PDF
Partial Minimum Satisfiability: Fine-Grained Analysis
2026 · Ivan Bliznets, Danil Sagunov, et al. · Journal of Artificial Intelligence Research
PDF
EFX and PO Allocation Exists for Two Types of Goods
2026 · Vladimir Davidiuk, Yuriy Dementiev, et al. · Proceedings of the AAAI Conference on Artificial Intelligence
PDF
Structural Approach to Guiding a Present-Biased Agent
2026 · Tatiana Belova, Yuriy Dementiev, et al. · Proceedings of the AAAI Conference on Artificial Intelligence
PDF
Discounted Cuts: A Stackelberg Approach to Network Disruption
2026 · Pål Grønås Drange, Fedor Fomin, et al. · Proceedings of the AAAI Conference on Artificial Intelligence
PDF
Structural Approach to Guiding a Present-Biased Agent
2026 · Belova, Tatiana, Dementiev, Yuriy, et al. · arXiv (Cornell University)
PDF
Works count: 42
Citation count: 74
H-index: 5
I10-index: 1
Year
Topic
Type