Approximation algorithms for stochastic online matching with reusable resources.

Primal-dual analysis for online interval scheduling problems.

Approximation algorithms for scheduling C-benevolent jobs on weighted machines.

A bi-criteria multiple-choice secretary problem.

Online C-benevolent job scheduling on multiple machines.