Follow
Danil Sagunov
Danil Sagunov
Steklov Institute of Mathematics at St. Petersburg
Verified email at pdmi.ras.ru - Homepage
Title
Cited by
Cited by
Year
Diverse pairs of matchings
FV Fomin, PA Golovach, L Jaffke, G Philip, D Sagunov
arXiv preprint arXiv:2009.04567, 2020
142020
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
62022
Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs.
D Itsykson, A Riazanov, D Sagunov, P Smirnov
Electronic Colloquium on Computational Complexity (ECCC) 26, 178, 2019
52019
On Happy Colorings, Cuts, and Structural Parameterizations
I Bliznets, D Sagunov
International Workshop on Graph-Theoretic Concepts in Computer Science, 148-161, 2019
52019
Lower bounds for the happy coloring problems
I Bliznets, D Sagunov
International Computing and Combinatorics Conference, 490-502, 2019
42019
Solving Target Set Selection with Bounded Thresholds Faster than
I Bliznets, D Sagunov
arXiv preprint arXiv:1807.10789, 2018
4*2018
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), 1-74, 2021
32021
Longest Cycle above Erd\H {o} s-Gallai Bound
FV Fomin, PA Golovach, D Sagunov, K Simonov
arXiv preprint arXiv:2202.03061, 2022
12022
Detours in Directed Graphs
FV Fomin, PA Golovach, W Lochet, D Sagunov, K Simonov, S Saurabh
arXiv preprint arXiv:2201.03318, 2022
12022
Lower bounds for the happy coloring problems
I Bliznets, D Sagunov
Theoretical Computer Science 838, 94-110, 2020
12020
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
Maximizing Happiness in Graphs of Bounded Clique-Width
I Bliznets, D Sagunov
Latin American Symposium on Theoretical Informatics, 91-103, 2021
2021
Building large k-cores from sparse graphs
FV Fomin, D Sagunov, K Simonov
arXiv preprint arXiv:2002.07612, 2020
2020
Fine-grained Complexity of Partial Minimum Satisfiability
I Bliznets, D Sagunov, K Simonov
The system can't perform the operation now. Try again later.
Articles 1–14