In the committee selection problem, the goal is to choose a subset of si...
We consider multiwinner elections in Euclidean space using the minimax
C...
Suppose we are given a pair of points s, t and a set S of n geometric
ob...
Geometric set cover is a classical problem in computational geometry, wh...
Given a set of points P and axis-aligned rectangles ℛ in the
plane, a po...
Given two points s and t in the plane and a set of obstacles defined by
...
We investigate dynamic versions of geometric set cover and hitting set w...
We consider the Minimum Dominating Set (MDS) problem on the intersection...
We consider the Dominating Set (DS) problem on the intersection graphs o...