112 citations · 203 across the 17 of their papers we have counts for
22 papers
Fault Tolerance in Euclidean Committee Selection
Chinmay Sonar, Subhash Suri, Jie Xue
In the committee selection problem, the goal is to choose a subset of size from a set of candidates that collectively gives the best representation to a set of voters. We c…
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…
The Maximum Exposure Problem
Neeraj Kumar, Stavros Sintos, Subhash Suri
Given a set of points and axis-aligned rectangles in the plane, a point is called \emph{exposed} if it lies outside all rectangles in . In…
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane
Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh +1
Given two points s and t in the plane and a set of obstacles defined by closed curves, what is the minimum number of obstacles touched by a path connecting s and t? This is a funda…