2 citations · 3 across the 5 of their papers we have counts for
10 papers
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space
Chinmay Sonar, Subhash Suri, Jie Xue
We consider multiwinner elections in Euclidean space using the minimax Chamberlin-Courant rule. In this setting, voters and candidates are embedded in a -dimensional Euclidean s…
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles
Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh +2
Suppose we are given a pair of points and a set of geometric objects in the plane, called obstacles. We show that in polynomial time one can construct an auxiliary (…
Dynamic Geometric Set Cover, Revisited
Timothy M. Chan, Qizheng He, Subhash Suri +1
Geometric set cover is a classical problem in computational geometry, which has been extensively studied in the past. In the dynamic version of the problem, points and ranges may b…
Dynamic geometric set cover and hitting set
Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri +2
We investigate dynamic versions of geometric set cover and hitting set where points and ranges may be inserted or deleted, and we want to efficiently maintain an (approximately) op…
Range closest-pair search in higher dimensions
Timothy M. Chan, Saladi Rahul, Jie Xue
Range closest-pair (RCP) search is a range-search variant of the classical closest-pair problem, which aims to store a given set of points into some space-efficient data struct…
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points
Haitao Wang, Jie Xue
We consider a bichromatic two-center problem for pairs of points. Given a set of pairs of points in the plane, for every pair, we want to assign a red color to one point an…