# Kedar Dhamdhere

According to our database

Collaborative distances:

^{1}, Kedar Dhamdhere authored at least 20 papers between 2003 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces.

SIAM J. Discrete Math., 2019

2018

Did the Model Understand the Question?

Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics, 2018

2017

Analyza: Exploring Data with Conversation.

Proceedings of the 22nd International Conference on Intelligent User Interfaces, 2017

2009

Metric Embeddings with Relaxed Guarantees.

SIAM J. Comput., 2009

2007

Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice.

IEEE/ACM Trans. Comput. Biology Bioinform., 2007

2006

Improved embeddings of graph metrics into random trees.

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Relaxing Haplotype Block Models for Association Testing.

Proceedings of the Biocomputing 2006, 2006

Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees.

Proceedings of the Computational Science, 2006

Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction.

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

Approximation algorithms for low-distortion embeddings into low-dimensional spaces.

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

On Two-Stage Stochastic Minimum Spanning Trees.

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

Finding (Recently) Frequent Items in Distributed Data Streams.

Proceedings of the 21st International Conference on Data Engineering, 2005

How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems.

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Metric Embeddings with Relaxed Guarantees.

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

WIC: A General-Purpose Algorithm for Monitoring Web Information Sources.

Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, August 31, 2004

Approximation Algorithms for Minimizing Average Distortion.

Proceedings of the STACS 2004, 2004

Approximating Additive Distortion of Embeddings into Line Metrics.

Proceedings of the Approximation, 2004

2003

Non-clairvoyant Scheduling for Minimizing Mean Slowdown.

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Minimizing weighted flow time.

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Scheduling for Flow-Time with Admission Control.

Proceedings of the Algorithms, 2003