An Optimal Monotone Contention Resolution Scheme for Uniform and Partition Matroids. - Danish Kashaev; Richard Santiago (CoRR, 2021)

A Round and Bipartize Approximation Algorithm for Vertex Cover. - Danish Kashaev; Guido Schäfer (CoRR, 2022)

Round and Bipartize for Vertex Cover Approximation. - Danish Kashaev; Guido Schäfer (APPROX/RANDOM, 2023)

A simple optimal contention resolution scheme for uniform matroids. - Danish Kashaev; Richard Santiago (Theor. Comput. Sci., 2023)

Online Matching on 3-Uniform Hypergraphs. - Sander Borst; Danish Kashaev; Zhuan Khye Koh (IPCO, 2025)

A nearly optimal randomized algorithm for explorable heap selection. - Sander Borst; Daniel Dadush; Sophie Huiberts; Danish Kashaev (Math. Program., 2025)

Price of Anarchy for Congestion and Scheduling Games via Vector Fitting. - Danish Kashaev (CoRR, 2025)