Journal Article An approximation algorithm for minimum-cost vertex-connectivity problems 1997 • Algorithmica • 18(1):21-43 Ravi R, Williamson DP
Conference Banishing bias from consensus sequences 1997 • Lecture Notes in Computer Science • 1264:247-261 Ben-Dor A, Lancia G, Perone J, Ravi R
Conference Buy-at-bulk network design: Approximating the single-sink edge installation problem 1997 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 619-628 Salman FS, Cheriyan J, Ravi R, Subramanian S
Conference Improving spanning trees by upgrading nodes 1997 • Lecture Notes in Computer Science • 1256:281-291 Krumke SO, Marathe MV, Noltemeier H, Ravi R, Ravi SS, Sundaram R, Wirth HC
Journal Article Parallel Gaussian Elimination with Linear Work and Fill, 1997 Bornstein C, Maggs B, Miller G, Ravi R
Conference Parallelizing elimination orders with linear fill 1997 • Annual Symposium on Foundations of Computer Science • 274-283 Bornstein C, Maggs B, Miller G, Ravi R
Conference A constant-factor approximation algorithm for the k MST problem (extended abstract) 1996 • Annual ACM Symposium on Theory of Computing • 442-448 Blum A, Ravi R, Vempala S
Journal Article Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) 1996 • Discrete Applied Mathematics • 71(1-3):41-53 Bafna V, Narayanan B, Ravi R
Conference Service-constrained network design problems 1996 • Lecture Notes in Computer Science • 1097:28-40 Marathe MV, Ravi R, Sundaram R
Journal Article Spanning trees - Short or small 1996 • SIAM Journal on Discrete Mathematics • 9(2):178-200 Ravi R, Sundaram R, Marathe MV, Rosenkrantz DJ, Ravi SS
Conference The constrained minimum spanning tree problem 1996 • Lecture Notes in Computer Science • 1097:66-75 Ravi R, Goemans MX
Journal Article A NEARLY BEST-POSSIBLE APPROXIMATION ALGORITHM FOR NODE-WEIGHTED STEINER TREES 1995 • Journal of Algorithms in Cognition, Informatics and Logic • 19(1):104-115 KLEIN P, RAVI R
Journal Article AN APPROXIMATE MAX-FLOW MIN-CUT RELATION FOR UNDIRECTED MULTICOMMODITY FLOW, WITH APPLICATIONS 1995 • Combinatorica • 15(2):187-202 KLEIN P, RAO S, AGRAWAL A, RAVI R
Conference An approximation algorithm for minimum-cost vertex-connectivity problems 1995 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 332-341 Ravi R, Williamson DP
Conference Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree 1995 • Lecture Notes in Computer Science • 937:330-339 Ravi R, Kececioglu JD
Conference Bicriteria network design problems 1995 • Lecture Notes in Computer Science • 944:487-498 Marathe MV, Ravi R, Sundaram R, Ravi SS, Rosenkrantz DJ, Hunt HB
Conference Computing similarity between RNA strings 1995 • Lecture Notes in Computer Science • 937:1-16 Bafna V, Muthukrishnan S, Ravi R
Conference Design strategies for optimal multiplier circuits 1995 • Proceedings - Symposium on Computer Arithmetic • 42-49 MARTEL C, OKLOBDZIJA V, RAVI R, STELLING PF
Conference Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) 1995 • Lecture Notes in Computer Science • 955:506-517 Bafna V, Narayanan B, Ravi R
Conference Of mice and men: Algorithms for evolutionary distances between genomes with translocation 1995 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 604-613 Kececioglu JD, Ravi R
Journal Article WHEN TREES COLLIDE - AN APPROXIMATION ALGORITHM FOR THE GENERALIZED STEINER PROBLEM ON NETWORKS 1995 • SIAM journal on computing (Print) • 24(3):440-456 AGRAWAL A, KLEIN P, RAVI R
Journal Article A PRIMAL-DUAL APPROXIMATION ALGORITHM FOR THE STEINER FOREST PROBLEM 1994 • Information Processing Letters • 50(4):185-190 RAVI R
Conference Rapid rumor ramification: approximating the minimum broadcast time 1994 • Annual Symposium on Foundations of Computer Science • 202-213 Ravi R
Conference Spanning trees short or small 1994 • Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms • 546-555 Ravi R, Sundaram R, Marathe MV, Rosenkrantz DJ, Ravi SS
