Follow
Sayan Bandyapadhyay
Sayan Bandyapadhyay
Researcher, University of Bergen, Bergen, Norway
Verified email at uiowa.edu - Homepage
Title
Cited by
Cited by
Year
Voronoi game on graphs
S Bandyapadhyay, A Banik, S Das, H Sarkar
Theoretical Computer Science 562, 270-282, 2015
372015
On Variants of k-means Clustering
S Bandyapadhyay, K Varadarajan
SoCG 2016, 2016
332016
Approximating dominating set on intersection graphs of rectangles and L-frames
S Bandyapadhyay, A Maheshwari, S Mehrabi, S Suri
43rd International Symposium on Mathematical Foundations of Computer Science …, 2018
272018
A Constant Approximation for Colorful k-Center
S Bandyapadhyay, T Inamdar, S Pai, K Varadarajan
ESA 2019, 2019
262019
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications
S Bandyapadhyay, FV Fomin, K Simonov
arXiv preprint arXiv:2007.10137, 2020
162020
Near-Optimal Clustering in the k-machine model
S Bandyapadhyay, T Inamdar, S Pai, SV Pemmaraju
Proceedings of the 19th International Conference on Distributed Computing …, 2018
152018
Improved approximation bounds for the minimum constraint removal problem
S Bandyapadhyay, N Kumar, S Suri, K Varadarajan
Computational Geometry, 101650, 2020
102020
Approximate Clustering via Metric Partitioning
S Bandyapadhyay, K Varadarajan
ISAAC 2016, 2016
92016
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
S Bandyapadhyay, S Bhowmick, K Varadarajan
SODA 2015, 2015
72015
A Variant of the Maximum Weight Independent Set Problem
S Bandyapadhyay
arXiv preprint arXiv:1409.0173, 2014
72014
Capacitated covering problems in geometric spaces
S Bandyapadhyay, S Bhowmick, T Inamdar, K Varadarajan
Discrete & Computational Geometry 63 (4), 768-798, 2020
5*2020
Effectiveness of Local Search for Art Gallery Problems
S Bandyapadhyay, AB Roy
Workshop on Algorithms and Data Structures, 49-60, 2017
52017
On Perturbation Resilience of Non-Uniform k-Center
S Bandyapadhyay
Algorithmica, 1-24, 2021
32021
Geometric Planar Networks on Bichromatic Points
S Bandyapadhyay, A Banik, S Bhore, M Nöllenburg
Conference on Algorithms and Discrete Applied Mathematics, 79-91, 2020
32020
How to Find a Good Explanation for Clustering?
S Bandyapadhyay, F Fomin, PA Golovach, W Lochet, N Purohit, ...
Proceedings of the AAAI Conference on Artificial Intelligence 36 (4), 3904-3912, 2022
22022
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs
S Bandyapadhyay, W Lochet, D Lokshtanov, S Saurabh, J Xue
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
22022
Constrained Orthogonal Segment Stabbing
S Bandyapadhyay, S Mehrabi
CCCG 2019, 2019
22019
Polynomial Time Algorithms for Bichromatic Problems
S Bandyapadhyay, A Banik
Conference on Algorithms and Discrete Applied Mathematics, 12-23, 2017
22017
FPT Approximation for Fair Minimum-Load Clustering
S Bandyapadhyay, FV Fomin, PA Golovach, N Purohit, K Simonov
arXiv preprint arXiv:2107.09481, 2021
12021
On Fair Covering and Hitting Problems
S Bandyapadhyay, A Banik, S Bhore
International Workshop on Graph-Theoretic Concepts in Computer Science, 39-51, 2021
12021
The system can't perform the operation now. Try again later.
Articles 1–20