Research Interest : Broadly speaking Theoretical Computer Science. More specifically on the following topics:
Algorithms and Hardness (Approximation and Fixed-Parameter)
Computational geometry
Combinatorial optimization
Clustering and facility location problems
Publications:
Improved fixed parameter bounds for Min-Sum-Radii and Diameters k-clustering and their fair variants
Sandip Banerjee, Yair Bartal, Lee-Ad Gotlieb, Alon Hovav (AAAI 2025)
Novel properties of hierarchical probabilistic partitions and their algorithmic applications
Sandip Banerjee, Yair Bartal, Lee-Ad Gotlieb, Alon Hovav (FOCS 2024)
www.computer.org/csdl/proceedings-article/focs/2024/167400b724/22gEXKaKdaM
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook,
Ameet Gadekar, Kamyar Khodamoradi, Daniel Marx, Roohani Joachim Spoerhase (ICALP 2024)
Parameterized Approximation Schemes for Clustering with General Norm Objectives
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook,
Ameet Gadekar, Kamyar Khodamoradi, Daniel Marx, Roohani Joachim Spoerhase (FOCS 2023)
https://arxiv.org/abs/2304.03146
Maximum-Width Rainbow-Bisecting Empty Annulus.
Sang Won Bae, Sandip Banerjee, Arpita Baral, Priya Ranjan Sinha Mahapatra, Sang Duk Yoon
(Computational Geometry Theory and Applications)
www.sciencedirect.com/science/article/abs/pii/S0925772124000105
How Does Fairness Affect the Complexity of Gerrymandering?
Sandip Banerjee, Rajesh Chitnis, Abhirukh Lahiri (AAMAS 2023)
dl.acm.org/doi/10.5555/3545946.3599106
Min-Sum Clustering with Outliers.
Sandip Banerjee, Rafail Ostrovsky, Yuval Rabani
International Conference on Approximation Algorithm for Combinatorial Optimization Problems (APPROX 2021)
New Algorithm for Maximum-Width Rainbow-Bisecting Empty Annulus.
Sandip Banerjee, Arpita Baral, Priya Ranjan Sinha Mahapatra
European Workshop on Computational Geometry (EUROCG 2021)
eurocg21.spbu.ru/wp-content/uploads/2021/04/proceedings.pdf
Color Spanning Objects: Algorithms and Hardness Results.
Sandip Banerjee, Neeldhara Mishra, Subhas C. Nandy
Discrete Applied Mathematics
www.sciencedirect.com/science/article/pii/S0166218X18300738
Algorithms and Hardness Results on Liar's Dominating Set and K-tuple Dominating Set.
Sandip Banerjee, Sujoy Bhore
International Workshop on Combinatorial Algorithms (IWOCA 2019)
link.springer.com/chapter/10.1007/978-3-030-25005-8_5
Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets.
Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis
Latin American Theoretical Informatics (LATIN 2018)
link.springer.com/chapter/10.1007/978-3-319-77404-6_7
On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation.
Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari
Transactions on Computational Science.
https://link.springer.com/chapter/10.1007/978-3-642-41905-8_3
On Representing a Simple Polygon Perceivable to a Blind Person.
Sandip Banerjee, Bhargab B Bhattacharya, Binay Bhattacharya, Arindam Biswas, Sandip Das, Ritankar Mondal, Sasanka Roy
Information Processing Letters.
www.sciencedirect.com/science/article/abs/pii/S0020019016301703
Color Spanning Objects: Algorithms and Hardness Results.
Sandip Banerjee, Neeldhara Mishra, Subhas C. Nandy
International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2016)
link.springer.com/chapter/10.1007/978-3-319-29221-2_4
On the Construction of a Generalized Voronoi Inverse of a Rectangular Tessellation.
Sandip Banerjee, Bhargab B. Bhattacharya, Sandip Das, Arindam Karmakar, Anil Maheshwari
International Symposium on Voronoi Diagram in Science and Engineering (ISVD 2012)
ieeexplore.ieee.org/document/6257669
