About
I am currently a researcher in ITMO University and Saint Petersburg State University.
I enjoy being an organizer of the Computer Science Space initiative based in Saint Petersburg.
I graduated from St. Petersburg Academic University and I was previously
a PhD student in Steklov Institute of Mathematics at St. Petersburg
(PDMI RAS) under supervision of Ivan Bliznets.
I also greatly appreciate working with a team of brilliant researchers Fedor V. Fomin, Petr A. Golovach and Kirill Simonov, whom I was happy to start communicating with on my very first research visit to the University of Bergen.
Research interests
parameterized complexity •
algorithmic graph theory •
exact algorithms •
algorithms for NP-hard problems •
kernelization •
computational complexity •
graph algorithms and parameters
Publications
-
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov.
Edge Clique Partition and Cover Beyond Independence
ESA 2025 [w]
[arXiv]
-
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov.
Tree Containment Above Minimum Degree is FPT
SODA 2024 [w]
doi:10.1137/1.9781611977912.15
[SIAM]
[arXiv]
-
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov.
Approximating Long Cycle Above Dirac's Guarantee
Algorithmica /
ICALP 2023 [w]
doi:10.4230/LIPIcs.ICALP.2023.60
[Algorithmica]
[LIPIcs]
[arXiv]
-
Ivan Bliznets, Danil Sagunov, Eugene Tagin.
Enumeration of Minimal Tropical Connected Sets
CIAC 2023
doi:10.1007/978-3-031-30448-4_10
[LNCS]
-
Ivan Bliznets, Danil Sagunov, Kirill Simonov.
Fine-grained Complexity of Partial Minimum Satisfiability
IJCAI 2022
doi:10.24963/ijcai.2022/247
[IJCAI]
-
Ivan Bliznets, Anton Bukov, Danil Sagunov.
Fair Division with Minimal Withheld Information in Social Networks
Theoretical Computer Science / COCOON 2022
doi:10.1007/978-3-031-22105-7_12
[LNCS]
-
Ivan Bliznets, Danil Sagunov.
Two Generalizations of Proper Coloring: Hardness and Approximability
COCOON 2022
doi:10.1007/978-3-031-22105-7_8
[LNCS]
-
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov.
Longest Cycle Above Erdős-Gallai Bound
SIAM Journal on Discrete Mathematics / ESA 2022
doi:10.4230/LIPIcs.ESA.2022.55
[LIPIcs]
[arXiv]
-
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov.
Detours in Directed Graphs
Journal of Computer and System Sciences / STACS 2022 [w]
doi:10.4230/LIPIcs.STACS.2022.29
[arXiv]
[LIPIcs]
-
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov.
Algorithmic Extensions of Dirac's Theorem
SODA 2022 [w]
doi:10.1137/1.9781611977073.20
[arXiv]
[SIAM]
-
Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov.
Diverse Pairs of Matchings
Algorithmica / ISAAC 2020 [w]
doi:10.4230/LIPIcs.ISAAC.2020.26
[arXiv]
[LIPIcs]
-
Fedor V. Fomin, Danil Sagunov, Kirill Simonov.
Building large k-cores from sparse graphs
Journal of Computer and System Sciences / MFCS 2020 [w]
doi:10.4230/LIPIcs.MFCS.2020.35
[arXiv]
[LIPIcs]
-
Ivan Bliznets, Danil Sagunov.
Maximizing Happiness in Graphs of Bounded Clique-Width
LATIN 2020 [w]
doi:10.1007/978-3-030-61792-9_8
[arXiv] [LNCS]
-
Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov.
Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs
computational complexity
doi:10.1007/s00037-021-00213-2
[eccc]
[Springer]
-
Ivan Bliznets, Danil Sagunov.
Lower Bounds for the Happy Coloring Problems
Theoretical Computer Science / COCOON 2019 [w]
doi:10.1007/978-3-030-26176-4_41
[arXiv]
[LNCS]
[TCS]
-
Ivan Bliznets, Danil Sagunov.
On Happy Colorings, Cuts, and Structural Parameterizations
WG 2019 [w]
doi:10.1007/978-3-030-30786-8_12
[arXiv]
[LNCS]
-
Ivan Bliznets, Danil Sagunov.
Solving Target Set Selection with Bounded Thresholds Faster than 2^n
Algorithmica / IPEC 2018
doi:10.4230/LIPIcs.IPEC.2018.22
[Algorithmica]
[arXiv]
[LIPIcs]
|
