![]() |
Aparna Das 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. |
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.
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.
| Instructor: |
|
| Teaching Assistant: |
|
| Computer Science: |
|
| Economics: |
|