R. Ravi

Vineet Goyal, R. Ravi: An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set. Oper. Res. Lett. 41(2): 191-196 (2013)

Isa Emin Hafalir, R. Ravi, Amin Sayedi: A near Pareto optimal auction with budget constraints. Games and Economic Behavior 74(2): 699-708 (2012)

Anupam Gupta, Viswanath Nagarajan, R. Ravi: Technical Note - Approximation Algorithms for VRP with Stochastic Demands. Operations Research 60(1): 123-127 (2012)

Viswanath Nagarajan, R. Ravi: Approximation algorithms for distance constrained vehicle routing problems. Networks 59(2): 209-214 (2012)

Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi: Online and Stochastic Survivable Network Design. SIAM J. Comput. 41(6): 1649-1672 (2012)

Ming-Chi Tsai, Guy E. Blelloch, Russell Schwartz, R. Ravi: Coalescent-based method for learning parameters of admixture events from large-scale genetic variation data. BCB 2012: 90-97

Takuro Fukunaga, R. Ravi: Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. FOCS 2012: 263-272

Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh: Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. ICALP (1) 2012: 145-156

Marco Molinaro, R. Ravi: Geometry of Online Packing Linear Programs. ICALP (1) 2012: 701-713

Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi: Approximation algorithms for stochastic orienteering. SODA 2012: 1522-1538

R. Ravi: Iterative Methods in Combinatorial Optimization (Invited Talk). STACS 2012: 24-24

Takuro Fukunaga, R. Ravi: Iterative rounding approximation algorithms for degree-bounded node-connectivity network design. CoRR abs/1203.3578 (2012)

Marco Molinaro, R. Ravi: Geometry of Online Packing Linear Programs. CoRR abs/1204.5810 (2012)

Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh: Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. CoRR abs/1205.1477 (2012)

Viswanath Nagarajan, R. Ravi: The Directed Orienteering Problem. Algorithmica 60(4): 1017-1030 (2011)

Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz: Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-State Phylogeny. Journal of Computational Biology 18(3): 445-457 (2011)

Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz: An Optimization-Based Sampling Scheme for Phylogenetic Trees. Journal of Computational Biology 18(11): 1599-1609 (2011)

Vineet Goyal, Latife Genç Kaya, R. Ravi: An FPTAS for minimizing the product of two non-negative linear cost functions. Math. Program. 126(2): 401-405 (2011)

Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola: Special Section on Foundations of Computer Science. SIAM J. Comput. 40(3): 770 (2011)

Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems. SIAM J. Comput. 40(5): 1361-1401 (2011)

Ming-Chi Tsai, Guy E. Blelloch, R. Ravi, Russell Schwartz: A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure. IEEE/ACM Trans. Comput. Biology Bioinform. 8(4): 918-928 (2011)

Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi: Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. FOCS 2011: 827-836

Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi: Capacitated Vehicle Routing with Non-uniform Speeds. IPCO 2011: 235-247

Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz: An Optimization-Based Sampling Scheme for Phylogenetic Trees. RECOMB 2011: 252-266

Brendan Meeder, Brian Karrer, Amin Sayedi, R. Ravi, Christian Borgs, Jennifer T. Chayes: We know who you followed last summer: inferring social link creation times in twitter. WWW 2011: 517-526

Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim (Eds.): Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings. Lecture Notes in Computer Science 6845, Springer 2011, isbn 978-3-642-22934-3

Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi: Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits. CoRR abs/1102.3749 (2011)

Inge Li Gørtz, Viswanath Nagarajan, R. Ravi: Minimum Makespan Multi-vehicle Dial-a-Ride. CoRR abs/1102.5450 (2011)

Marco Molinaro, R. Ravi: The Query-commit Problem. CoRR abs/1110.0990 (2011)

Viswanath Nagarajan, R. Ravi: Approximation Algorithms for Requirement Cut on Graphs. Algorithmica 56(2): 198-213 (2010)

Hakan Yildiz, R. Ravi, Wayne Fairey: Integrated optimization of customer and supplier logistics at Robert Bosch LLC. European Journal of Operational Research 207(1): 456-464 (2010)

Viswanath Nagarajan, R. Ravi, Mohit Singh: Simpler analysis of LP extreme points for traveling salesman and survivable network design problems. Oper. Res. Lett. 38(3): 156-160 (2010)

Vineet Goyal, R. Ravi: A PTAS for the chance-constrained knapsack problem with random item sizes. Oper. Res. Lett. 38(3): 161-164 (2010)

