research
∙
08/18/2021
Worst-Case Efficient Dynamic Geometric Independent Set
We consider the problem of maintaining an approximate maximum independen...
share
research
∙
07/16/2020
Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics
We consider the generalized k-server problem on uniform metrics. We stud...
research
∙
07/16/2020
Dynamic Geometric Independent Set
We present fully dynamic approximation algorithms for the Maximum Indepe...
research
∙
07/03/2020
Sublinear Explicit Incremental Planar Voronoi Diagrams
A data structure is presented that explicitly maintains the graph of a V...
research
∙
03/04/2020
The Online Min-Sum Set Cover Problem
We consider the online Min-Sum Set Cover (MSSC), a natural and intriguin...
research
∙
08/02/2019
Competitive Online Search Trees on Trees
We consider the design of adaptive data structures for searching element...
research
∙
05/07/2019
External Memory Planar Point Location with Fast Updates
We study dynamic planar point location in the External Memory Model or D...
research
∙
03/08/2019