Aparna Das

aparna@cs.arizona.edu
Gould Simpson Building Room 716

I am a postdoctoral researcher in the computer science department at the University of Arizona working with Prof. Stephen Kobourov

Research Areas: Design and analysis of approximation algorithms, geometric algorithms, combinatorial optimization, and computational game theory. 

Education: I earned my PhD in computer science from Brown University in Oct. 2010. I was fortunate to be advised by  Claire Mathieu.  I have an undergraduate degree from Cornell and a Master of Science from the University of Wisconsin Madison.

I am currently on the job market: CV.

Publications     Teaching     Courses      Activities


Publications

Approximating Minimum Manhattan Networks in Higher Dimensions. With Emden Gansner, Michael Kaufmann, Stephen Kobourov, Joachim Spoerhase, and Alexander Wolff.  In ESA 2011.

The train delivery problem- vehicle routing meets bin-packing. With Claire Mathieu and Shay Mozes. In WAOA 2010.

A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing. With Claire Mathieu, In SODA 2010. The presentation slides. A journal version under submission.

Greedy Bidding Strategies for Keyword Auctions. With Matthew Cary, Ben Edelman, Ioannis Giotis, Kurtis Heimerl, Anna Karlin, Claire Mathieu, and Michael Schwarz. In EC 2007. A journal version.

On hierarchical diameter-clustering, and the supplier problems. With Claire Mathieu. In WAOA 2006. The presentation slides Journal version in Theory of Computing Systems 2009, WAOA special issue.

Miscellaneous Manuscripts

Image Quest: From Multiple Inaccurate Trajectories to One Accurate Trajectory. With Stephen Kobourov, Sankar Veeramoni and Yunhao Xu. Poster presented at Histochemistry 2012.

Maximizing profit using recommender systems. With Claire Mathieu and Daniel Ricketts. Unpublished manuscript.

On the Effects of Competing Advertisements in Keyword Auctions. With Ioannis Giotis, Anna Karlin and Claire Mathieu. Unpublished manuscript.


Teaching
   
Instructor:
Teaching Assistant:

Relevant Courses
   
Computer Science:
  • CS295-4 - Approximation Algorithms
  • CS250 - Topics in Algorithms, Planar Graph Algorithms
  • CS254 - Advanced Probabilistic Methods
  • CS295-8 - Computer Science, Algorithms and Economics
  • CS258 - Solving Hard Problems in Combinatorial Optimization
  • CS244 - Game Theoretic Artificial Intelligence
  • CS295-C - Topics in computational biology
Economics:
  • Econ 2060- Microeconomics
  • Econ 2180- Game Theory


Activities