2 citations · 3 across the 7 of their papers we have counts for
5 papers · 1 filter
Top-k Stabbing Interval Queries
Waseem Akram, Sanjeev Saxena
We investigate a weighted variant of the interval stabbing problem, where the goal is to design an efficient data structure for a given set of weighted intervals such…
Data Structures for Range Sorted Consecutive Occurrence Queries
Waseem Akram, Takuya Mieno
The string indexing problem is a fundamental computational problem with numerous applications, including information retrieval and bioinformatics. It aims to efficiently solve the…
Maximizing Weighted Dominance in the Plane
Waseem Akram, Sanjeev Saxena
Let P be a set of n weighted points, Q be a set of m unweighted points in the plane, and k a non-negative integer. We consider the problem of computing a subset wit…
Dominance for Containment Problems
Waseem Akram, Sanjeev Saxena
In a containment problem, the goal is to preprocess a set of geometric objects so that, given a geometric query object, we can report all the objects containing the query object. W…
Sorted Range Reporting and Range Minima Queries
Waseem Akram, Sanjeev Saxena
Given an array A[1: n] of n elements drawn from an ordered set, the sorted range selection problem is to build a data structure that can be used to answer the following type of que…