Solving Target Set Selection with Bounded Thresholds Faster than 2^n. - Ivan Bliznets; Danil Sagunov (IPEC, 2018)

On Happy Colorings, Cuts, and Structural Parameterizations. - Ivan Bliznets; Danil Sagunov (WG, 2019)

Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. - Dmitry Itsykson; Artur Riazanov; Danil Sagunov; Petr Smirnov (Electron. Colloquium Comput. Complex., 2019)

Maximizing Happiness in Graphs of Bounded Clique-Width. - Ivan Bliznets; Danil Sagunov (LATIN, 2020)

Building Large k-Cores from Sparse Graphs. - Fedor V. Fomin; Danil Sagunov; Kirill Simonov (MFCS, 2020)

Lower bounds for the happy coloring problems. - Ivan Bliznets; Danil Sagunov (Theor. Comput. Sci., 2020)

Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. - Dmitry Itsykson; Artur Riazanov; Danil Sagunov; Petr Smirnov (Comput. Complex., 2021)

Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. - Dmitry Itsykson; Artur Riazanov; Danil Sagunov; Petr Smirnov (Comput. Complex., 2021)

Two Generalizations of Proper Coloring: Hardness and Approximability. - Ivan Bliznets; Danil Sagunov (COCOON, 2022)

Fine-grained Complexity of Partial Minimum Satisfiability. - Ivan Bliznets; Danil Sagunov; Kirill Simonov (IJCAI, 2022)

Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (MFCS, 2022)

Algorithmic Extensions of Dirac's Theorem. - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (SODA, 2022)

Enumeration of Minimal Tropical Connected Sets. - Ivan Bliznets; Danil Sagunov; Eugene Tagin (CIAC, 2023)

Turán's Theorem Through Algorithmic Lens. - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (WG, 2023)

Building large k-cores from sparse graphs. - Fedor V. Fomin; Danil Sagunov; Kirill Simonov (J. Comput. Syst. Sci., 2023)

Solving Target Set Selection with Bounded Thresholds Faster than 2n. - Ivan Bliznets; Danil Sagunov (Algorithmica, 2023)

Detours in directed graphs. - Fedor V. Fomin; Petr A. Golovach; William Lochet; Danil Sagunov; Saket Saurabh 001; Kirill Simonov (J. Comput. Syst. Sci., 2023)

Tree Containment Above Minimum Degree is FPT. - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (SODA, 2024)

Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective. - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (CoRR, 2024)

Longest Cycle above Erdős-Gallai Bound. - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (SIAM J. Discret. Math., 2024)

Fair division with minimal withheld information in social networks. - Ivan Bliznets; Anton Bukov; Danil Sagunov (Theor. Comput. Sci., 2024)

Diverse Pairs of Matchings. - Fedor V. Fomin; Petr A. Golovach; Lars Jaffke; Geevarghese Philip; Danil Sagunov (Algorithmica, 2024)

Approximating Long Cycle Above Dirac's Guarantee. - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (Algorithmica, 2024)

Edge Clique Partition and Cover Beyond Independence. - Fedor V. Fomin; Petr A. Golovach; Danil Sagunov; Kirill Simonov (CoRR, 2025)