Danil Sagunov

Orcid: 0000-0003-3327-9768

According to our database1, Danil Sagunov authored at least 23 papers between 2018 and 2024.

Collaborative distances:

Timeline

2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
7
5
3
2
1
1
1
2
4
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Approximating Long Cycle Above Dirac's Guarantee.
Algorithmica, August, 2024

Diverse Pairs of Matchings.
Algorithmica, June, 2024

Fair division with minimal withheld information in social networks.
Theor. Comput. Sci., 2024

Longest Cycle above Erdős-Gallai Bound.
SIAM J. Discret. Math., 2024

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

Tree Containment Above Minimum Degree is FPT.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Detours in directed graphs.
J. Comput. Syst. Sci., November, 2023

Solving Target Set Selection with Bounded Thresholds Faster than 2<sup>n</sup>.
Algorithmica, February, 2023

Building large <i>k</i>-cores from sparse graphs.
J. Comput. Syst. Sci., 2023

Turán's Theorem Through Algorithmic Lens.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Enumeration of Minimal Tropical Connected Sets.
Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022
Algorithmic Extensions of Dirac's Theorem.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk).
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Fine-grained Complexity of Partial Minimum Satisfiability.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Two Generalizations of Proper Coloring: Hardness and Approximability.
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.
Comput. Complex., 2021

Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs.
Comput. Complex., 2021

2020
Lower bounds for the happy coloring problems.
Theor. Comput. Sci., 2020

Building Large k-Cores from Sparse Graphs.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Maximizing Happiness in Graphs of Bounded Clique-Width.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs.
Electron. Colloquium Comput. Complex., 2019

On Happy Colorings, Cuts, and Structural Parameterizations.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

2018
Solving Target Set Selection with Bounded Thresholds Faster than 2^n.
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018


  Loading...