research
∙
08/29/2022
Configuration Balancing for Stochastic Requests
The configuration balancing problem with stochastic requests generalizes...
share
research
∙
12/10/2021
Robustification of Online Graph Exploration Methods
Exploring unknown environments is a fundamental task in many domains, e....
research
∙
11/10/2020
Speed-Robust Scheduling
The speed-robust scheduling problem is a two-stage problem where given m...
research
∙
07/16/2020
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time
Knapsack problems are among the most fundamental problems in optimizatio...
research
∙
12/23/2019
Optimally handling commitment issues in online throughput maximization
We consider a fundamental online scheduling problem in which jobs with p...
research
∙
11/20/2018
