Deeparnab Chakrabarty

Post-doctoral Fellow
Department of Combinatorics and Optimization,
University of Waterloo
Office: DC2134
Phone: (519)888 4567 x32719
Email: deepc [at] math.uwaterloo.ca

Research

Research Interests: Approximation Algorithms, Combinatorial Optimization, Algorithmic Game Theory
Resume:(pdf) (As of September, 2008)


Selected Publications

On the Approximability of Budgeted Allocations and
Improved Lower Bounds for Submodular Welfare Maximization and GAP (with Gagan Goel)
Proceedings of FOCS 2008
(conf-version) (full-version)

New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. (with Nikhil Devanur and Vijay Vazirani)
Proceedings of IPCO 2008
(conf-version)(full-version)

On Competitiveness in Uniform Utility Allocation Markets. (with Nikhil Devanur)
Proceedings of WINE 2007
(conf-version)(full-version)

New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets (with Nikhil Devanur and Vijay Vazirani)
Proceedings of WINE 2006
(conf-version) (full-version)

Design is as easy as Optimization (with Aranyak Mehta and Vijay Vazirani)
Proceedings of ICALP 2006
(conf-version)(full-version)


Personal
Crosswords (1) (2) 
Word Pyramids (link)

Last Modified on :