Anupam Gupta, Viswanath Nagarajan, R. Ravi: An improved approximation algorithm for requirement cut. Oper. Res. Lett. 38(4): 322-325 (2010)

R. Ravi, Amitabh Sinha: Approximation Algorithms for Multicommodity Facility Location Problems. SIAM J. Discrete Math. 24(2): 538-551 (2010)

Anupam Gupta, Mohammad Taghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k-forest. ACM Transactions on Algorithms 6(2) (2010)

Anupam Gupta, Viswanath Nagarajan, R. Ravi: Thresholded Covering Algorithms for Robust and Max-min Optimization. ICALP (1) 2010: 262-274

Anupam Gupta, Viswanath Nagarajan, R. Ravi: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. ICALP (1) 2010: 690-701

Ming-Chi Tsai, Guy E. Blelloch, R. Ravi, Russell Schwartz: A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure. ISBRA 2010: 167-178

Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz: Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny. RECOMB 2010: 369-383

Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi: Tree Embeddings for Two-Edge-Connected Network Design. SODA 2010: 1521-1538

Christian Borgs, Jennifer T. Chayes, Brian Karrer, Brendan Meeder, R. Ravi, Ray Reagans, Amin Sayedi: Game-Theoretic Models of Information Overload in Social Networks. WAW 2010: 146-161

Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. CoRR abs/1003.0722 (2010)

Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi: Capacitated Vehicle Routing with Non-Uniform Speeds. CoRR abs/1012.1850 (2010)

Anupam Gupta, Viswanath Nagarajan, R. Ravi: Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets. CoRR abs/1012.4962 (2010)

Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany: Line-of-Sight Networks. Combinatorics, Probability & Computing 18(1-2): 145-163 (2009)

Fabrizio Grandoni, R. Ravi, Mohit Singh: Iterative Rounding for Multi-Objective Optimization Problems. ESA 2009: 95-106

Refael Hassin, R. Ravi, F. Sibel Salman: Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links. ESA 2009: 275-276

Inge Li Gørtz, Viswanath Nagarajan, R. Ravi: Minimum Makespan Multi-vehicle Dial-a-Ride. ESA 2009: 540-552

R. Ravi: Iterative Methods in Combinatorial Optimization. FSTTCS 2009: 453-469

Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi: Online and stochastic survivable network design. STOC 2009: 685-694

Isa Emin Hafalir, R. Ravi, Amin Sayedi: Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders. CoRR abs/0903.1450 (2009)

Anupam Gupta, Viswanath Nagarajan, R. Ravi: Thresholded Covering Algorithms for Robust and Max-Min Optimization. CoRR abs/0912.1045 (2009)

R. Ravi, Amitabh Sinha: Approximating k. European Journal of Operational Research 186(1): 77-90 (2008)

F. Sibel Salman, R. Ravi, John N. Hooker: Solving the Capacitated Local Access Network Design Problem. INFORMS Journal on Computing 20(2): 243-254 (2008)

Giuseppe Lancia, R. Ravi, Romeo Rizzi: Haplotyping for Disease Association: A Combinatorial Approach. IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 245-251 (2008)

Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz: Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference. IEEE/ACM Trans. Comput. Biology Bioinform. 5(3): 323-331 (2008)

Viswanath Nagarajan, R. Ravi: The Directed Minimum Latency Problem. APPROX-RANDOM 2008: 193-206

Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz: Direct maximum parsimony phylogeny reconstruction from genotype data. BMC Bioinformatics 8 (2007)

Anupam Gupta, R. Ravi, Amitabh Sinha: LP Rounding Approximation Algorithms for Stochastic Network Design. Math. Oper. Res. 32(2): 345-364 (2007)

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)

Viswanath Nagarajan, R. Ravi: Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems. APPROX-RANDOM 2007: 257-270

Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k -Forest. ESA 2007: 241-252

Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi: Pricing Tree Access Networks with Connected Backbones. ESA 2007: 498-509

Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz: Efficiently Finding the Most Parsimonious Phylogenetic Tree Via Linear Programming. ISBRA 2007: 37-48

Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany: Line-of-sight networks. SODA 2007: 968-977

Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer: An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. SODA 2007: 1153-1162

Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k-forest. CoRR abs/0707.0648 (2007)

Thirumalai Parthiban, R. Ravi, G. T. Parthiban: Potential monitoring system for corrosion of steel in concrete. Advances in Engineering Software 37(6): 375-381 (2006)

