Danish Kashaev

I am a final year PhD student in the Networks and Optimization research group at Centrum Wiskunde & Informatica, Amsterdam. Previously, I did a master’s degree in mathematics at ETH Zurich and a bachelor’s degree in mathematics at the University of Geneva.

My main research interests are in theoretical computer science and combinatorial optimization. Some topics that I have worked on are approximation algorithms, online algorithms and algorithmic game theory.

My CV can be found here and my email addresses are:

• danich dot 1997 at gmail dot com
• danish dot kashaev at cwi dot nl

Here are my LinkedIn and Google Scholar pages.

Publications

• Improved Online Load Balancing in the Two-Norm
  Sander Borst, Danish Kashaev
  ArXiv version

• Selfish, Local and Online Scheduling via Vector Fitting
  Danish Kashaev
  SODA 2026
  ArXiv version
  Slides

• Online Matching on 3-Uniform Hypergraphs
  Sander Borst, Danish Kashaev, Zhuan Khye Koh
  IPCO 2025
  ArXiv version
  Conference version
  Slides

• A Nearly Optimal Randomized Algorithm for Explorable Heap Selection
  Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
  IPCO 2023, Mathematical Programming 2024
  ArXiv version
  Journal version

• Round and Bipartize for Vertex Cover Approximation
  Danish Kashaev, Guido Schäfer
  APPROX 2023
  ArXiv version
  Conference version
  Slides

• A Simple Optimal Contention Resolution Scheme for Uniform Matroids
  Danish Kashaev, Richard Santiago
  Theoretical Computer Science 2023
  ArXiv version
  Journal version
  Slides

Theses

• Master’s thesis
  An Optimal Monotone Contention Resolution Scheme for Uniform and Partition Matroids
  ETH Zurich, Institute for Operations Research (IFOR)
  pdf version

Teaching

• Teaching Assistant
  Mathematical Optimization, 2021
  ETH Zurich, Institute for Operations Research (IFOR)

• Teaching Assistant
  Algorithmic Game Theory, 2023 and 2025
  University of Amsterdam, Institute for Logic, Language and Computation (ILLC)