research
∙
12/10/2021
Robustification of Online Graph Exploration Methods
Exploring unknown environments is a fundamental task in many domains, e....
share
research
∙
11/10/2020
Speed-Robust Scheduling
The speed-robust scheduling problem is a two-stage problem where given m...
research
∙
10/27/2020
On Minimum Generalized Manhattan Connections
We consider minimum-cardinality Manhattan connected sets with arbitrary ...
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
∙
03/12/2020
Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics
We consider the problem of computing a Steiner tree of minimum cost unde...
research
∙
01/09/2020
