We study the online graph exploration problem proposed by Kalyanasundara...
We consider the problem of finding an incremental solution to a
cardinal...
We consider the open online dial-a-ride problem, where transportation
re...
In the open online dial-a-ride problem, a single server has to carry
tra...
We consider the Sparse Hitting Set (Sparse-HS) problem, where we are giv...
We consider the problem of maximizing a fractionally subadditive functio...
We consider classes of objective functions of cardinality constrained
ma...
We present a data structure that in a dynamic graph of treedepth at most...
We give an improved lower bound of 10/3 on the competitive ratio for the...
The question whether the Simplex Algorithm admits an efficient pivot rul...
We present an improved algorithm for the problem of evacuating two robot...
We study the Travelling Salesperson (TSP) and the Steiner Tree problem (...
The online Dial-a-Ride problem is a fundamental online problem in a metr...
We study the problem of deterministically exploring an undirected and
in...