Given an interval graph and integer k, we consider the problem of finding a subgraph of size k with a maximum number of induced edges, called densest k-subgraph problem in interv...
We consider several variants of a basic resource replication problem in this paper, and propose new approximation results for them. These problems are of fundamental interest in th...
We study the following separation problem: Given n connected curves and two points s and t in the plane, compute the minimum number of curves one needs to retain so that any path ...