Sayan Bandyapadhyay
Sayan Bandyapadhyay
Assistant Professor, Portland State University
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
Voronoi game on graphs
S Bandyapadhyay, A Banik, S Das, H Sarkar
Theoretical Computer Science 562, 270-282, 2015
A Constant Approximation for Colorful k-Center
S Bandyapadhyay, T Inamdar, S Pai, K Varadarajan
ESA 2019, 2019
On Variants of k-means Clustering
S Bandyapadhyay, K Varadarajan
SoCG 2016, 2016
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
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
How to find a good explanation for clustering?
S Bandyapadhyay, FV Fomin, PA Golovach, W Lochet, N Purohit, ...
Artificial Intelligence, 103948, 2023
Approximate Clustering via Metric Partitioning
S Bandyapadhyay, K Varadarajan
ISAAC 2016, 2016
Improved approximation bounds for the minimum constraint removal problem
S Bandyapadhyay, N Kumar, S Suri, K Varadarajan
Computational Geometry, 101650, 2020
A Variant of the Maximum Weight Independent Set Problem
S Bandyapadhyay
arXiv preprint arXiv:1409.0173, 2014
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
S Bandyapadhyay, S Bhowmick, K Varadarajan
SODA 2015, 2015
On Colorful Vertex and Edge Cover Problems
S Bandyapadhyay, A Banik, S Bhore
Algorithmica 85 (12), 3816-3827, 2023
Parameterized Approximation Algorithms for K-center Clustering and Variants
S Bandyapadhyay, Z Friggstad, R Mousavi
Proceedings of the AAAI Conference on Artificial Intelligence 36 (4), 3895-3903, 2022
Capacitated covering problems in geometric spaces
S Bandyapadhyay, S Bhowmick, T Inamdar, K Varadarajan
Discrete & Computational Geometry 63 (4), 768-798, 2020
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
Effectiveness of Local Search for Art Gallery Problems
S Bandyapadhyay, AB Roy
Workshop on Algorithms and Data Structures, 49-60, 2017
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
S Bandyapadhyay, W Lochet, S Saurabh
arXiv preprint arXiv:2303.07923, 2023
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs
S Bandyapadhyay, W Lochet, D Lokshtanov, S Saurabh, J Xue
38th International Symposium on Computational Geometry (SoCG 2022), 2022
On Perturbation Resilience of Non-Uniform k-Center
S Bandyapadhyay
Algorithmica, 1-24, 2021
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
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20