Danil Sagunov - RankMe

50 papers A* 7A 3B 7C 1Misc 3Journal 29

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Discounted Cuts: A Stackelberg Approach to Network Disruption. AAAI Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Danil Sagunov
2026	A*	`conf`	EFX and PO Allocation Exists for Two Types of Goods. AAAI Vladimir Davidiuk, Yuriy Dementiev, Artur Ignatiev, Danil Sagunov
2026	J	`jnl`	EFX and PO Allocation Exists for Two Types of Goods. CoRR Vladimir Davidiuk, Yuriy Dementiev, Artur Ignatiev, Danil Sagunov
2026	A*	`conf`	Structural Approach to Guiding a Present-Biased Agent. AAAI Tatiana Belova, Yuriy Dementiev, Artur Ignatiev, Danil Sagunov
2026	J	`jnl`	Structural Approach to Guiding a Present-Biased Agent. CoRR Tatiana Belova, Yuriy Dementiev, Artur Ignatiev, Danil Sagunov
2026	J	`jnl`	Tree Containment above Minimum Degree Is FPT. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2025	J	`jnl`	Discounted Cuts: A Stackelberg Approach to Network Disruption. CoRR Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Danil Sagunov
2025	A	`conf`	Edge Clique Partition and Cover Beyond Independence. ESA Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2025	J	`jnl`	Edge Clique Partition and Cover Beyond Independence. CoRR Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2024	J	`jnl`	Approximating Long Cycle Above Dirac's Guarantee. Algorithmica Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2024	J	`jnl`	Diverse Pairs of Matchings. Algorithmica Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
2024	J	`jnl`	Fair division with minimal withheld information in social networks. Theor. Comput. Sci. Ivan Bliznets, Anton Bukov, Danil Sagunov
2024	J	`jnl`	Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective. CoRR Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2024	J	`jnl`	Longest Cycle above Erdős-Gallai Bound. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2024	A*	`conf`	Tree Containment Above Minimum Degree is FPT. SODA Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023	A*	`conf`	Approximating Long Cycle Above Dirac's Guarantee. ICALP Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023	J	`jnl`	Approximating Long Cycle Above Dirac's Guarantee. CoRR Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023	J	`jnl`	Building large J. Comput. Syst. Sci. Fedor V. Fomin, Danil Sagunov, Kirill Simonov
2023	J	`jnl`	Detours in directed graphs. J. Comput. Syst. Sci. Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov
2023	C	`conf`	Enumeration of Minimal Tropical Connected Sets. CIAC Ivan Bliznets, Danil Sagunov, Eugene Tagin
2023	J	`jnl`	Solving Target Set Selection with Bounded Thresholds Faster than 2 Algorithmica Ivan Bliznets, Danil Sagunov
2023	J	`jnl`	Tree Containment Above Minimum Degree is FPT. CoRR Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023	B	`conf`	Turán's Theorem Through Algorithmic Lens. WG Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2023	J	`jnl`	Turán's Theorem Through Algorithmic Lens. CoRR Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2022	A*	`conf`	Algorithmic Extensions of Dirac's Theorem. SODA Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2022	A	`conf`	Detours in Directed Graphs. STACS Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
2022	J	`jnl`	Detours in Directed Graphs. CoRR Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
2022	Misc	`conf`	Fair Division with Minimal Withheld Information in Social Networks. COCOON Ivan Bliznets, Anton Bukov, Danil Sagunov
2022	A*	`conf`	Fine-grained Complexity of Partial Minimum Satisfiability. IJCAI Ivan Bliznets, Danil Sagunov, Kirill Simonov
2022	B	`conf`	Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). MFCS Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2022	A	`conf`	Longest Cycle Above Erdős-Gallai Bound. ESA Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2022	J	`jnl`	Longest Cycle above Erdős-Gallai Bound. CoRR Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2022	Misc	`conf`	Two Generalizations of Proper Coloring: Hardness and Approximability. COCOON Ivan Bliznets, Danil Sagunov
2021	J	`jnl`	Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Comput. Complex. Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov
2021	J	`jnl`	Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Comput. Complex. Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov
2020	J	`jnl`	Algorithmic Extensions of Dirac's Theorem. CoRR Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
2020	B	`conf`	Building Large k-Cores from Sparse Graphs. MFCS Fedor V. Fomin, Danil Sagunov, Kirill Simonov
2020	J	`jnl`	Building large k-cores from sparse graphs. CoRR Fedor V. Fomin, Danil Sagunov, Kirill Simonov
2020	B	`conf`	Diverse Pairs of Matchings. ISAAC Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
2020	J	`jnl`	Diverse Pairs of Matchings. CoRR Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov
2020	J	`jnl`	Lower bounds for the happy coloring problems. Theor. Comput. Sci. Ivan Bliznets, Danil Sagunov
2020	B	`conf`	Maximizing Happiness in Graphs of Bounded Clique-Width. LATIN Ivan Bliznets, Danil Sagunov
2020	J	`jnl`	Maximizing Happiness in Graphs of Bounded Clique-Width. CoRR Ivan Bliznets, Danil Sagunov
2019	J	`jnl`	Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Electron. Colloquium Comput. Complex. Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov
2019	Misc	`conf`	Lower Bounds for the Happy Coloring Problems. COCOON Ivan Bliznets, Danil Sagunov
2019	J	`jnl`	Lower Bounds for the Happy Coloring Problems. CoRR Ivan Bliznets, Danil Sagunov
2019	B	`conf`	On Happy Colorings, Cuts, and Structural Parameterizations. WG Ivan Bliznets, Danil Sagunov
2019	J	`jnl`	On Happy Colorings, Cuts, and Structural Parameterizations. CoRR Ivan Bliznets, Danil Sagunov
2018	J	`jnl`	Solving Target Set Selection with Bounded Thresholds Faster than 2 CoRR Ivan Bliznets, Danil Sagunov
2018	B	`conf`	Solving Target Set Selection with Bounded Thresholds Faster than 2^n. IPEC Ivan Bliznets, Danil Sagunov