Danish Kashaev

Full Name

D. Kashaev

Email

Danish.Kashaev@cwi.nl

Phone

+31 20 592 4386

Room

M237

Department(s)

Networks and Optimization

Function(s)

PhD student

Danish Kashaev

Borst, S., Dadush, D., Huiberts, S., & Kashaev, D. (2024). A nearly optimal randomized algorithm for explorable heap selection. Mathematical Programming, 2024, 1–22. doi:10.1007/s10107-024-02145-5
Kashaev, D., & Schäfer, G. (2023). Round and bipartize for vertex cover approximation. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (pp. 20:1–20:20). doi:10.4230/LIPIcs.APPROX/RANDOM.2023.20
Borst, S., Dadush, D., Huiberts, S., & Kashaev, D. (2023). A nearly optimal randomized algorithm for explorable heap selection. In Proceedings of the 24th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2023 (pp. 29–43). doi:10.1007/978-3-031-32726-1_3

Optimization for and with Machine Learning (OPTIMAL)