-
Chapter and Conference Paper
Local Routing in Convex Subdivisions
In various wireless networking settings, node locations determine a network’s topology, allowing the network to be modelled by a geometric graph drawn in the plane. Without any additional information, local ge...
-
Chapter and Conference Paper
Top-k Color Queries on Tree Paths
We present a data structure for the following problem: Given a tree \(\mathcal{T}\) , with each of its nodes assigned a color in a...
-
Chapter and Conference Paper
Range Majority in Constant Time and Linear Space
Given an array A of size n, we consider the problem of answering range majority queries: given a query range [i..j] where 1 ≤ i ≤ j ≤ n, return the majority element of the subarray A[i..j] if it exists. We descri...