Sayan Bandyapadhyay

91 papers A* 15A 5B 14Misc 2Journal 50Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	B	`conf`	A Constant-Factor Approximation for Pairwise Fair k-Center Clustering. IPCO Sayan Bandyapadhyay, Tianzhi Chen, Zachary Friggstad, Mahya Jamshidian
2025	B	`conf`	Approximation and Parameterized Algorithms for Covering with Disks of Two Types of Radii. WADS Sayan Bandyapadhyay, Elijah Mitchell
2025	A	`conf`	Improved FPT Approximation for Sum of Radii Clustering with Mergeable Constraints. APPROX/RANDOM Sayan Bandyapadhyay, Tianzhi Chen
2025	A*	`conf`	PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods. SODA Sayan Bandyapadhyay, Katie Clinch, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2025	A	`conf`	Polynomial-Time Constant-Approximation for Fair Sum-Of-Radii Clustering. ESA Sina Bagheri Nezhad, Sayan Bandyapadhyay, Tianzhi Chen
2025	J	`jnl`	Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering. CoRR Sina Bagheri Nezhad, Sayan Bandyapadhyay, Tianzhi Chen
2025	A*	`conf`	Robust Contraction Decomposition for Minor-Free Graphs and Its Applications. ICALP Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2024	J	`jnl`	A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering. CoRR Sayan Bandyapadhyay, Eden Chlamtác, Yury Makarychev, Ali Vakilian
2024	A*	`conf`	An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching. SoCG Sayan Bandyapadhyay, Jie Xue
2024	J	`jnl`	An O(n log n)-Time Approximation Scheme for Geometric Many-to-Many Matching. CoRR Sayan Bandyapadhyay, Jie Xue
2024	A*	`conf`	Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2024	J	`jnl`	Extraction Theorems With Small Extraction Numbers. CoRR Arjun Agarwal, Sayan Bandyapadhyay
2024	J	`jnl`	Fair Summarization: Bridging Quality and Diversity in Extractive Summaries. CoRR Sina Bagheri Nezhad, Sayan Bandyapadhyay, Ameeta Agrawal
2024	A	`conf`	Geometric Covering via Extraction Theorem. ITCS Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan
2024	J	`jnl`	On coresets for fair clustering in metric and Euclidean spaces and their applications. J. Comput. Syst. Sci. Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
2024	J	`jnl`	Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants. Algorithmica Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
2024	J	`jnl`	Robust Contraction Decomposition for Minor-Free Graphs and its Applications. CoRR Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Dániel Marx, Pranabendu Misra, Daniel Neuen, Saket Saurabh, Prafullkumar Tale, Jie Xue
2024	J	`jnl`	True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. ACM Trans. Algorithms Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2023	B	`conf`	A Parameterized Approximation Scheme for Generalized Partial Vertex Cover. WADS Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
2023	A*	`conf`	Coresets for Clustering in Geometric Intersection Graphs. SoCG Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar
2023	J	`jnl`	Coresets for Clustering in Geometric Intersection Graphs. CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar
2023	J	`jnl`	Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. CoRR Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2023	A*	`conf`	FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. SoCG Sayan Bandyapadhyay, William Lochet, Saket Saurabh
2023	J	`jnl`	FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. CoRR Sayan Bandyapadhyay, William Lochet, Saket Saurabh
2023	J	`jnl`	How to find a good explanation for clustering? Artif. Intell. Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2023	J	`jnl`	Improved Bounds for Metric Capacitated Covering Problems. Algorithmica Sayan Bandyapadhyay
2023	J	`jnl`	Lossy Kernelization of Same-Size Clustering. Theory Comput. Syst. Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2023	A*	`conf`	Minimum-Membership Geometric Set Cover, Revisited. SoCG Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
2023	J	`jnl`	Minimum-Membership Geometric Set Cover, Revisited. CoRR Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue
2023	J	`jnl`	On Colorful Vertex and Edge Cover Problems. Algorithmica Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
2023	J	`jnl`	On Colorful Vertex and Edge Cover Problems. CoRR Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
2023	J	`jnl`	Parameterized Complexity of Feature Selection for Categorical Data Clustering. ACM Trans. Comput. Theory Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2023	B	`conf`	Proportionally Fair Matching with Multiple Groups. WG Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
2023	J	`jnl`	Proportionally Fair Matching with Multiple Groups. CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
2023	B	`conf`	Socially Fair Matching: Exact and Approximation Algorithms. WADS Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov
2022	B	`conf`	FPT Approximation for Fair Minimum-Load Clustering. IPEC Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2022	A*	`conf`	How to Find a Good Explanation for Clustering? AAAI Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2022	Misc	`conf`	Lossy Kernelization of Same-Size Clustering. CSR Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2022	J	`jnl`	Near-optimal clustering in the Theor. Comput. Sci. Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju
2022	J	`jnl`	On Perturbation Resilience of Non-uniform k-Center. Algorithmica Sayan Bandyapadhyay
2022	A*	`conf`	Parameterized Approximation Algorithms for K-center Clustering and Variants. AAAI Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
2022	A*	`conf`	Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. SODA Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2022	A*	`conf`	True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. SoCG Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2021	B	`conf`	Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. ISAAC Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid
2021	J	`jnl`	Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. CoRR Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid
2021	J	`jnl`	FPT Approximation for Fair Minimum-Load Clustering. CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2021	J	`jnl`	Geometric planar networks on bichromatic collinear points. Theor. Comput. Sci. Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
2021	J	`jnl`	How to Find a Good Explanation for Clustering? CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2021	J	`jnl`	Lossy Kernelization of Same-Size Clustering. CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2021	A*	`conf`	On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. ICALP Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
2021	B	`conf`	On Fair Covering and Hitting Problems. WG Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
2021	J	`jnl`	Parameterized Approximation Algorithms for k-Center Clustering and Variants. CoRR Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
2021	B	`conf`	Parameterized Complexity of Feature Selection for Categorical Data Clustering. MFCS Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2021	J	`jnl`	Parameterized Complexity of Feature Selection for Categorical Data Clustering. CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
2021	J	`jnl`	Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs. CoRR Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue
2020	J	`jnl`	Capacitated Covering Problems in Geometric Spaces. Discret. Comput. Geom. Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
2020	—	`conf`	Geometric Planar Networks on Bichromatic Points. CALDAM Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
2020	A	`conf`	Improved Bounds for Metric Capacitated Covering Problems. ESA Sayan Bandyapadhyay
2020	J	`jnl`	Improved Bounds for Metric Capacitated Covering Problems. CoRR Sayan Bandyapadhyay
2020	J	`jnl`	Improved approximation bounds for the minimum constraint removal problem. Comput. Geom. Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan
2020	J	`jnl`	On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. CoRR Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
2020	—	`conf`	On Perturbation Resilience of Non-Uniform k-Center. APPROX-RANDOM Sayan Bandyapadhyay
2020	J	`jnl`	On Perturbation Resilience of Non-Uniform k-Center. CoRR Sayan Bandyapadhyay
2019	A	`conf`	A Constant Approximation for Colorful k-Center. ESA Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi R. Varadarajan
2019	J	`jnl`	A Constant Approximation for Colorful k-Center. CoRR Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi R. Varadarajan
2019	J	`jnl`	Approximating dominating set on intersection graphs of rectangles and L-frames. Comput. Geom. Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
2019	—	`conf`	Constrained Orthogonal Segment Stabbing. CCCG Sayan Bandyapadhyay, Saeed Mehrabi
2019	J	`jnl`	Constrained Orthogonal Segment Stabbing. CoRR Sayan Bandyapadhyay, Saeed Mehrabi
2019	J	`jnl`	Geometric Planar Networks on Bichromatic Points. CoRR Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
2018	J	`jnl`	Approximating Dominating Set on Intersection Graphs of L-frames. CoRR Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
2018	B	`conf`	Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. MFCS Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri
2018	A*	`conf`	Capacitated Covering Problems in Geometric Spaces. SoCG Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
2018	—	`conf`	Improved Approximation Bounds for the Minimum Constraint Removal Problem. APPROX-RANDOM Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan
2018	Misc	`conf`	Near-Optimal Clustering in the k-machine model. ICDCN Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju
2017	J	`jnl`	A Unified Framework for Capacitated Covering Problems in Metric and Geometric Spaces. CoRR Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan
2017	B	`conf`	Effectiveness of Local Search for Art Gallery Problems. WADS Sayan Bandyapadhyay, Aniket Basu Roy
2017	J	`jnl`	Near-Optimal Clustering in the k-machine model. CoRR Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju
2017	—	`conf`	Polynomial Time Algorithms for Bichromatic Problems. CALDAM Sayan Bandyapadhyay, Aritra Banik
2016	B	`conf`	Approximate Clustering via Metric Partitioning. ISAAC Sayan Bandyapadhyay, Kasturi R. Varadarajan
2016	A*	`conf`	On Variants of k-means Clustering. SoCG Sayan Bandyapadhyay, Kasturi R. Varadarajan
2016	J	`jnl`	Polynomial Time Algorithms for Bichromatic Problems. CoRR Sayan Bandyapadhyay, Aritra Banik
2015	J	`jnl`	A Constant Factor Approximation for Orthogonal Order Preserving Layout Adjustment. CoRR Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan
2015	J	`jnl`	Approximate Clustering via Metric Partitioning. CoRR Sayan Bandyapadhyay, Kasturi R. Varadarajan
2015	A*	`conf`	Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation. SODA Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan
2015	J	`jnl`	On Variants of k-means Clustering. CoRR Sayan Bandyapadhyay, Kasturi R. Varadarajan
2015	B	`conf`	On the Approximability of Orthogonal Order Preserving Layout Adjustment. WADS Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan
2015	J	`jnl`	Voronoi game on graphs. Theor. Comput. Sci. Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
2014	J	`jnl`	A Variant of the Maximum Weight Independent Set Problem. CoRR Sayan Bandyapadhyay
2014	J	`jnl`	Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation. CoRR Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan
2014	J	`jnl`	Voronoi Game on Graphs. CoRR Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
2013	B	`conf`	Voronoi Game on Graphs. WALCOM Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar