Danish Kashaev

13 papers A* 1A 1B 2Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A* conf
Selfish, Local and Online Scheduling via Vector Fitting.
SODA
Danish Kashaev
2025 J jnl
A nearly optimal randomized algorithm for explorable heap selection.
Math. Program.
Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
2025 J jnl
Improved Online Load Balancing in the Two-Norm.
CoRR
Sander Borst, Danish Kashaev
2025 B conf
Online Matching on 3-Uniform Hypergraphs.
IPCO
Sander Borst, Danish Kashaev, Zhuan Khye Koh
2025 J jnl
Price of Anarchy for Congestion and Scheduling Games via Vector Fitting.
CoRR
Danish Kashaev
2024 J jnl
Online Matching on 3-Uniform Hypergraphs.
CoRR
Sander Borst, Danish Kashaev, Zhuan Khye Koh
2023 B conf
A Nearly Optimal Randomized Algorithm for Explorable Heap Selection.
IPCO
Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
2023 J jnl
A simple optimal contention resolution scheme for uniform matroids.
Theor. Comput. Sci.
Danish Kashaev, Richard Santiago
2023 A conf
Round and Bipartize for Vertex Cover Approximation.
APPROX/RANDOM
Danish Kashaev, Guido Schäfer
2022 J jnl
A Round and Bipartize Approximation Algorithm for Vertex Cover.
CoRR
Danish Kashaev, Guido Schäfer
2022 J jnl
A nearly optimal randomized algorithm for explorable heap selection.
CoRR
Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
2021 — conf
A Simple Optimal Contention Resolution Scheme for Uniform Matroids.
ICTCS
Richard Santiago, Danish Kashaev
2021 J jnl
An Optimal Monotone Contention Resolution Scheme for Uniform and Partition Matroids.
CoRR
Danish Kashaev, Richard Santiago