R. Ravi, Amitabh Sinha: Approximation Algorithms for Problems Combining Facility Location and Network Design. Operations Research 54(1): 73-81 (2006)

R. Ravi, Amitabh Sinha: Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. Math. Program. 108(1): 97-114 (2006)

Kedar Dhamdhere, Anupam Gupta, R. Ravi: Approximation Algorithms for Minimizing Average Distortion. Theory Comput. Syst. 39(1): 93-111 (2006)

Shuchi Chawla, Uday Rajan, R. Ravi, Amitabh Sinha: Min-Max payoffs in a two-player location game. Oper. Res. Lett. 34(5): 499-507 (2006)

Viswanath Nagarajan, R. Ravi: Minimum Vehicle Routing with a Common Deadline. APPROX-RANDOM 2006: 212-223

R. Ravi, Mohit Singh: Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs. ICALP (1) 2006: 169-180

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

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

R. Ravi: Matching Based Augmentations for Approximating Connectivity Problems. LATIN 2006: 13-24

Daniel Golovin, Vineet Goyal, R. Ravi: Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems. STACS 2006: 206-217

Shuchi Chawla, Jason D. Hartline, Uday Rajan, R. Ravi: Bayesian Optimal No-Deficit Mechanism Design. WINE 2006: 136-148

Jochen Könemann, R. Ravi: Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds. SIAM J. Comput. 34(3): 763-773 (2005)

Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization. APPROX-RANDOM 2005: 86-98

Viswanath Nagarajan, R. Ravi: Approximation Algorithms for Requirement Cut on Graphs. APPROX-RANDOM 2005: 209-220

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

Kedar Dhamdhere, R. Ravi, Mohit Singh: On Two-Stage Stochastic Minimum Spanning Trees. IPCO 2005: 321-334

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

Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo: Finding effective support-tree preconditioners. SPAA 2005: 176-185

Elias Dahlhaus, Peter Dankelmann, R. Ravi: A linear-time algorithm to compute a MAD tree of an interval graph. Inf. Process. Lett. 89(5): 255-259 (2004)

Philip N. Klein, Radha Krishnan, Balaji Raghavachari, R. Ravi: Approximation algorithms for finding low-degree subgraphs. Networks 44(3): 203-215 (2004)

Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha: Min-max tree covers of graphs. Oper. Res. Lett. 32(4): 309-315 (2004)

Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit Singh: On the Crossing Spanning Tree Problem. APPROX-RANDOM 2004: 51-60

Anupam Gupta, R. Ravi, Amitabh Sinha: An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design. FOCS 2004: 218-227

R. Ravi, Amitabh Sinha: Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. IPCO 2004: 101-115

Shuchi Chawla, Uday Rajan, R. Ravi, Amitabh Sinha: Worst-case payoffs of a location game. ACM Conference on Electronic Commerce 2004: 244-245

R. Ravi, Amitabh Sinha: Multicommodity facility location. SODA 2004: 342-349

Kedar Dhamdhere, Anupam Gupta, R. Ravi: Approximation Algorithms for Minimizing Average Distortion. STACS 2004: 234-245

Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: Boosted sampling: approximation algorithms for stochastic optimization. STOC 2004: 417-426

Refael Hassin, R. Ravi, F. Sibel Salman: Approximation Algorithms for a Capacitated Network Design Problem. Algorithmica 38(3): 417-431 (2003)

Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie: Approximation algorithms for the test cover problem. Math. Program. 98(1-3): 477-491 (2003)

Michele Conforti, Refael Hassin, R. Ravi: Reconstructing edge-disjoint paths. Oper. Res. Lett. 31(3): 273-276 (2003)

Jochen Könemann, R. Ravi: Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. FSTTCS 2003: 289-301

Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha: Covering Graphs Using Trees and Stars. RANDOM-APPROX 2003: 24-35

Shuchi Chawla, D. Kitchin, Uday Rajan, R. Ravi, Amitabh Sinha: Profit guaranteeing mechanisms for multicast networks. ACM Conference on Electronic Commerce 2003: 190-191

Jochen Könemann, R. Ravi: Primal-dual meets local search: approximating MST's with nonuniform degree bounds. STOC 2003: 389-395

R. Ravi, David P. Williamson: Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. Algorithmica 34(1): 98-107 (2002)

