I am an assistant professor in the School of Computer Sciences, NISER, Bhubaneswar. Earlier, I was a postdoctoral researcher at the Indian Statistical Institute, Kolkata and the University of Bonn in Germany. I completed my PhD in the Department of Computer Science and Engineering at IIT Delhi with Prof. Ragesh Jaiswal.
Research interests: Algorithm design, more specifically sublinear and randomized algorithms.
Details of my publications can be found here, and DBLP, Google Scholar.
Contact: bhattacharya.anup@gmail.com
Recent Publications:
Hardness of Approximation of Euclidean k-Median in Approx 2021 (with Dishant Goyal and Ragesh Jaiswal)
Even the Easiest (?) Graph Coloring Problem is not Easy in Streaming to appear in ITCS 2021 (with Arijit Bishnu, Gopinath Mishra, Anannya Upasana)
On Sampling Based Algorithms for k-Means to appear in FSTTCS 2020 (with Dishant Goyal, Ragesh Jaiswal and Amit Kumar)
Disjointness Through the Lens of VC-dimension: Sparsity and Beyond in RANDOM 2020 (with Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar)
Noisy, Greedy and Not So Greedy k-means++ in ESA 2020 (with Jan Eube, Heiko Röglin, Melanie Schmidt)
Complete list of publications can be found here.
Algorithms (CS301), with Abhishek Sahu
Programming and Data Structures Lab: I (CS141), with Abhishek Sahu
Approximation Algorithms (CS458) in Spring 2023
Algorithms (CS301) in Autumn 2022
Programming and Data Structures Lab- II in Spring 2022
Advanced Machine Learning (CS461/CS672) in Spring 2022
Computational Laboratory-I in Autumn 2021
Randomized Algorithms (CS661) in Autumn 2021
CS458 (Approximation Algorithms) in Spring 2021
Earlier: