25 citations · 25 across the 9 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2024
New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
Aritra Banik, Sayani Das, Anil Maheshwari +6
In the Minimum Consistent Subset (MCS) problem, we are presented with a connected simple undirected graph , consisting of a vertex set of size and an edge set .…
cs.CG2020
Geometric Systems of Unbiased Representatives
Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore +1
Let be a set of points in , a bicoloring of and $\Oo$ a family of geometric objects (that is, intervals, boxes, balls, etc). An object from $\Oo$ is calle…
cs.CG2017
Network Optimization on Partitioned Pairs of Points
Esther M. Arkin, Aritra Banik, Paz Carmi +5
Given pairs of points, , in some metric space, we study the problem of two-coloring the points within each pa…