A Variant of the Maximum Weight Independent Set Problem. - Sayan Bandyapadhyay (CoRR, 2014)

Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation. - Sayan Bandyapadhyay; Santanu Bhowmick; Kasturi R. Varadarajan (SODA, 2015)

On the Approximability of Orthogonal Order Preserving Layout Adjustment. - Sayan Bandyapadhyay; Santanu Bhowmick; Kasturi R. Varadarajan (WADS, 2015)

A Constant Factor Approximation for Orthogonal Order Preserving Layout Adjustment. - Sayan Bandyapadhyay; Santanu Bhowmick; Kasturi R. Varadarajan (CoRR, 2015)

Voronoi game on graphs. - Sayan Bandyapadhyay; Aritra Banik; Sandip Das 001; Hirak Sarkar (Theor. Comput. Sci., 2015)

On Variants of k-means Clustering. - Sayan Bandyapadhyay; Kasturi R. Varadarajan (SoCG, 2016)

Approximate Clustering via Metric Partitioning. - Sayan Bandyapadhyay; Kasturi R. Varadarajan (ISAAC, 2016)

Polynomial Time Algorithms for Bichromatic Problems. - Sayan Bandyapadhyay; Aritra Banik (CALDAM, 2017)

Effectiveness of Local Search for Art Gallery Problems. - Sayan Bandyapadhyay; Aniket Basu Roy (WADS, 2017)

A Unified Framework for Capacitated Covering Problems in Metric and Geometric Spaces. - Sayan Bandyapadhyay; Santanu Bhowmick; Tanmay Inamdar 002; Kasturi R. Varadarajan (CoRR, 2017)

Near-Optimal Clustering in the k-machine model. - Sayan Bandyapadhyay; Tanmay Inamdar 002; Shreyas Pai; Sriram V. Pemmaraju (ICDCN, 2018)

Approximating Dominating Set on Intersection Graphs of L-frames. - Sayan Bandyapadhyay; Anil Maheshwari; Saeed Mehrabi 001; Subhash Suri (CoRR, 2018)

Constrained Orthogonal Segment Stabbing. - Sayan Bandyapadhyay; Saeed Mehrabi 001 (CCCG, 2019)

A Constant Approximation for Colorful k-Center. - Sayan Bandyapadhyay; Tanmay Inamdar 002; Shreyas Pai; Kasturi R. Varadarajan (ESA, 2019)

Approximating dominating set on intersection graphs of rectangles and L-frames. - Sayan Bandyapadhyay; Anil Maheshwari; Saeed Mehrabi 001; Subhash Suri (Comput. Geom., 2019)

Geometric Planar Networks on Bichromatic Points. - Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore; Martin Nöllenburg (CALDAM, 2020)

Improved approximation bounds for the minimum constraint removal problem. - Sayan Bandyapadhyay; Neeraj Kumar 004; Subhash Suri; Kasturi R. Varadarajan (Comput. Geom., 2020)

Capacitated Covering Problems in Geometric Spaces. - Sayan Bandyapadhyay; Santanu Bhowmick; Tanmay Inamdar 002; Kasturi R. Varadarajan (Discret. Comput. Geom., 2020)

Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. - Sayan Bandyapadhyay; Anil Maheshwari; Michiel Smid (ISAAC, 2021)

On Fair Covering and Hitting Problems. - Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore (WG, 2021)

Geometric planar networks on bichromatic collinear points. - Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore; Martin Nöllenburg (Theor. Comput. Sci., 2021)

Parameterized Approximation Algorithms for K-center Clustering and Variants. - Sayan Bandyapadhyay; Zachary Friggstad; Ramin Mousavi (AAAI, 2022)

FPT Approximation for Fair Minimum-Load Clustering. - Sayan Bandyapadhyay; Fedor V. Fomin; Petr A. Golovach; Nidhi Purohit; Kirill Simonov (IPEC, 2022)

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (SODA, 2022)

On Perturbation Resilience of Non-uniform k-Center. - Sayan Bandyapadhyay (Algorithmica, 2022)

Near-optimal clustering in the k-machine model. - Sayan Bandyapadhyay; Tanmay Inamdar 002; Shreyas Pai; Sriram V. Pemmaraju (Theor. Comput. Sci., 2022)

