Articoli con mandati relativi all'accesso pubblico - Sayan BandyapadhyayUlteriori informazioni
Disponibili pubblicamente: 18
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
Mandati: European Commission, Research Council of Norway
How to find a good explanation for clustering?
S Bandyapadhyay, FV Fomin, PA Golovach, W Lochet, N Purohit, ...
Artificial Intelligence 322, 103948, 2023
Mandati: German Research Foundation, European Commission, Research Council of Norway
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
Mandati: US National Science Foundation, Natural Sciences and Engineering Research …
Improved approximation bounds for the minimum constraint removal problem
S Bandyapadhyay, N Kumar, S Suri, K Varadarajan
Computational Geometry, 101650, 2020
Mandati: US National Science Foundation
On Colorful Vertex and Edge Cover Problems
S Bandyapadhyay, A Banik, S Bhore
Algorithmica 85 (12), 3816-3827, 2023
Mandati: European Commission
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
Mandati: Natural Sciences and Engineering Research Council of Canada, European Commission
Capacitated covering problems in geometric spaces
S Bandyapadhyay, S Bhowmick, T Inamdar, K Varadarajan
Discrete & Computational Geometry 63 (4), 768-798, 2020
Mandati: US National Science Foundation
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
Mandati: US National Science Foundation, European Commission
Geometric planar networks on bichromatic collinear points
S Bandyapadhyay, A Banik, S Bhore, M Nöllenburg
Theoretical Computer Science 895, 124-136, 2021
Mandati: Austrian Science Fund, European Commission
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
Mandati: European Commission, Research Council of Norway
Parameterized complexity of feature selection for categorical data clustering
S Bandyapadhyay, FV Fomin, PA Golovach, K Simonov
ACM Transactions on Computation Theory 15 (3-4), 1-24, 2023
Mandati: German Research Foundation, Research Council of Norway
On Perturbation Resilience of Non-Uniform k-Center
S Bandyapadhyay
Algorithmica, 1-24, 2021
Mandati: European Commission, Research Council of Norway
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable
S Bandyapadhyay, W Lochet, D Lokshtanov, S Saurabh, J Xue
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
Mandati: US National Science Foundation, European Commission
Lossy kernelization of same-size clustering
S Bandyapadhyay, FV Fomin, PA Golovach, N Purohit, K Siminov
International Computer Science Symposium in Russia, 96-114, 2022
Mandati: German Research Foundation, European Commission, Research Council of Norway
Improved bounds for metric capacitated covering problems
S Bandyapadhyay
Algorithmica 85 (7), 1825-1849, 2023
Mandati: European Commission
Geometric covering via extraction theorem
S Bandyapadhyay, A Maheshwari, S Roy, M Smid, K Varadarajan
15th Innovations in Theoretical Computer Science Conference (ITCS 2024), 7 …, 2024
Mandati: US National Science Foundation, Natural Sciences and Engineering Research …
PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods
S Bandyapadhyay, K Clinch, W Lochet, D Lokshtanov, S Saurabh, J Xue
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
Mandati: European Commission
Socially Fair Matching: Exact and Approximation Algorithms
S Bandyapadhyay, F Fomin, T Inamdar, F Panolan, K Simonov
Algorithms and Data Structures Symposium, 79-92, 2023
Mandati: European Commission, Research Council of Norway
Le informazioni sulla pubblicazione e sul finanziamento vengono stabilite automaticamente da un software