Conference Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction 2006 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 4051:667-678 Blelloch GE, Dhamdhere K, Halperin E, Ravi R, Schwartz R, Sridhar S
Journal Article Hedging uncertainty: Approximation algorithms for stochastic optimization problems 2006 • Mathematical programming • 108(1):97-114 Ravi R, Sinha A
Conference Matching based augmentations for approximating connectivity problems 2006 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 3887:13-24 Ravi R
Journal Article Min-Max payoffs in a two-player location game 2006 • Operations Research Letters • 34(5):499-507 Chawla S, Rajan U, Ravi R, Sinha A
Conference Minimum vehicle routing with a common deadline 2006 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 4110:212-223 Nagarajan V, Ravi R
Conference OPTIMAL IMPERFECT PHYLOGENY RECONSTRUCTION AND HAPLOTYPING (IPPH) 2006 199-210 Sridhar S, Blelloch GE, Ravi R, Schwartz R
Journal Article Optimal imperfect phylogeny reconstruction and haplotyping (IPPH). 2006 • Computational systems bioinformatics / Life Sciences Society. Computational Systems Bioinformatics Conference • 199-210 Sridhar S, Blelloch GE, Ravi R, Schwartz R
Conference Pay today for a rainy day: Improved approximation algorithms for demand-robust min-cut and shortest path problems 2006 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 3884:206-217 Golovin D, Goyal V, Ravi R
Journal Article Profit Maximizing Mechanisms for the Extended Multicasting Game 2006 Chawla S, Kitchin D, Rajan U, Ravi R, Sinha A
Conference Simple reconstruction of binary near-perfect phylogenetic trees 2006 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 3992:799-806 Sridhar S, Dhamdhere K, Blelloch GE, Halperin E, Ravi R, Schwartz R
Conference Approximation Algorithms for Low-Distortion Embeddings Into Low-Dimensional Spaces 2005 • PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS • 119-128 Badoiu M, Dhamdhere K, Gupta A, Rabinovich Y, Raecke H, Ravi R, Sidiropoulos A
Conference Approximation algorithms for requirement cut on graphs 2005 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 3624:209-220 Nagarajan V, Ravi R
Conference Finding effective support-tree preconditioners 2005 176-185 Maggs BM, Miller GL, Parekh O, Ravi R, Woo SLM
Conference How to pay, come what may: Approximation algorithms for demand-robust covering problems 2005 • Annual Symposium on Foundations of Computer Science • 367-376 Dhamdhere K, Goyal V, Ravi R
Conference On two-stage stochastic minimum spanning trees 2005 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 3509:321-334 Dhamdhere K, Ravi R, Singh M
Journal Article Primal-dual meets local search: Approximating msts with nonuniform degree bounds 2005 • SIAM journal on computing (Print) • 34(3):763-773 Könemann J, Ravi R
Journal Article Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders 2005 Hafalir I, Ravi R, Sayedi A
Conference What about wednesday? Approximation algorithms for multistage stochastic optimization 2005 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 3624:86-98 Gupta A, Pál M, Ravi R, Sinha A
Journal Article A linear-time algorithm to compute a MAD tree of an interval graph 2004 • Information Processing Letters • 89(5):255-259 Dahlhaus E, Dankelmann P, Ravi R
Conference An edge in time saves nine: LP rounding approximation algorithms for stochastic network design 2004 • Annual Symposium on Foundations of Computer Science • 218-227 Gupta A, Ravi R, Sinha A
Journal Article Approximation algorithms for a capacitated network design problem 2004 • Algorithmica • 38(3):417-431 Hassin R, Ravi R, Salman FS
Journal Article Approximation algorithms for finding low-degree subgraphs 2004 • Networks • 44(3):203-215 Klein PN, Krishnan R, Raghavachari B, Ravi R
Journal Article Approximation algorithms for minimizing average distortion 2004 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 2996:234-245 Dhamdhere K, Gupta A, Ravi R
Conference Boosted sampling 2004 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 417-426 Gupta A, Pál M, Ravi R, Sinha A
Journal Article Hedging uncertainty: Approximation algorithms for stochastic optimization problems 2004 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 3064:101-115 Ravi R, Sinha A
