research
∙
05/18/2023
On k-means for segments and polylines
We study the problem of k-means clustering in the space of straight-line...
share
research
∙
10/28/2021
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
A (unit) disk graph is the intersection graph of closed (unit) disks in ...
research
∙
02/11/2019
Geometric Multicut
We study the following separation problem: Given a collection of colored...
research
∙
12/13/2017
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs
A (unit) disk graph is the intersection graph of closed (unit) disks in ...
research
∙
10/02/2017
On the Parameterized Complexity of Red-Blue Points Separation
We study the following geometric separation problem: Given a set R of ...
research
∙
10/01/2017
