Kedar Dhamdhere is a software engineer at Google. Prior to joining Google he finished his PhD in Computer Science from CMU. His research interests are algorithms and theoretical computer science.
Minimizing Weighted Flow Time, Nikhil Bansal, Kedar Dhamdhere, ACM Transactions on Algorithms, vol. 3, no. 4 (2007), pp. 1-14.
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees, Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz, International Conference on Computational Science (2), 2006, pp. 799-806.
Approximation Algorithms for Minimizing Average Distortion, Kedar Dhamdhere, Anupam Gupta, R. Ravi, Theory Comput. Syst., vol. 39 (2006), pp. 93-111.
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction, Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, Srinath Sridhar, ICALP (1), 2006, pp. 667-678.
Improved embeddings of graph metrics into random trees, Kedar Dhamdhere, Anupam Gupta, Harald R"cke, SODA, 2006, pp. 61-69.
Approximation algorithms for low-distortion embeddings into low-dimensional spaces, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald R"cke, R. Ravi, Anastasios Sidiropoulos, SODA, 2005, pp. 119-128.
Finding (Recently) Frequent Items in Distributed Data Streams, Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere, Christopher Olston, ICDE, 2005, pp. 767-778.
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems, Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh, FOCS, 2005, pp. 367-378.
Metric Embeddings with Relaxed Guarantees, Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins, FOCS, 2005, pp. 83-100.
On Two-Stage Stochastic Minimum Spanning Trees, Kedar Dhamdhere, R. Ravi, Mohit Singh, IPCO, 2005, pp. 321-334.
Approximating Additive Distortion of Embeddings into Line Metrics, Kedar Dhamdhere, APPROX-RANDOM, 2004, pp. 96-104.
Approximation Algorithms for Minimizing Average Distortion, Kedar Dhamdhere, Anupam Gupta, R. Ravi, STACS, 2004, pp. 234-245.
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown, Nikhil Bansal, Kedar Dhamdhere, Jochen Koenemann, Amitabh Sinha, Algorithmica, vol. 40 (2004), pp. 305-318.
WIC: A General-Purpose Algorithm for Monitoring Web Information Sources, Sandeep Pandey, Kedar Dhamdhere, Christopher Olston, VLDB, 2004, pp. 360-371.
Minimizing weighted flow time, Nikhil Bansal, Kedar Dhamdhere, SODA, 2003, pp. 508-516.
Non-clairvoyant Scheduling for Minimizing Mean Slowdown, Nikhil Bansal, Kedar Dhamdhere, Jochen Koenemann, Amitabh Sinha, STACS, 2003, pp. 260-270.
Scheduling for Flow-Time with Admission Control, Nikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere, ESA, 2003, pp. 43-54.