| 2020 | PODC | Distributed Approximation on Power Graphs. | Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju |
| 2017 | PODC | Distributed Approximation of Maximum Independent Set and Maximum Matching. | Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman |
| 2016 | PODC | A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds. | Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman |
| 2015 | IWOCA | 1.5-Approximation Algorithm for the 2-Convex Recoloring Problem. | Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz |
| 2013 | SPAA | A constant factor approximation algorithm for the storage allocation problem: extended abstract. | Reuven Bar-Yehuda, Michael Beder, Dror Rawitz |
| 2012 | ICALP | Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs. | Reuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz |
| 2010 | ESA | Minimum Vertex Cover in Rectangle Graphs. | Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz |
| 2009 | WAOA | Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications. | Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz |
| 2008 | INFOCOM | Cell Selection in 4G Cellular Networks. | David Amzallag, Reuven Bar-Yehuda, Danny Raz, Gabriel Scalosub |
| 2007 | ESA | Approximation of Partial Capacitated Vertex Cover. | Reuven Bar-Yehuda, Guy Flysher, Julin Mestre, Dror Rawitz |
| 2006 | ESA | Resource Allocation in Bounded Degree Trees. | Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz |
| 2005 | ESA | Using Fractional Primal-Dual to Schedule Split Intervals with Demands. | Reuven Bar-Yehuda, Dror Rawitz |
| 2005 | WAOA | Improved Approximation Algorithm for Convex Recoloring of Trees. | Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz |
| 2005 | WAOA | Exploiting Locality: Approximating Sorting Buffers. | Reuven Bar-Yehuda, Jonathan Laserson |
| 2003 | ESA | On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract. | Reuven Bar-Yehuda, Guy Even, Shimon Shahar |
| 2002 | SODA | Scheduling split intervals. | Reuven Bar-Yehuda, Magns M. Halldrsson, Joseph Naor, Hadas Shachnai, Irina Shapira |
| 2000 | STOC | A unified approach to approximating resource allocation and scheduling. | Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber |
| 1999 | ESA | Efficient Algorithms for Integer Programs with Two Variables per Constraint. | Reuven Bar-Yehuda, Dror Rawitz |
| 1999 | SODA | Using Homogenous Weights for Approximating the Partial Cover Problem. | Reuven Bar-Yehuda |
| 1999 | UAI | Random Algorithms for the Loop Cutset Problem. | Ann Becker, Reuven Bar-Yehuda, Dan Geiger |
| 1994 | SODA | Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. | Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth |
| 1989 | PODC | Multiple Communication in Multi-Hop Radio Networks. | Reuven Bar-Yehuda, Amos Israeli |
| 1987 | PODC | On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization. | Reuven Bar-Yehuda, Oded Goldreich, Alon Itai |
| 1987 | STACS | Making Distributed Spanning Tree Algorithms Fault-Resilient. | Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks |
| 1983 | WG | A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem. | Reuven Bar-Yehuda, Shimon Even |
| 1982 | STOC | On Approximating a Vertex Cover for Planar Graphs | Reuven Bar-Yehuda, Shimon Even |