Goran Konjevod, R. Ravi, Aravind Srinivasan: Approximation algorithms for the covering Steiner problem. Random Struct. Algorithms 20(3): 465-482 (2002)

Jochen Könemann, R. Ravi: A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees. SIAM J. Comput. 31(6): 1783-1793 (2002)

R. Ravi: Bicriteria Spanning Tree Problems. APPROX 2002: 3-4

Eduardo Sany Laber, Ojas Parekh, R. Ravi: Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. ESA 2002: 649-661

R. Ravi, Amitabh Sinha II: Approximating k-cuts via network strength. SODA 2002: 621-622

R. Ravi, David P. Williamson: Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems. SODA 2002: 1000-1001

R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III: Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. Algorithmica 31(1): 58-78 (2001)

Goran Konjevod, R. Ravi, F. Sibel Salman: On approximating planar metrics by tree metrics. Inf. Process. Lett. 80(4): 213-219 (2001)

F. Sibel Salman, Joseph Cheriyan, R. Ravi, S. Subramanian: Approximating the Single-Sink Link-Installation Problem in Network Design. SIAM Journal on Optimization 11(3): 595-610 (2001)

Bjarni V. Halldórsson, Magnús M. Halldórsson, R. Ravi: On the Approximability of the Minimum Test Collection Problem. ESA 2001: 158-169

Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, Amitabh Sinha II: On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem. IPCO 2001: 170-184

Naveen Garg, Goran Konjevod, R. Ravi: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. J. Algorithms 37(1): 66-84 (2000)

Milind Dawande, Jayant Kalagnanam, Pinar Keskinocak, F. Sibel Salman, R. Ravi: Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions. J. Comb. Optim. 4(2): 171-186 (2000)

Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala: Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Theor. Comput. Sci. 235(1): 25-42 (2000)

Refael Hassin, R. Ravi, F. Sibel Salman: Approximation algorithms for a capacitated network design problem. APPROX 2000: 167-176

Goran Konjevod, R. Ravi: An approximation algorithm for the covering Steiner problem. SODA 2000: 338-344

Jochen Könemann, R. Ravi: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. STOC 2000: 537-546

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth: Improving Minimum Cost Spanning Trees by Upgrading Nodes. J. Algorithms 33(1): 92-111 (1999)

Avrim Blum, R. Ravi, Santosh Vempala: A Constant-Factor Approximation Algorithm for the k-MST Problem. J. Comput. Syst. Sci. 58(1): 101-108 (1999)

Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang: A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees. SIAM J. Comput. 29(3): 761-778 (1999)

Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth: Improving Spanning Trees by Upgrading Nodes. Theor. Comput. Sci. 221(1-2): 139-155 (1999)

Giuseppe Lancia, R. Ravi: GESTALT: Genomic Steiner Alignments. CPM 1999: 101-114

R. Ravi, F. Sibel Salman: Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design. ESA 1999: 29-40

Joseph Cheriyan, Tibor Jordán, R. Ravi: On 2-Coverings and 2-Packings of Laminar Families. ESA 1999: 510-520

Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi: Redeeming Nested Dissection: Parallelism Implies Fill. PPSC 1999

R. Ravi, John D. Kececioglu: Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree. Discrete Applied Mathematics 88(1-3): 355-366 (1998)

Shiva Chaudhuri, Naveen Garg, R. Ravi: The p-Neighbor k-Center Problem. Inf. Process. Lett. 65(3): 131-134 (1998)

Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III: Bicriteria Network Design Problems. J. Algorithms 28(1): 142-171 (1998)

Hsueh-I Lu, R. Ravi: Approximating Maximum Leaf Spanning Trees in Almost Linear Time. J. Algorithms 29(1): 132-141 (1998)

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi: Approximation Algorithms for Certain Network Improvement Problems. J. Comb. Optim. 2(3): 257-288 (1998)

Paul F. Stelling, Charles U. Martel, Vojin G. Oklobdzija, R. Ravi: Optimal Circuits for Parallel Multipliers. IEEE Trans. Computers 47(3): 273-285 (1998)

Robert Carr, R. Ravi: A New Bound for the 2-Edge Connected Subgraph Problem. IPCO 1998: 112-125

Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang: A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees. SODA 1998: 21-32

Naveen Garg, Goran Konjevod, R. Ravi: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. SODA 1998: 253-259

Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala: Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems. STOC 1998: 100-105

Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III: Bicriteria Network Design Problems. CoRR cs.CC/9809103 (1998)

