Danil Sagunov

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 40

Top Topics

Minimal Subsets

Top Venues

J. Comput. Syst. Sci.

Publications

Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Tree Containment Above Minimum Degree is FPT. SODA (2024)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective. CoRR (2024)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Approximating Long Cycle Above Dirac's Guarantee. Algorithmica 86 (8) (2024)
Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
Diverse Pairs of Matchings. Algorithmica 86 (6) (2024)
Ivan Bliznets, Anton Bukov, Danil Sagunov
Fair division with minimal withheld information in social networks. Theor. Comput. Sci. 991 (2024)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Tree Containment Above Minimum Degree is FPT. CoRR (2023)
Ivan Bliznets, Danil Sagunov
. Algorithmica 85 (2) (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Approximating Long Cycle Above Dirac's Guarantee. ICALP (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Turán's Theorem Through Algorithmic Lens. WG (2023)
Fedor V. Fomin, Danil Sagunov, Kirill Simonov
-cores from sparse graphs. J. Comput. Syst. Sci. 132 (2023)
Ivan Bliznets, Danil Sagunov, Eugene Tagin
Enumeration of Minimal Tropical Connected Sets. CIAC (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Approximating Long Cycle Above Dirac's Guarantee. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov
Detours in directed graphs. J. Comput. Syst. Sci. 137 (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Turán's Theorem Through Algorithmic Lens. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Longest Cycle Above Erdős-Gallai Bound. ESA (2022)
Ivan Bliznets, Danil Sagunov
Two Generalizations of Proper Coloring: Hardness and Approximability. COCOON (2022)
Ivan Bliznets, Anton Bukov, Danil Sagunov
Fair Division with Minimal Withheld Information in Social Networks. COCOON (2022)
Ivan Bliznets, Danil Sagunov, Kirill Simonov
Fine-grained Complexity of Partial Minimum Satisfiability. IJCAI (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
Detours in Directed Graphs. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Longest Cycle above Erdős-Gallai Bound. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). MFCS (2022)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Algorithmic Extensions of Dirac's Theorem. SODA (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
Detours in Directed Graphs. STACS (2022)
Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov
Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Comput. Complex. 30 (2) (2021)
Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov
Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Comput. Complex. 30 (2) (2021)
Ivan Bliznets, Danil Sagunov
Lower bounds for the happy coloring problems. Theor. Comput. Sci. 838 (2020)
Ivan Bliznets, Danil Sagunov
Maximizing Happiness in Graphs of Bounded Clique-Width. LATIN (2020)
Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
Diverse Pairs of Matchings. ISAAC (2020)
Ivan Bliznets, Danil Sagunov
Maximizing Happiness in Graphs of Bounded Clique-Width. CoRR (2020)
Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
Diverse Pairs of Matchings. CoRR (2020)
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Algorithmic Extensions of Dirac's Theorem. CoRR (2020)
Fedor V. Fomin, Danil Sagunov, Kirill Simonov
Building large k-cores from sparse graphs. CoRR (2020)
Fedor V. Fomin, Danil Sagunov, Kirill Simonov
Building Large k-Cores from Sparse Graphs. MFCS (2020)
Ivan Bliznets, Danil Sagunov
On Happy Colorings, Cuts, and Structural Parameterizations. WG (2019)
Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov
Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Electron. Colloquium Comput. Complex. 26 (2019)
Ivan Bliznets, Danil Sagunov
Lower Bounds for the Happy Coloring Problems. COCOON (2019)
Ivan Bliznets, Danil Sagunov
On Happy Colorings, Cuts, and Structural Parameterizations. CoRR (2019)
Ivan Bliznets, Danil Sagunov
Lower Bounds for the Happy Coloring Problems. CoRR (2019)
Ivan Bliznets, Danil Sagunov
Solving Target Set Selection with Bounded Thresholds Faster than 2^n. IPEC (2018)
Ivan Bliznets, Danil Sagunov
. CoRR (2018)