Danil Sagunov
Orcid: 0000-0003-3327-9768
According to our database1,
Danil Sagunov
authored at least 23 papers
between 2018 and 2024.
Collaborative distances:
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 OtherLinks
On csauthors.net:
Bibliography
2024
Theor. Comput. Sci., 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
2023
Algorithmica, February, 2023
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023
Proceedings of the Algorithms and Complexity - 13th International Conference, 2023
2022
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
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
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
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020
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
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019
2018
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018