No. Title Author Year
1 True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs Bandyapadhyay, Sayan et al. 2022
2 Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane Bandyapadhyay, Sayan et al. 2021
3 On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications Bandyapadhyay, Sayan et al. 2021
4 Parameterized Complexity of Feature Selection for Categorical Data Clustering Bandyapadhyay, Sayan et al. 2021
5 Improved Bounds for Metric Capacitated Covering Problems Bandyapadhyay, Sayan 2020
6 On Perturbation Resilience of Non-Uniform k-Center Bandyapadhyay, Sayan 2020
7 A Constant Approximation for Colorful k-Center Bandyapadhyay, Sayan et al. 2019
8 Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames Bandyapadhyay, Sayan et al. 2018
9 Capacitated Covering Problems in Geometric Spaces Bandyapadhyay, Sayan et al. 2018
10 Improved Approximation Bounds for the Minimum Constraint Removal Problem Bandyapadhyay, Sayan et al. 2018
11 Approximate Clustering via Metric Partitioning Bandyapadhyay, Sayan et al. 2016
12 On Variants of k-means Clustering Bandyapadhyay, Sayan et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 12


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI