Sayan Bandyapadhyay

activity

20142026

most citedApproximating Dominating Set on Intersection Graphs of Rectangles and L-frames

10 citations · 33 across the 24 of their papers we have counts for

collaborators

Showing 2021 · cs.CGShow all

2 papers · 2 filters

cs.CG2021★ 1 cited

Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane

Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid

Given two sets $S$ and $T$ of points in the plane, of total size $n$ , a {many-to-many} matching between $S$ and $T$ is a set of pairs $(p, q)$ such that $p \in S$ , $q \in T$ and for e…

cs.CG2021★ 1 cited

FPT Approximation for Fair Minimum-Load Clustering

Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach +2

In this paper, we consider the Minimum-Load $k$ -Clustering/Facility Location (MLkC) problem where we are given a set $P$ of $n$ points in a metric space that we have to cluster and…