Sayan Bandyapadhyay

According to our database, Sayan Bandyapadhyay authored at least 42 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

An O(n log n)-Time Approximation Scheme for Geometric Many-to-Many Matching.

Sayan Bandyapadhyay, Jie Xue

CoRR, 2024

Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable.

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Geometric Covering via Extraction Theorem.

Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

On Colorful Vertex and Edge Cover Problems.

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore

Algorithmica, December, 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., September, 2023

Lossy Kernelization of Same-Size Clustering.

Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov

Theory Comput. Syst., August, 2023

Improved Bounds for Metric Capacitated Covering Problems.

Sayan Bandyapadhyay

Algorithmica, July, 2023

Proportionally Fair Matching with Multiple Groups.

Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

A Parameterized Approximation Scheme for Generalized Partial Vertex Cover.

Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Socially Fair Matching: Exact and Approximation Algorithms.

Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii.

Sayan Bandyapadhyay, William Lochet, Saket Saurabh

Proceedings of the 39th International Symposium on Computational Geometry, 2023

Minimum-Membership Geometric Set Cover, Revisited.

Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue

Proceedings of the 39th International Symposium on Computational Geometry, 2023

Coresets for Clustering in Geometric Intersection Graphs.

Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Near-optimal clustering in the <i>k</i>-machine model.

Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju

Theor. Comput. Sci., 2022

On Perturbation Resilience of Non-uniform k-Center.

Sayan Bandyapadhyay

Algorithmica, 2022

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs.

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

FPT Approximation for Fair Minimum-Load Clustering.

Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs.

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue

Proceedings of the 38th International Symposium on Computational Geometry, 2022

Parameterized Approximation Algorithms for K-center Clustering and Variants.

Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Geometric planar networks on bichromatic collinear points.

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg

Theor. Comput. Sci., 2021

On Fair Covering and Hitting Problems.

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Parameterized Complexity of Feature Selection for Categorical Data Clustering.

Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

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

Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications.

Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Capacitated Covering Problems in Geometric Spaces.

Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan

Discret. Comput. Geom., 2020

Improved approximation bounds for the minimum constraint removal problem.

Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan

Comput. Geom., 2020

Geometric Planar Networks on Bichromatic Points.

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Approximating dominating set on intersection graphs of rectangles and L-frames.

Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri

Comput. Geom., 2019

A Constant Approximation for Colorful k-Center.

Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi R. Varadarajan

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Constrained Orthogonal Segment Stabbing.

Sayan Bandyapadhyay, Saeed Mehrabi

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Approximating Dominating Set on Intersection Graphs of L-frames.

Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri

CoRR, 2018

Near-Optimal Clustering in the k-machine model.

Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017

A Unified Framework for Capacitated Covering Problems in Metric and Geometric Spaces.

Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan

CoRR, 2017

Effectiveness of Local Search for Art Gallery Problems.

Sayan Bandyapadhyay, Aniket Basu Roy

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Polynomial Time Algorithms for Bichromatic Problems.

Sayan Bandyapadhyay, Aritra Banik

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Approximate Clustering via Metric Partitioning.

Sayan Bandyapadhyay, Kasturi R. Varadarajan

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

On Variants of k-means Clustering.

Sayan Bandyapadhyay, Kasturi R. Varadarajan

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Voronoi game on graphs.

Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar

Theor. Comput. Sci., 2015

A Constant Factor Approximation for Orthogonal Order Preserving Layout Adjustment.

Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan

CoRR, 2015

On the Approximability of Orthogonal Order Preserving Layout Adjustment.

Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation.

Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

A Variant of the Maximum Weight Independent Set Problem.

Sayan Bandyapadhyay

CoRR, 2014