5 citations · 17 across the 15 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DS2022★ 2 cited
Clustering What Matters: Optimal Approximation for Clustering with Outliers
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh +1
Clustering with outliers is one of the most fundamental problems in Computer Science. Given a set of points and two integers and , the clustering with outliers aims…
cs.GT2022
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…
cs.CG2022
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 (…