| 2025 | ICALP | Minimum Cost Nowhere-Zero Flows and Cut-Balanced Orientations. | Karthekeyan Chandrasekaran, Siyue Liu, R. Ravi |
| 2025 | SODA | Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs. | Benjamin Moseley, Aidin Niaparast, R. Ravi |
| 2024 | ICDE | HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property. | Zixuan Chen, Subhodeep Mitra, R. Ravi, Wolfgang Gatterbauer |
| 2024 | IPCO | Approximately Packing Dijoins via Nowhere-Zero Flows. | Grard Cornujols, Siyue Liu, R. Ravi |
| 2023 | ICML | Short-lived High-volume Bandits. | Su Jia, Nishant Oli, Ian Anderson, Paul Duff, Andrew A. Li, R. Ravi |
| 2023 | SODA | Approximation Algorithms for Steiner Tree Augmentation Problems. | R. Ravi, Weizhong Zhang, Michael Zlatin |
| 2023 | SODA | Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models. | Da Qi Chen, Lin An, Aidin Niaparast, R. Ravi, Oleksandr Rudenko |
| 2022 | HCOMP | Allocation Schemes in Analytic Evaluation: Applicant-Centric Holistic or Attribute-Centric Segmented? | Jingyan Wang, Carmel Baharav, Nihar B. Shah, Anita Williams Woolley, R. Ravi |
| 2022 | SoCS | Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions (Extended Abstract). | Nikhil Chandak, Kenny Chour, Sivakumar Rathinam, R. Ravi |
| 2021 | ESA | Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. | Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu |
| 2021 | UAI | A heuristic for statistical seriation. | Komal Dhull, Jingyan Wang, Nihar B. Shah, Yuanzhi Li, R. Ravi |
| 2020 | AISTATS | Stretching the Effectiveness of MLE from Accuracy to Bias for Pairwise Comparisons. | Jingyan Wang, Nihar B. Shah, R. Ravi |
| 2019 | ESA | Multicommodity Multicast, Wireless and Fast. | R. Ravi, Oleksandr Rudenko |
| 2019 | WADS | Inventory Routing Problem with Facility Location. | Yang Jiao, R. Ravi |
| 2018 | LATIN | Approximation Algorithms for Replenishment Problems with Fixed Turnover Times. | Thomas Bosman, Martijn van Ee, Yang Jiao, Alberto Marchetti-Spaccamela, R. Ravi, Leen Stougie |
| 2018 | LATIN | Plane Gossip: Approximating Rumor Spread in Planar Graphs. | Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram |
| 2017 | ESA | Randomized Contractions for Multiobjective Minimum Cuts. | Hassene Aissi, Ali Ridha Mahjoub, R. Ravi |
| 2017 | ESA | Single-Sink Fractionally Subadditive Network Design. | Guru Guruganesh, Jennifer Iglesias, R. Ravi, Laura Sanit |
| 2017 | KDD | Post Processing Recommender Systems for Diversity. | Arda Antikacioglu, R. Ravi |
| 2017 | SODA | LAST but not Least: Online Spanners for Buy-at-Bulk. | Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh |
| 2017 | WALCOM | Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest. | Yang Jiao, R. Ravi, Wolfgang Gatterbauer |
| 2016 | COCOON | Balls and Funnels: Energy Efficient Group-to-Group Anycasts. | Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram |
| 2015 | WWW | Recommendation Subgraphs for Web Discovery. | Arda Antikacioglu, R. Ravi, Srinath Sridhar |
| 2014 | ICALP | Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems. | Afshin Nikzad, R. Ravi |
| 2014 | IPCO | Short Tours through Large Linear Forests. | Uriel Feige, R. Ravi, Mohit Singh |
| 2014 | WG | Graph-TSP from Steiner Cycles. | Satoru Iwata, Alantha Newman, R. Ravi |
| 2012 | FOCS | Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. | Takuro Fukunaga, R. Ravi |
| 2012 | ICALP | Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. | Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh |
| 2012 | ICALP | Geometry of Online Packing Linear Programs. | Marco Molinaro, R. Ravi |
| 2012 | SODA | Approximation algorithms for stochastic orienteering. | Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi |
| 2012 | STACS | Iterative Methods in Combinatorial Optimization (Invited Talk). | R. Ravi |
| 2011 | FOCS | Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. | Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi |
| 2011 | IPCO | Capacitated Vehicle Routing with Non-uniform Speeds. | Inge Li Grtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi |
| 2011 | RECOMB | An Optimization-Based Sampling Scheme for Phylogenetic Trees. | Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz |
| 2011 | WWW | We know who you followed last summer: inferring social link creation times in twitter. | Brendan Meeder, Brian Karrer, Amin Sayedi, R. Ravi, Christian Borgs, Jennifer T. Chayes |
| 2010 | ICALP | Thresholded Covering Algorithms for Robust and Max-min Optimization. | Anupam Gupta, Viswanath Nagarajan, R. Ravi |
| 2010 | ICALP | Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. | Anupam Gupta, Viswanath Nagarajan, R. Ravi |
| 2010 | RECOMB | Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny. | Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz |
| 2010 | SODA | Tree Embeddings for Two-Edge-Connected Network Design. | Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi |
| 2010 | WAW | Game-Theoretic Models of Information Overload in Social Networks. | Christian Borgs, Jennifer T. Chayes, Brian Karrer, Brendan Meeder, R. Ravi, Ray E. Reagans, Amin Sayedi |
| 2009 | ESA | Minimum Makespan Multi-vehicle Dial-a-Ride. | Inge Li Grtz, Viswanath Nagarajan, R. Ravi |
| 2009 | ESA | Iterative Rounding for Multi-Objective Optimization Problems. | Fabrizio Grandoni, R. Ravi, Mohit Singh |
| 2009 | ESA | Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links. | Refael Hassin, R. Ravi, F. Sibel Salman |
| 2009 | STOC | Online and stochastic survivable network design. | Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi |
| 2007 | ESA | Pricing Tree Access Networks with Connected Backbones. | Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi |
| 2007 | ESA | Dial a Ride from | Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi |
| 2007 | SODA | Line-of-sight networks. | Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany |
| 2007 | SODA | An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. | Anupam Gupta, Jochen Knemann, Stefano Leonardi, R. Ravi, Guido Schfer |
| 2006 | ICALP | Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. | Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, Srinath Sridhar |
| 2006 | ICALP | Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs. | R. Ravi, Mohit Singh |
| 2006 | ICCS | Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees. | Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz |
| 2006 | LATIN | Matching Based Augmentations for Approximating Connectivity Problems. | R. Ravi |
| 2006 | STACS | Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems. | Daniel Golovin, Vineet Goyal, R. Ravi |
| 2005 | FOCS | How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems. | Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh |
| 2005 | IPCO | On Two-Stage Stochastic Minimum Spanning Trees. | Kedar Dhamdhere, R. Ravi, Mohit Singh |
| 2005 | SODA | Approximation algorithms for low-distortion embeddings into low-dimensional spaces. | Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Rcke, R. Ravi, Anastasios Sidiropoulos |
| 2005 | SPAA | Finding effective support-tree preconditioners. | Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo |
| 2004 | FOCS | An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design. | Anupam Gupta, R. Ravi, Amitabh Sinha |
| 2004 | IPCO | Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. | R. Ravi, Amitabh Sinha |
| 2004 | SODA | Multicommodity facility location. | R. Ravi, Amitabh Sinha |
| 2004 | STOC | Boosted sampling: approximation algorithms for stochastic optimization. | Anupam Gupta, Martin Pl, R. Ravi, Amitabh Sinha |
| 2004 | STACS | Approximation Algorithms for Minimizing Average Distortion. | Kedar Dhamdhere, Anupam Gupta, R. Ravi |
| 2003 | STOC | Primal-dual meets local search: approximating MST's with nonuniform degree bounds. | Jochen Knemann, R. Ravi |
| 2002 | ESA | Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. | Eduardo Sany Laber, Ojas Parekh, R. Ravi |
| 2002 | SODA | Approximating k-cuts via network strength. | R. Ravi, Amitabh Sinha II |
| 2002 | SODA | Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems. | R. Ravi, David P. Williamson |
| 2001 | ESA | On the Approximability of the Minimum Test Collection Problem. | Bjarni V. Halldrsson, Magns M. Halldrsson, R. Ravi |
| 2001 | IPCO | On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem. | Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, Amitabh Sinha II |
| 2000 | SODA | An approximation algorithm for the covering Steiner problem. | Goran Konjevod, R. Ravi |
| 2000 | STOC | A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. | Jochen Knemann, R. Ravi |
| 1999 | CPM | GESTALT: Genomic Steiner Alignments. | Giuseppe Lancia, R. Ravi |
| 1999 | ESA | On 2-Coverings and 2-Packings of Laminar Families. | Joseph Cheriyan, Tibor Jordn, R. Ravi |
| 1999 | ESA | Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design. | R. Ravi, F. Sibel Salman |
| 1998 | IPCO | A New Bound for the 2-Edge Connected Subgraph Problem. | Robert Carr, R. Ravi |
| 1998 | SODA | A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. | Naveen Garg, Goran Konjevod, R. Ravi |
| 1998 | SODA | A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees. | Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang |
| 1998 | STOC | Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems. | Avrim Blum, Goran Konjevod, R. Ravi, Santosh S. Vempala |
| 1997 | CPM | Banishing Bias from Consensus Sequences. | Amir Ben-Dor, Giuseppe Lancia, Jennifer Perone, R. Ravi |
| 1997 | FOCS | Parallelizing Elimination Orders with Linear Fill. | Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi |
| 1997 | ICALP | Improving Spanning Trees by Upgrading Nodes. | Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth |
| 1997 | SODA | Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem. | F. Sibel Salman, Joseph Cheriyan, R. Ravi, S. Subramanian |
| 1996 | STOC | A Constant-factor Approximation Algorithm for the | Avrim Blum, R. Ravi, Santosh S. Vempala |
| 1995 | ARITH | Design Strategies for Optimal Multiplier Circuits. | Charles U. Martel, Vojin G. Oklobdzija, R. Ravi, Paul F. Stelling |
| 1995 | CPM | Computing Similarity between RNA Strings. | Vineet Bafna, S. Muthukrishnan, R. Ravi |
| 1995 | CPM | Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree. | R. Ravi, John D. Kececioglu |
| 1995 | ICALP | Bicriteria Network Design Problems. | Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III |
| 1995 | SODA | Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation. | John D. Kececioglu, R. Ravi |
| 1995 | SODA | David P. Williamson: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. | R. Ravi |
| 1995 | WADS | Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles). | Vineet Bafna, Babu O. Narayanan, R. Ravi |
| 1994 | FOCS | Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract) | R. Ravi |
| 1994 | SODA | Spanning Trees Short or Small. | R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi |
| 1993 | IPCO | When cycles collapse: A general approximation technique for constrained two-connectivity problems. | Philip N. Klein, R. Ravi |
| 1993 | IPCO | A nearly best-possible approximation algorithm for node-weighted Steiner trees. | Philip N. Klein, R. Ravi |
| 1993 | STOC | Many birds with one stone: multi-objective approximation algorithms. | R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III |
| 1991 | ICALP | Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion. | R. Ravi, Ajit Agrawal, Philip N. Klein |
| 1991 | STOC | When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks | Ajit Agrawal, Philip N. Klein, R. Ravi |
| 1990 | FOCS | Approximation through Multicommodity Flow | Philip N. Klein, Ajit Agrawal, R. Ravi, Satish Rao |