It is not difficult to think of applications that can be modelled as gra...
The B^ϵ-tree [Brodal and Fagerberg 2003] is a simple I/O-efficient
exter...
In the orthogonal range reporting problem we must pre-process a set P of...
A grounded 1-bend string graph is an intersection graph of a set of poly...
In this paper we present new data structures for two extensively studied...
Under the word RAM model, we design three data structures that can be
co...
We present the first succinct data structure for ordinal trees that supp...
We present a number of new results about range searching for colored (or...
In this paper we study the four-dimensional dominance range reporting pr...
For any ϵ∈ (0,1), a (1+ϵ)-approximate range mode query
asks for the posi...
In this paper we study two geometric data structure problems in the spec...
In this paper we describe a fully-dynamic data structure for the planar ...
An optimal binary search tree for an access sequence on elements is a st...
In this work, we present a collection of new results on two fundamental
...
We introduce the first index that can be built in o(n) time for a text o...