R. Ravi, David P. Williamson: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. Algorithmica 18(1): 21-43 (1997)

Amir Ben-Dor, Giuseppe Lancia, Jennifer Perone, R. Ravi: Banishing Bias from Consensus Sequences. CPM 1997: 247-261

Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi: Parallelizing Elimination Orders with Linear Fill. FOCS 1997: 274-283

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth: Improving Spanning Trees by Upgrading Nodes. ICALP 1997: 281-291

Hsueh-I Lu, R. Ravi: A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree. ISPAN 1997: 351-356

F. Sibel Salman, Joseph Cheriyan, R. Ravi, S. Subramanian: Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem. SODA 1997: 619-628

Vineet Bafna, Babu O. Narayanan, R. Ravi: Nonoverlapping Local Alignments (weighted Independent Sets of Axis-parallel Rectangles). Discrete Applied Mathematics 71(1-3): 41-53 (1996)

Madhav V. Marathe, R. Ravi, Ravi Sundaram: Service-Constrained Network Design Problems. Nord. J. Comput. 3(4): 367-387 (1996)

R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi: Spanning Trees - Short or Small. SIAM J. Discrete Math. 9(2): 178-200 (1996)

Avrim Blum, R. Ravi, Santosh Vempala: A Constant-factor Approximation Algorithm for the k MST Problem (Extended Abstract). STOC 1996: 442-448

Madhav V. Marathe, R. Ravi, Ravi Sundaram: Service-Constrained Network Design Problems. SWAT 1996: 28-40

R. Ravi, Michel X. Goemans: The Constrained Minimum Spanning Tree Problem (Extended Abstract). SWAT 1996: 66-75

Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi: An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications. Combinatorica 15(2): 187-202 (1995)

Philip N. Klein, R. Ravi: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees. J. Algorithms 19(1): 104-115 (1995)

Ajit Agrawal, Philip N. Klein, R. Ravi: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks. SIAM J. Comput. 24(3): 440-456 (1995)

Charles U. Martel, Vojin G. Oklobdzija, R. Ravi, Paul F. Stelling: Design Strategies for Optimal Multiplier Circuits. IEEE Symposium on Computer Arithmetic 1995: 42-49

Vineet Bafna, S. Muthukrishnan, R. Ravi: Computing Similarity between RNA Strings. CPM 1995: 1-16

R. Ravi, John D. Kececioglu: Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree. CPM 1995: 330-339

Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III: Bicriteria Network Design Problems. ICALP 1995: 487-498

R. Ravi: David P. Williamson: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. SODA 1995: 332-341

John D. Kececioglu, R. Ravi: Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation. SODA 1995: 604-613

Vineet Bafna, Babu O. Narayanan, R. Ravi: Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles). WADS 1995: 506-517

R. Ravi: A Primal-Dual Approximation Algorithm for the Steiner Forest Problem. Inf. Process. Lett. 50(4): 185-190 (1994)

R. Ravi: Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract). FOCS 1994: 202-213

R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi: Spanning Trees Short or Small. SODA 1994: 546-555

Philip N. Klein, R. Ravi: When cycles collapse: A general approximation technique for constrained two-connectivity problems. IPCO 1993: 39-55

Philip N. Klein, R. Ravi: A nearly best-possible approximation algorithm for node-weighted Steiner trees. IPCO 1993: 323-332

R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III: Many birds with one stone: multi-objective approximation algorithms. STOC 1993: 438-447

Madhav V. Marathe, R. Ravi, C. Pandu Rangan: Generalized Vertex Covering in Interval Graphs. Discrete Applied Mathematics 39(1): 87-93 (1992)

R. Ravi, Madhav V. Marathe, C. Pandu Rangan: An optimal algorithm to solve the all-pair shortest path problem on interval graphs. Networks 22(1): 21-35 (1992)

R. Ravi, Balaji Raghavachari, Philip N. Klein: Approximation Through Local Optimality: Designing Networks with Small Degree. FSTTCS 1992: 279-290

R. Ravi, Ajit Agrawal, Philip N. Klein: Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion. ICALP 1991: 751-762

Ajit Agrawal, Philip N. Klein, R. Ravi: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks. STOC 1991: 134-144

Philip N. Klein, Ajit Agrawal, R. Ravi, Satish Rao: Approximation through Multicommodity Flow. FOCS 1990: 726-737