research
∙
08/14/2023
Fault Tolerance in Euclidean Committee Selection
In the committee selection problem, the goal is to choose a subset of si...
share
research
∙
05/26/2022
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space
We consider multiwinner elections in Euclidean space using the minimax C...
research
∙
03/15/2022
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles
Suppose we are given a pair of points s, t and a set S of n geometric ob...
research
∙
11/01/2021
Dynamic Geometric Set Cover, Revisited
Geometric set cover is a classical problem in computational geometry, wh...
research
∙
02/06/2021
The Maximum Exposure Problem
Given a set of points P and axis-aligned rectangles ℛ in the plane, a po...
research
∙
11/29/2020
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane
Given two points s and t in the plane and a set of obstacles defined by ...
research
∙
02/29/2020
Dynamic geometric set cover and hitting set
We investigate dynamic versions of geometric set cover and hitting set w...
research
∙
03/16/2018
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames
We consider the Minimum Dominating Set (MDS) problem on the intersection...
research
∙
03/16/2018
