Sayan Bandyapadhyay
Sayan Bandyapadhyay
Researcher, University of Bergen, Bergen, Norway
Verified email at uiowa.edu - Homepage
Title
Cited by
Cited by
Year
On Variants of k-means Clustering
S Bandyapadhyay, K Varadarajan
SoCG 2016, 2016
242016
Voronoi game on graphs
S Bandyapadhyay, A Banik, S Das, H Sarkar
Theoretical Computer Science 562, 270-282, 2015
232015
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
192018
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
82018
Approximate Clustering via Metric Partitioning
S Bandyapadhyay, K Varadarajan
ISAAC 2016, 2016
82016
Improved approximation bounds for the minimum constraint removal problem
S Bandyapadhyay, N Kumar, S Suri, K Varadarajan
Computational Geometry, 101650, 2020
62020
A Constant Approximation for Colorful k-Center
S Bandyapadhyay, T Inamdar, S Pai, K Varadarajan
ESA 2019, 2019
62019
A Variant of the Maximum Weight Independent Set Problem
S Bandyapadhyay
arXiv preprint arXiv:1409.0173, 2014
62014
Capacitated covering problems in geometric spaces
S Bandyapadhyay, S Bhowmick, T Inamdar, K Varadarajan
Discrete & Computational Geometry 63 (4), 768-798, 2020
5*2020
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
S Bandyapadhyay, S Bhowmick, K Varadarajan
SODA 2015, 2015
52015
Effectiveness of Local Search for Art Gallery Problems
S Bandyapadhyay, AB Roy
Workshop on Algorithms and Data Structures, 49-60, 2017
42017
Polynomial Time Algorithms for Bichromatic Problems
S Bandyapadhyay, A Banik
Conference on Algorithms and Discrete Applied Mathematics, 12-23, 2017
22017
Improved Bounds for Metric Capacitated Covering Problems
S Bandyapadhyay
arXiv preprint arXiv:2006.12454, 2020
12020
Constrained Orthogonal Segment Stabbing
S Bandyapadhyay, S Mehrabi
CCCG 2019, 2019
12019
Approximate Covering with Lower and Upper Bounds via LP Rounding
S Bandyapadhyay, AB Roy
arXiv preprint arXiv:2007.11476, 2020
2020
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
2020
On Perturbation Resilience of Non-Uniform -Center
S Bandyapadhyay
arXiv preprint arXiv:2004.12633, 2020
2020
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
2020
Digging Deeper into Clustering and Covering Problems
S Bandyapadhyay
The University of Iowa, 2019
2019
A Constant Approximation for Streaming k-means
S Bandyapadhyay
2016
The system can't perform the operation now. Try again later.
Articles 1–20