Abstract Let P={C1, C2,..., Cn} be a set of color classes, where each color class Ci consists
of a set of points. In this paper, we address a family of covering problems, in which one is …

Let π be a family of graphs. In the classical π-Vertex Deletion problem, given a graph G and
a positive integer k, the objective is to check whether there exists a subset S of at most k …

Abstract The Chamberlin-Courant voting rule is an important multiwinner voting rule.
Although NP-hard to compute on general profiles, it is known to be polynomially solvable on …

Let U be a set of colored objects, where the color of an object is an integer between 1 and n.
Let P={C 1,…, C n} be the partition of U into color classes, ie, the set C i consists of all …

Set Cover is one of the well-known classical NP-hard problems. We study the conflict-free
version of the Set Cover problem. Here we have a universe UU, a family FF of subsets of UU …

The input for the Geometric Coverage problem consists of a pair\varSigma=(P, R) Σ=(P, R),
where P is a set of points in R^ d R d and RR is a set of subsets of P defined by the …

We study the computational complexity of finding fair allocations of indivisible goods in the
setting where a social network on the agents is given. Notions of fairness in this context are …

Frèchet distance is an important geometric measure that captures the distance between two
curves or more generally point sets. In this paper, we consider a natural variant of Fréchet …

We study several variations of line segment covering problem with axis-parallel unit squares
in the plane. Given a set S of n line segments, the objective is to find the minimum number of …

We study several variations of line segment covering problem with axis-parallel unit squares
in the plane. Given a set S of n line segments, the objective is to find the minimum number of …