Sayan Bandyapadhyay

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 71

Top Topics

Constant Factor Approximation

Top Venues

Publications

Sayan Bandyapadhyay, Jie Xue
An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching. SoCG (2024)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA (2024)
Sayan Bandyapadhyay, Jie Xue
An O(n log n)-Time Approximation Scheme for Geometric Many-to-Many Matching. CoRR (2024)
Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan
Geometric Covering via Extraction Theorem. ITCS (2024)
Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants. Algorithmica 86 (8) (2024)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. ACM Trans. Algorithms 20 (3) (2024)
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
On coresets for fair clustering in metric and Euclidean spaces and their applications. J. Comput. Syst. Sci. 142 (2024)
Sayan Bandyapadhyay, Eden Chlamtác, Yury Makarychev, Ali Vakilian
A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering. CoRR (2024)
Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
A Parameterized Approximation Scheme for Generalized Partial Vertex Cover. WADS (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
Proportionally Fair Matching with Multiple Groups. WG (2023)
Sayan Bandyapadhyay
Improved Bounds for Metric Capacitated Covering Problems. Algorithmica 85 (7) (2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
Minimum-Membership Geometric Set Cover, Revisited. CoRR (2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. CoRR (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar
Coresets for Clustering in Geometric Intersection Graphs. SoCG (2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
Minimum-Membership Geometric Set Cover, Revisited. SoCG (2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. SoCG (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov
Socially Fair Matching: Exact and Approximation Algorithms. WADS (2023)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
On Colorful Vertex and Edge Cover Problems. CoRR (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
Proportionally Fair Matching with Multiple Groups. CoRR (2023)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
On Colorful Vertex and Edge Cover Problems. Algorithmica 85 (12) (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to find a good explanation for clustering? Artif. Intell. 322 (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar
Coresets for Clustering in Geometric Intersection Graphs. CoRR (2023)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. CoRR (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
Lossy Kernelization of Same-Size Clustering. Theory Comput. Syst. 67 (4) (2023)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. SoCG (2022)
Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju
-machine model. Theor. Comput. Sci. 899 (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
FPT Approximation for Fair Minimum-Load Clustering. IPEC (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to Find a Good Explanation for Clustering? AAAI (2022)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. SODA (2022)
Sayan Bandyapadhyay
On Perturbation Resilience of Non-uniform k-Center. Algorithmica 84 (1) (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Siminov
Lossy Kernelization of Same-Size Clustering. CSR (2022)
Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
Parameterized Approximation Algorithms for K-center Clustering and Variants. AAAI (2022)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Geometric planar networks on bichromatic collinear points. Theor. Comput. Sci. 895 (2021)
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs. CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
FPT Approximation for Fair Minimum-Load Clustering. CoRR (2021)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
On Fair Covering and Hitting Problems. WG (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. ICALP (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
Parameterized Complexity of Feature Selection for Categorical Data Clustering. MFCS (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to Find a Good Explanation for Clustering? CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
Lossy Kernelization of Same-Size Clustering. CoRR (2021)
Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. ISAAC (2021)
Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. CoRR (2021)
Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
Parameterized Approximation Algorithms for k-Center Clustering and Variants. CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
Parameterized Complexity of Feature Selection for Categorical Data Clustering. CoRR (2021)
Sayan Bandyapadhyay
On Perturbation Resilience of Non-Uniform k-Center. APPROX-RANDOM (2020)
Sayan Bandyapadhyay
Improved Bounds for Metric Capacitated Covering Problems. ESA (2020)
Sayan Bandyapadhyay
On Perturbation Resilience of Non-Uniform k-Center. CoRR (2020)
Sayan Bandyapadhyay
Improved Bounds for Metric Capacitated Covering Problems. CoRR (2020)
Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan
Improved approximation bounds for the minimum constraint removal problem. Comput. Geom. 90 (2020)
Sayan Bandyapadhyay, Aniket Basu Roy
Approximate Covering with Lower and Upper Bounds via LP Rounding. CoRR (2020)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Geometric Planar Networks on Bichromatic Points. CALDAM (2020)
Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
Capacitated Covering Problems in Geometric Spaces. Discret. Comput. Geom. 63 (4) (2020)
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. CoRR (2020)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Geometric Planar Networks on Bichromatic Points. CoRR (2019)
Sayan Bandyapadhyay, Saeed Mehrabi
Constrained Orthogonal Segment Stabbing. CoRR (2019)
Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
Approximating dominating set on intersection graphs of rectangles and L-frames. Comput. Geom. 82 (2019)
Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi R. Varadarajan
A Constant Approximation for Colorful k-Center. ESA (2019)
Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi R. Varadarajan
A Constant Approximation for Colorful k-Center. CoRR (2019)
Sayan Bandyapadhyay, Saeed Mehrabi
Constrained Orthogonal Segment Stabbing. CCCG (2019)
Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. MFCS (2018)
Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
Capacitated Covering Problems in Geometric Spaces. SoCG (2018)
Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju
Near-Optimal Clustering in the k-machine model. ICDCN (2018)
Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
Approximating Dominating Set on Intersection Graphs of L-frames. CoRR (2018)
Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan
Improved Approximation Bounds for the Minimum Constraint Removal Problem. APPROX-RANDOM (2018)
Sayan Bandyapadhyay, Aritra Banik
Polynomial Time Algorithms for Bichromatic Problems. CALDAM (2017)
Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju
Near-Optimal Clustering in the k-machine model. CoRR (2017)
Sayan Bandyapadhyay, Aniket Basu Roy
Effectiveness of Local Search for Art Gallery Problems. WADS (2017)
Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
A Unified Framework for Capacitated Covering Problems in Metric and Geometric Spaces. CoRR (2017)
Sayan Bandyapadhyay, Kasturi R. Varadarajan
Approximate Clustering via Metric Partitioning. ISAAC (2016)
Sayan Bandyapadhyay, Aritra Banik
Polynomial Time Algorithms for Bichromatic Problems. CoRR (2016)
Sayan Bandyapadhyay, Kasturi R. Varadarajan
On Variants of k-means Clustering. SoCG (2016)
Sayan Bandyapadhyay, Kasturi R. Varadarajan
On Variants of k-means Clustering. CoRR (2015)
Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
Voronoi game on graphs. Theor. Comput. Sci. 562 (2015)
Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan
A Constant Factor Approximation for Orthogonal Order Preserving Layout Adjustment. CoRR (2015)
Sayan Bandyapadhyay, Kasturi R. Varadarajan
Approximate Clustering via Metric Partitioning. CoRR (2015)
Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan
On the Approximability of Orthogonal Order Preserving Layout Adjustment. WADS (2015)
Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation. SODA (2015)
Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation. CoRR (2014)
Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
Voronoi Game on Graphs. CoRR (2014)
Sayan Bandyapadhyay
A Variant of the Maximum Weight Independent Set Problem. CoRR (2014)
Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
Voronoi Game on Graphs. WALCOM (2013)