2009
2007
- Nikhil Bansal, Kedar Dhamdhere. Minimizing weighted flow time. talg, 3(4), 2007. [doi]
- Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz. Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice. tcbb, 4(4):561-571, 2007. [doi]
2006
- Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, Srinath Sridhar. Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. icalp 2006: 667-678 [doi]
- Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz. Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees. iccS 2006: 799-806 [doi]
- Kedar Dhamdhere, Anupam Gupta, R. Ravi. Approximation Algorithms for Minimizing Average Distortion. mst, 39(1):93-111, 2006. [doi]
- Natalie Castellana, Kedar Dhamdhere, Srinath Sridhar, Russell Schwartz. Relaxing Haplotype Block Models for Association Testing. psb 2006: 454-466 [doi]
- Kedar Dhamdhere, Anupam Gupta, Harald Räcke. Improved embeddings of graph metrics into random trees. soda 2006: 61-69 [doi]
2005
- Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins. Metric Embeddings with Relaxed Guarantees. focs 2005: 83-100 [doi]
- Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere, Christopher Olston. Finding (Recently) Frequent Items in Distributed Data Streams. icde 2005: 767-778 [doi]
- Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh. How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems. focs 2005: 367-378 [doi]
- Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos. Approximation algorithms for low-distortion embeddings into low-dimensional spaces. soda 2005: 119-128 [doi]
- Kedar Dhamdhere, R. Ravi, Mohit Singh. On Two-Stage Stochastic Minimum Spanning Trees. ipco 2005: 321-334 [doi]
2004
2003