Sayan Bandyapadhyay
Sayan Bandyapadhyay
Researcher, University of Bergen, Bergen, Norway
Verified email at - Homepage
TitleCited byYear
On Variants of k-means Clustering
S Bandyapadhyay, K Varadarajan
arXiv preprint arXiv:1512.02985, 2015
Voronoi game on graphs
S Bandyapadhyay, A Banik, S Das, H Sarkar
Theoretical Computer Science 562, 270-282, 2015
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
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
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
S Bandyapadhyay, S Bhowmick, K Varadarajan
A Variant of the Maximum Weight Independent Set Problem
S Bandyapadhyay
arXiv preprint arXiv:1409.0173, 2014
Approximate Clustering via Metric Partitioning
S Bandyapadhyay, K Varadarajan
arXiv preprint arXiv:1507.02222, 2015
Effectiveness of Local Search for Art Gallery Problems
S Bandyapadhyay, AB Roy
Workshop on Algorithms and Data Structures, 49-60, 2017
Improved Approximation Bounds for the Minimum Constraint Removal Problem
S Bandyapadhyay, N Kumar, S Suri, K Varadarajan
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2018
Polynomial Time Algorithms for Bichromatic Problems
S Bandyapadhyay, A Banik
Conference on Algorithms and Discrete Applied Mathematics, 12-23, 2017
Capacitated Covering Problems in Geometric Spaces
S Bandyapadhyay, S Bhowmick, T Inamdar, K Varadarajan
34th International Symposium on Computational Geometry (SoCG 2018), 2018
A Constant Approximation for Colorful k-Center
S Bandyapadhyay, T Inamdar, S Pai, K Varadarajan
arXiv preprint arXiv:1907.08906, 2019
Constrained Orthogonal Segment Stabbing
S Bandyapadhyay, S Mehrabi
arXiv preprint arXiv:1904.13369, 2019
Digging Deeper into Clustering and Covering Problems
S Bandyapadhyay
The University of Iowa, 2019
A Constant Approximation for Streaming k-means
S Bandyapadhyay
On the Approximability of Orthogonal Order Preserving Layout Adjustment
S Bandyapadhyay, S Bhowmick, K Varadarajan
Workshop on Algorithms and Data Structures, 54-65, 2015
The system can't perform the operation now. Try again later.
Articles 1–16