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 2024 · cs.DSShow all

2 papers · 2 filters

cs.DS2024

Robust Contraction Decomposition for Minor-Free Graphs and its Applications

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov +6

We prove a robust contraction decomposition theorem for $H$ -minor-free graphs, which states that given an $H$ -minor-free graph $G$ and an integer $p$ , one can partition in polynomi…

cs.DS2024

A Polynomial-Time Approximation for Pairwise Fair $k$ -Median Clustering

Sayan Bandyapadhyay, Eden Chlamtáč, Zachary Friggstad +3

In this work, we study pairwise fair clustering with $ℓ \geq 2$ groups, where for every cluster $C$ and every group $i \in [ℓ]$ , the number of points in $C$ from group $i$ mus…

Robust Contraction Decomposition for Minor-Free Graphs and its Applications

A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering

A Polynomial-Time Approximation for Pairwise Fair $k$ -Median Clustering