Scheduling for Flow-Time with Admission Control. - Nikhil Bansal 001; Avrim Blum; Shuchi Chawla 001; Kedar Dhamdhere (ESA, 2003)

Approximating Additive Distortion of Embeddings into Line Metrics. - Kedar Dhamdhere (APPROX-RANDOM, 2004)

WIC: A General-Purpose Algorithm for Monitoring Web Information Sources. - Sandeep Pandey; Kedar Dhamdhere; Christopher Olston (VLDB, 2004)

Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. - Nikhil Bansal 001; Kedar Dhamdhere; Jochen Könemann; Amitabh Sinha (Algorithmica, 2004)

Metric Embeddings with Relaxed Guarantees. - Ittai Abraham; Yair Bartal; T.-H. Hubert Chan; Kedar Dhamdhere; Anupam Gupta 001; Jon M. Kleinberg; Ofer Neiman; Aleksandrs Slivkins (FOCS, 2005)

How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems. - Kedar Dhamdhere; Vineet Goyal; R. Ravi 001; Mohit Singh (FOCS, 2005)

Finding (Recently) Frequent Items in Distributed Data Streams. - Amit Manjhi; Vladislav Shkapenyuk; Kedar Dhamdhere; Christopher Olston (ICDE, 2005)

On Two-Stage Stochastic Minimum Spanning Trees. - Kedar Dhamdhere; R. Ravi 001; Mohit Singh (IPCO, 2005)

Approximation algorithms for low-distortion embeddings into low-dimensional spaces. - Mihai Badoiu; Kedar Dhamdhere; Anupam Gupta 001; Yuri Rabinovich; Harald Räcke; R. Ravi 001; Anastasios Sidiropoulos (SODA, 2005)

Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. - Guy E. Blelloch; Kedar Dhamdhere; Eran Halperin; R. Ravi 001; Russell Schwartz; Srinath Sridhar 001 (ICALP (1), 2006)

Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees. - Srinath Sridhar 001; Kedar Dhamdhere; Guy E. Blelloch; Eran Halperin; R. Ravi 001; Russell Schwartz (International Conference on Computational Science (2), 2006)

Relaxing Haplotype Block Models for Association Testing. - Natalie Castellana; Kedar Dhamdhere; Srinath Sridhar 001; Russell Schwartz (Pacific Symposium on Biocomputing, 2006)

Improved embeddings of graph metrics into random trees. - Kedar Dhamdhere; Anupam Gupta 001; Harald Räcke (SODA, 2006)

Approximation Algorithms for Minimizing Average Distortion. - Kedar Dhamdhere; Anupam Gupta 001; R. Ravi 001 (Theory Comput. Syst., 2006)

Minimizing weighted flow time. - Nikhil Bansal 001; Kedar Dhamdhere (ACM Trans. Algorithms, 2007)

Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice. - Srinath Sridhar 001; Kedar Dhamdhere; Guy E. Blelloch; Eran Halperin; R. Ravi 001; Russell Schwartz (IEEE ACM Trans. Comput. Biol. Bioinform., 2007)

Metric Embeddings with Relaxed Guarantees. - T.-H. Hubert Chan; Kedar Dhamdhere; Anupam Gupta 001; Jon M. Kleinberg; Aleksandrs Slivkins (SIAM J. Comput., 2009)

Analyza: Exploring Data with Conversation. - Kedar Dhamdhere; Kevin S. McCurley; Ralfi Nahmias; Mukund Sundararajan; Qiqi Yan (IUI, 2017)

Abductive Matching in Question Answering. - Kedar Dhamdhere; Kevin S. McCurley; Mukund Sundararajan; Ankur Taly (CoRR, 2017)

Did the Model Understand the Question? - Pramod Kaushik Mudrakarta; Ankur Taly; Mukund Sundararajan; Kedar Dhamdhere (ACL (1), 2018)

It was the training data pruning too! - Pramod Kaushik Mudrakarta; Ankur Taly; Mukund Sundararajan; Kedar Dhamdhere (CoRR, 2018)

How Important is a Neuron. - Kedar Dhamdhere; Mukund Sundararajan; Qiqi Yan (ICLR (Poster), 2019)

A New Interaction Index inspired by the Taylor Series. - Ashish Agarwal; Kedar Dhamdhere; Mukund Sundararajan (CoRR, 2019)

Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces. - Anastasios Sidiropoulos; Mihai Badoiu; Kedar Dhamdhere; Anupam Gupta 001; Piotr Indyk; Yuri Rabinovich; Harald Räcke; R. Ravi 001 (SIAM J. Discret. Math., 2019)

The Shapley Taylor Interaction Index. - Mukund Sundararajan; Kedar Dhamdhere; Ashish Agarwal (ICML, 2020)