Ph.D. Candidate,
Department of Computer Science,
Rutgers, the State University of NJ.
Hello! I am interested in approximation algorithms, hardness of approximation, complexity theory and combinatorics.
My advisor is Mario Szegedy.
Complexity of Newman's Community Finding Approach for Social Networks.
with Bhaskar DasGupta.
To appear in Journal of Computer and System Sciences. [arXiv]
Optimal Hitting Sets for Combinatorial Shapes.
with Aditya Bhaskara and Srikanth Srinivasan.
Submitted.
Chapter 7 of the DIMACS Tutorial on "Limits of approximation algorithms : PCPs and Unique Games".
[arXiv]
Approximation Algorithms.
Lecture Notes for Prof. Muthu's course. [pdf]