R.Sharathkumar

Department of Computer Science,
Duke University.
Office: LSRC D211.
Email: sharath at cs.duke.edu

---

I am a Ph.D. student in the Department of Computer Science at Duke University under the supervision of Prof. Pankaj Agarwal. I completed my B. Tech (Hons) (Computer Science) from IIIT, Hyderabad in 2006. My research interests lie in the area of theoretical computer science. My current research focus is on designing data structures and algorithms for problems in computational geometry.

Publications

"A Near-Linear Time ε-Approximation Algorithm for Geometric Bipartite Matching"
with Pankaj K. Agarwal. Accepted, to appear in STOC 2012.

"Algorithms for Transportation Problem in Geometric Settings"
with Pankaj K. Agarwal. In Proc. 23rd Annual Sympos. Discrete Algorithms, 2012. 306--317

"Streaming Algorithms for Extent Problems in High Dimensions."
with Pankaj K. Agarwal. in Proc. 21st Annual Sympos. Discrete Algorithms, 2010. pp 1481--1489.

"Approximate Euclidean Shortest-paths amid Convex Obstacles"
with Pankaj K. Agarwal and Hai Yu. In Proc. 20th Annual Sympos. Discrete Algorithms,2009. pp 283--292.

"On approximate geodesic-distance queries amid deforming point clouds”
with Pankaj K. Agarwal, Alon Efrat, and Hai Yu. Algorithmic Foundations of Robotics VIII, STAR 57, G.S. Chirikjian et al. (Eds.) pp 351--365.

"Range Aggregate Proximity Queries"
with Prosenjit Gupta. Technical Report IIIT/TR/2007/80, IIIT Hyderabad, 2007.

"Range Aggregate Proximity Detection for Design Rule Checking in VLSI layouts"
with Prosenjit Gupta. In Proc. of 18th Canadian Conf. on Comput. Geom., 2006. pp 151--154.

© Copyright 2009 by Sharath | Design by Minimalistic Design