A vertex of a plane digraph is bimodal if all its incoming edges (and he...
We study the α-Fixed Cardinality Graph Partitioning
(α-FCGP) problem, th...
In the Minimum Bisection problem, input is a graph G and the goal is to
...
We consider the following problem about dispersing points. Given a set o...
Selection of a group of representatives satisfying certain fairness
cons...
Clustering problems such as k-Median, and k-Means, are motivated from
ap...
Designing coresets–small-space sketches of the data preserving cost of t...
The study of fair algorithms has become mainstream in machine learning a...
Clustering with outliers is one of the most fundamental problems in Comp...
The problem of packing of equal disks (or circles) into a rectangle is a...
In this paper we initiate a systematic study of exact algorithms for
wel...
In the Non-Uniform k-Center problem, a generalization of the famous
k-ce...
De Berg et al. in [SICOMP 2020] gave an algorithmic framework for
subexp...
Intersection graphs of planar geometric objects such as intervals, disks...
In this paper, we consider the colorful k-center problem, which is a
gen...
This paper presents fast, distributed, O(1)-approximation algorithms for...
Various O( n) approximations are known for the Set Cover problem, where
...
We study a generalization of the Set Cover problem called the Partial
Se...
The clustering problem, in its many variants, has numerous applications ...