Coresets for Clustering in Geometric Intersection Graphs. - Sayan Bandyapadhyay; Fedor V. Fomin; Tanmay Inamdar 002 (SoCG, 2023)

Minimum-Membership Geometric Set Cover, Revisited. - Sayan Bandyapadhyay; William Lochet; Saket Saurabh 001; Jie Xue 003 (SoCG, 2023)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. - Sayan Bandyapadhyay; William Lochet; Saket Saurabh 001 (SoCG, 2023)

Socially Fair Matching: Exact and Approximation Algorithms. - Sayan Bandyapadhyay; Fedor V. Fomin; Tanmay Inamdar 002; Fahad Panolan; Kirill Simonov (WADS, 2023)

A Parameterized Approximation Scheme for Generalized Partial Vertex Cover. - Sayan Bandyapadhyay; Zachary Friggstad; Ramin Mousavi (WADS, 2023)

Proportionally Fair Matching with Multiple Groups. - Sayan Bandyapadhyay; Fedor V. Fomin; Tanmay Inamdar 002; Kirill Simonov (WG, 2023)

Parameterized Complexity of Feature Selection for Categorical Data Clustering. - Sayan Bandyapadhyay; Fedor V. Fomin; Petr A. Golovach; Kirill Simonov (ACM Trans. Comput. Theory, 2023)

Improved Bounds for Metric Capacitated Covering Problems. - Sayan Bandyapadhyay (Algorithmica, 2023)

Lossy Kernelization of Same-Size Clustering. - Sayan Bandyapadhyay; Fedor V. Fomin; Petr A. Golovach; Nidhi Purohit; Kirill Simonov (Theory Comput. Syst., 2023)

How to find a good explanation for clustering? - Sayan Bandyapadhyay; Fedor V. Fomin; Petr A. Golovach; William Lochet; Nidhi Purohit; Kirill Simonov (Artif. Intell., 2023)

On Colorful Vertex and Edge Cover Problems. - Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore (Algorithmica, 2023)

An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching. - Sayan Bandyapadhyay; Jie Xue 003 (SoCG, 2024)

Geometric Covering via Extraction Theorem. - Sayan Bandyapadhyay; Anil Maheshwari; Sasanka Roy; Michiel Smid; Kasturi R. Varadarajan (ITCS, 2024)

Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (SODA, 2024)

A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering. - Sayan Bandyapadhyay; Eden Chlamtác; Yury Makarychev; Ali Vakilian (CoRR, 2024)

Fair Summarization: Bridging Quality and Diversity in Extractive Summaries. - Sina Bagheri Nezhad; Sayan Bandyapadhyay; Ameeta Agrawal (CoRR, 2024)

Extraction Theorems With Small Extraction Numbers. - Arjun Agarwal; Sayan Bandyapadhyay (CoRR, 2024)

On coresets for fair clustering in metric and Euclidean spaces and their applications. - Sayan Bandyapadhyay; Fedor V. Fomin; Kirill Simonov (J. Comput. Syst. Sci., 2024)

True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (ACM Trans. Algorithms, 2024)

Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants. - Sayan Bandyapadhyay; Zachary Friggstad; Ramin Mousavi (Algorithmica, 2024)

Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. - Sayan Bandyapadhyay; William Lochet; Daniel Lokshtanov; Dániel Marx; Pranabendu Misra; Daniel Neuen; Saket Saurabh 001; Prafullkumar Tale; Jie Xue 003 (ICALP, 2025)

A Constant-Factor Approximation for Pairwise Fair k-Center Clustering. - Sayan Bandyapadhyay; Tianzhi Chen; Zachary Friggstad; Mahya Jamshidian (IPCO, 2025)

PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods. - Sayan Bandyapadhyay; Katie Clinch; William Lochet; Daniel Lokshtanov; Saket Saurabh 001; Jie Xue 003 (SODA, 2025)

Approximation and Parameterized Algorithms for Covering with Disks of Two Types of Radii. - Sayan Bandyapadhyay; Elijah Mitchell (WADS, 2025)

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering. - Sina Bagheri Nezhad; Sayan Bandyapadhyay; Tianzhi Chen (CoRR, 2025)