Danil Sagunov

According to our database, Danil Sagunov authored at least 29 papers between 2018 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Partial Minimum Satisfiability: Fine-Grained Analysis.

Ivan Bliznets, Danil Sagunov, Kirill Simonov

J. Artif. Intell. Res., 2026

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective.

Fedor V. Fomin, Petr A. Golovach, Nikola Jedlicková, Jan Kratochvíl, Danil Sagunov, Kirill Simonov

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Discounted Cuts: A Stackelberg Approach to Network Disruption.

Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Danil Sagunov

Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

EFX and PO Allocation Exists for Two Types of Goods.

Vladimir Davidiuk, Yuriy Dementiev, Artur Ignatiev, Danil Sagunov

Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

Structural Approach to Guiding a Present-Biased Agent.

Tatiana Belova, Yuriy Dementiev, Artur Ignatiev, Danil Sagunov

Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025

Edge Clique Partition and Cover Beyond Independence.

Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective.

Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov

CoRR, 2024

Tree Containment Above Minimum Degree is FPT.

Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Solving Target Set Selection with Bounded Thresholds Faster than 2ⁿ.

Ivan Bliznets, Danil Sagunov

Algorithmica, February, 2023

Building large <i>k</i>-cores from sparse graphs.

Fedor V. Fomin, Danil Sagunov, Kirill Simonov

J. Comput. Syst. Sci., 2023

Turán's Theorem Through Algorithmic Lens.

Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Approximating Long Cycle Above Dirac's Guarantee.

Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Enumeration of Minimal Tropical Connected Sets.

Ivan Bliznets, Danil Sagunov, Eugene Tagin

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022

Detours in Directed Graphs.

Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Algorithmic Extensions of Dirac's Theorem.

Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk).

Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Fine-grained Complexity of Partial Minimum Satisfiability.

Ivan Bliznets, Danil Sagunov, Kirill Simonov

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Longest Cycle Above Erdős-Gallai Bound.

Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Two Generalizations of Proper Coloring: Hardness and Approximability.

Ivan Bliznets, Danil Sagunov

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

Fair Division with Minimal Withheld Information in Social Networks.

Ivan Bliznets, Anton Bukov, Danil Sagunov

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

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

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

2020

Building Large k-Cores from Sparse Graphs.

Fedor V. Fomin, Danil Sagunov, Kirill Simonov

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Maximizing Happiness in Graphs of Bounded Clique-Width.

Ivan Bliznets, Danil Sagunov

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Diverse Pairs of Matchings.

Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

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

On Happy Colorings, Cuts, and Structural Parameterizations.

Ivan Bliznets, Danil Sagunov

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Lower Bounds for the Happy Coloring Problems.

Ivan Bliznets, Danil Sagunov

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

Solving Target Set Selection with Bounded Thresholds Faster than 2^n.

Ivan Bliznets, Danil Sagunov

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018