In the committee selection problem, the goal is to choose a subset of si...
We revisit a natural variant of geometric set cover, called
minimum-memb...
We investigate a fundamental vertex-deletion problem called (Induced)
Su...
Clustering with outliers is one of the most fundamental problems in Comp...
We initiate a systematic study of approximation schemes for fundamental
...
We consider multiwinner elections in Euclidean space using the minimax
C...
Short-term traffic flow prediction is a vital branch of the Intelligent
...
Suppose we are given a pair of points s, t and a set S of n geometric
ob...
We design the first subexponential-time (parameterized) algorithms for
s...
Geometric set cover is a classical problem in computational geometry, wh...
We investigate dynamic versions of geometric set cover and hitting set w...
Range closest-pair (RCP) search is a range-search variant of the classic...
We consider a bichromatic two-center problem for pairs of points. Given ...
We revisit a classical graph-theoretic problem, the single-source
shorte...
The range closest-pair (RCP) problem is the range-search version of the
...
In this paper, we consider a range-search variant of the closest-pair
pr...
Given a dataset S of points in R^2, the range closest-pair (RCP)
problem...