Kedar Dhamdhere

	2009
20		T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Aleksandrs Slivkins: Metric Embeddings with Relaxed Guarantees. SIAM J. Comput. 38(6): 2303-2329 (2009)
	2007
19		Nikhil Bansal, Kedar Dhamdhere: Minimizing weighted flow time. ACM Transactions on Algorithms 3(4): (2007)
18		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. IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 561-571 (2007)
	2006
17		Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, Srinath Sridhar: Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. ICALP (1) 2006: 667-678
16		Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz: Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees. International Conference on Computational Science (2) 2006: 799-806
15		Natalie Castellana, Kedar Dhamdhere, Srinath Sridhar, Russell Schwartz: Relaxing Haplotype Block Models for Association Testing. Pacific Symposium on Biocomputing 2006: 454-466
14		Kedar Dhamdhere, Anupam Gupta, Harald Räcke: Improved embeddings of graph metrics into random trees. SODA 2006: 61-69
13		Kedar Dhamdhere, Anupam Gupta, R. Ravi: Approximation Algorithms for Minimizing Average Distortion. Theory Comput. Syst. 39(1): 93-111 (2006)
	2005
12		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
11		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
10		Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere, Christopher Olston: Finding (Recently) Frequent Items in Distributed Data Streams. ICDE 2005: 767-778
9		Kedar Dhamdhere, R. Ravi, Mohit Singh: On Two-Stage Stochastic Minimum Spanning Trees. IPCO 2005: 321-334
8		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
	2004
7		Kedar Dhamdhere: Approximating Additive Distortion of Embeddings into Line Metrics. APPROX-RANDOM 2004: 96-104
6		Kedar Dhamdhere, Anupam Gupta, R. Ravi: Approximation Algorithms for Minimizing Average Distortion. STACS 2004: 234-245
5		Sandeep Pandey, Kedar Dhamdhere, Christopher Olston: WIC: A General-Purpose Algorithm for Monitoring Web Information Sources. VLDB 2004: 360-371
4		Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha: Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. Algorithmica 40(4): 305-318 (2004)
	2003
3		Nikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere: Scheduling for Flow-Time with Admission Control. ESA 2003: 43-54
2		Nikhil Bansal, Kedar Dhamdhere: Minimizing weighted flow time. SODA 2003: 508-516
1		Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha: Non-clairvoyant Scheduling for Minimizing Mean Slowdown. STACS 2003: 260-270

Coauthor Index

1	Ittai Abraham	[11]
2	Mihai Badoiu	[8]
3	Nikhil Bansal	[1] [2] [3] [4] [19]
4	Yair Bartal	[11]
5	Guy E. Blelloch	[16] [17] [18]
6	Avrim Blum	[3]
7	Natalie Castellana	[15]
8	T.-H. Hubert Chan (Hubert T.-H. Chan)	[11] [20]
9	Shuchi Chawla	[3]
10	Vineet Goyal	[12]
11	Anupam Gupta	[6] [8] [11] [13] [14] [20]
12	Eran Halperin	[16] [17] [18]
13	Jon M. Kleinberg	[11] [20]
14	Jochen Könemann	[1] [4]
15	Amit Manjhi	[10]
16	Ofer Neiman	[11]
17	Christopher Olston (Chris Olston)	[5] [10]
18	Sandeep Pandey	[5]
19	Yuri Rabinovich	[8]
20	Harald Räcke	[8] [14]
21	R. Ravi	[6] [8] [9] [12] [13] [16] [17] [18]
22	Russell Schwartz	[15] [16] [17] [18]
23	Vladislav Shkapenyuk	[10]
24	Anastasios Sidiropoulos	[8]
25	Mohit Singh	[9] [12]
26	Amitabh Sinha	[1] [4]
27	Aleksandrs Slivkins	[11] [20]
28	Srinath Sridhar	[15] [16] [17] [18]