I am a researcher in the India Lab. I am interested in understanding efficient algorithms using the lens of optimization. I am currently at the Algorithms and Data Sciences group at Microsoft Research’s Bangalore lab. Previously, I have been at UPenn, Waterloo, GaTech, and IITB. Here is my CV.
- Randomized Algorithms: S’16@IISc
- Approximation Algorithms: S’15@IISc, S’10@Penn
- Scheduling: S’09@W’loo
- ICTS-Northeastern Discussion Meeting on Games, Epidemics, and Behaviour.
- Mysore Park Workshop on Recent Advances in Algorithms and Complexity
More information can be found here.
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency ProblemsDeeparnab Chakrabarty, Chaitanya Swamy, in IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization, New York, NY, Springer-Verlag Berlin, Heidelberg, June 15, 2011,
Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: A Short Proof of a 1.55 Upper BoundDeeparnab Chakrabarty, Jochen Könemann, David Pritchard, in Operations Research Letters, Elsevier Science Publishers B. V. Amsterdam, The Netherlands, The Netherlands, November 1, 2010,
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAPDeeparnab Chakrabarty, Gagan Goel, in SIAM Journal on Computing, Society for Industrial and Applied Mathematics Philadelphia, PA, USA, March 1, 2010,
March 10, 2015
November 30, 2010
University of Pennsylvania