Segui
Sayan Bandyapadhyay
Sayan Bandyapadhyay
Assistant Professor, Portland State University
Email verificata su uiowa.edu - Home page
Titolo
Citata da
Citata da
Anno
A Constant Approximation for Colorful k-Center
S Bandyapadhyay, T Inamdar, S Pai, K Varadarajan
ESA 2019, 2019
532019
Voronoi game on graphs
S Bandyapadhyay, A Banik, S Das, H Sarkar
Theoretical Computer Science 562, 270-282, 2015
522015
On coresets for fair clustering in metric and euclidean spaces and their applications
S Bandyapadhyay, FV Fomin, K Simonov
Journal of Computer and System Sciences 142, 103506, 2024
512024
On Variants of k-means Clustering
S Bandyapadhyay, K Varadarajan
SoCG 2016, 2016
432016
How to find a good explanation for clustering?
S Bandyapadhyay, FV Fomin, PA Golovach, W Lochet, N Purohit, ...
Artificial Intelligence 322, 103948, 2023
382023
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
312018
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
182018
Approximate Clustering via Metric Partitioning
S Bandyapadhyay, K Varadarajan
ISAAC 2016, 2016
182016
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
172023
Improved approximation bounds for the minimum constraint removal problem
S Bandyapadhyay, N Kumar, S Suri, K Varadarajan
Computational Geometry, 101650, 2020
142020
A Variant of the Maximum Weight Independent Set Problem
S Bandyapadhyay
arXiv preprint arXiv:1409.0173, 2014
112014
On Colorful Vertex and Edge Cover Problems
S Bandyapadhyay, A Banik, S Bhore
Algorithmica 85 (12), 3816-3827, 2023
9*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
92022
True contraction decomposition and almost ETH-tight bipartization for unit-disk graphs
S Bandyapadhyay, W Lochet, D Lokshtanov, S Saurabh, J Xue
ACM Transactions on Algorithms, 2022
92022
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
S Bandyapadhyay, S Bhowmick, K Varadarajan
SODA 2015, 2015
92015
Capacitated covering problems in geometric spaces
S Bandyapadhyay, S Bhowmick, T Inamdar, K Varadarajan
Discrete & Computational Geometry 63 (4), 768-798, 2020
7*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
62022
Geometric planar networks on bichromatic collinear points
S Bandyapadhyay, A Banik, S Bhore, M Nöllenburg
Theoretical Computer Science 895, 124-136, 2021
6*2021
Proportionally fair matching with multiple groups
S Bandyapadhyay, FV Fomin, T Inamdar, K Simonov
International Workshop on Graph-Theoretic Concepts in Computer Science, 1-15, 2023
52023
FPT Approximation for Fair Minimum-Load Clustering
S Bandyapadhyay, FV Fomin, PA Golovach, N Purohit, K Simonov
arXiv preprint arXiv:2107.09481, 2021
52021
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20