research
∙
08/13/2023
Exploration of graphs with excluded minors
We study the online graph exploration problem proposed by Kalyanasundara...
share
research
∙
05/02/2023
Incremental Maximization via Continuization
We consider the problem of finding an incremental solution to a cardinal...
research
∙
10/25/2022
An Improved Algorithm for Open Online Dial-a-Ride
We consider the open online dial-a-ride problem, where transportation re...
research
∙
10/25/2022
Tight analysis of lazy: an improved algorithm for open online dial-a-ride
In the open online dial-a-ride problem, a single server has to carry tra...
research
∙
08/30/2022
On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension
We consider the Sparse Hitting Set (Sparse-HS) problem, where we are giv...
research
∙
06/28/2021
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint
We consider the problem of maximizing a fractionally subadditive functio...
research
∙
11/02/2020
Unified greedy approximability beyond submodular maximization
We consider classes of objective functions of cardinality constrained ma...
research
∙
05/31/2020
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles
We present a data structure that in a dynamic graph of treedepth at most...
research
∙
02/25/2020
Improved Lower Bound for Competitive Graph Exploration
We give an improved lower bound of 10/3 on the competitive ratio for the...
research
∙
11/04/2019
An Exponential Lower Bound for Zadeh's pivot rule
The question whether the Simplex Algorithm admits an efficient pivot rul...
research
∙
05/25/2019
Evacuating Two Robots from a Disk: A Second Cut
We present an improved algorithm for the problem of evacuating two robot...
research
∙
02/19/2019
Travelling on Graphs with Small Highway Dimension
We study the Travelling Salesperson (TSP) and the Steiner Tree problem (...
research
∙
01/14/2019
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line
The online Dial-a-Ride problem is a fundamental online problem in a metr...
research
∙
05/09/2018
