Sayan Bandyapadhyay

Cited by

	All	Since 2018
Citations	304	268
h-index	9	9
i10-index	9	9

20142015201620172018201920202021202220232 4 5 17 15 37 36 43 50 83

Public access

View all

13 articles

1 article

available

not available

Based on funding mandates

Co-authors

Kasturi VaradarajanProfessor of Computer Science, University of IowaVerified email at uiowa.edu
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Tanmay InamdarUniversity of BergenVerified email at uib.no
Kirill SimonovPostdoc, TU WienVerified email at ac.tuwien.ac.at
Aritra BanikAssistant professor, NISERVerified email at niser.ac.in
Subhash SuriProfessor of Computer Science, University of California, Santa BarbaraVerified email at cs.ucsb.edu
Shreyas PaiPostdoctoral Researcher, Aalto UniversityVerified email at aalto.fi
Lochet WilliamCNRS, LIRMM, Université de Montpellier, FranceVerified email at lirmm.fr
Anil MaheshwariCarleton UniversityVerified email at scs.carleton.ca
Saeed MehrabiCarleton UniversityVerified email at carleton.ca
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Santanu BhowmickSenior Software Engineer, AppleVerified email at uiowa.edu
Sujoy BhoreIndian Institute of Technology BombayVerified email at iitb.ac.in
Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Hirak SarkarLudwig Scholar at Princeton UniversityVerified email at hms.harvard.edu
Sandip DasProfessor, Indian Statistical InstituteVerified email at isical.ac.in
Sriram PemmarajuProfessor of Computer Science, The University of IowaVerified email at uiowa.edu
Jie XueNew York University ShanghaiVerified email at nyu.edu
Neeraj KumarMeta Platforms IncVerified email at fb.com
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu

Sayan Bandyapadhyay

Assistant Professor, Portland State University

Verified email at uiowa.edu - Homepage

Parameterized Complexity Computational Geometry Approximation Fair clustering


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Voronoi game on graphs S Bandyapadhyay, A Banik, S Das, H Sarkar Theoretical Computer Science 562, 270-282, 2015	45	2015
A Constant Approximation for Colorful k-Center S Bandyapadhyay, T Inamdar, S Pai, K Varadarajan ESA 2019, 2019	41	2019
On Variants of k-means Clustering S Bandyapadhyay, K Varadarajan SoCG 2016, 2016	37	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	33	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	27	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	15	2018
How to find a good explanation for clustering? S Bandyapadhyay, FV Fomin, PA Golovach, W Lochet, N Purohit, ... Artificial Intelligence, 103948, 2023	12	2023
Approximate Clustering via Metric Partitioning S Bandyapadhyay, K Varadarajan ISAAC 2016, 2016	12	2016
Improved approximation bounds for the minimum constraint removal problem S Bandyapadhyay, N Kumar, S Suri, K Varadarajan Computational Geometry, 101650, 2020	11	2020
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation S Bandyapadhyay, S Bhowmick, K Varadarajan SODA 2015, 2015	8	2015
A Variant of the Maximum Weight Independent Set Problem S Bandyapadhyay arXiv preprint arXiv:1409.0173, 2014	8	2014
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	6	2022
On fair covering and hitting problems S Bandyapadhyay, A Banik, S Bhore Graph-Theoretic Concepts in Computer Science: 47th International Workshop …, 2021	6	2021
Capacitated covering problems in geometric spaces S Bandyapadhyay, S Bhowmick, T Inamdar, K Varadarajan Discrete & Computational Geometry 63 (4), 768-798, 2020	6*	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	5	2022
Effectiveness of Local Search for Art Gallery Problems S Bandyapadhyay, AB Roy Workshop on Algorithms and Data Structures, 49-60, 2017	5	2017
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	3	2022
On Perturbation Resilience of Non-Uniform k-Center S Bandyapadhyay Algorithmica, 1-24, 2021	3	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	3	2020
Polynomial Time Algorithms for Bichromatic Problems S Bandyapadhyay, A Banik Conference on Algorithms and Discrete Applied Mathematics, 12-23, 2017	3	2017

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors