Refereed Papers in Conference Proceedings

1. Bar-Yehuda, R. and S. Even. On Approximating a Vertex Cover for Planar Graphs, Proceeding of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC), San Francisco, California, May 5-7, 1982, pp. 303-309.
2. Bar-Yehuda, R. and S. Even. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem, Proceedings of the WG '83, International Workshop on Graphtheoretic Concepts in Computer Science, June 16-18, 1983, pp. 17-28. (the same as (2))
3. Bar-Yehuda, R., O. Goldreich, and A. Itai. On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization. Proceeding of the 6-th Annual ACM Symposium on Principles of Distributed Computing (PODC), Vancouver, British Columbia, Canada, Aug 10-12, 1987, pp. 98-108. (the same as (8))
4. Bar-Yehuda, R., S. Kutten, Y. Wolfstahl, and S. Zaks. Making Distributed Algorithms Fault-Resilient, Symposium on Theoretical Aspects of Computer Science (STACS), 1987 Passau, Germany. (Contains Reference (5))
5. Bar-Yehuda, R., J. A. Feldman, R. Y. Pinter and S. Wimer. Depth First Search and Dynamic Programming Algorithms for Efficient CMOS Cell Generation. The 5-th MIT Conference on VLSI, 1988. (the same as (6))
6. Bar-Yehuda, R., A. Israeli, and A. Itai, Multiple Communication in Multi-Hop Radio Networks, Proceeding of the 8-th Annual ACM Symposium on Principles of Distributed Computing (PODC), Canada, Aug 14-16, 1989. (the same as (12))
7. Bar-Yehuda, R., O. Goldreich, and A. Itai. Efficient Emulation of Single-Hop Radio network with Collision Detection on Multi-Hop Radio network with no Collision Detection the 3rd International Workshop on Distributed Algorithms. Nice, France, September 26-28, 1989. (the same as (7))
8. Bar-Yehuda, R., B. Chor, and E. Kushilevitz, Privacy, Additional Information, and Communication, 5th IEEE Structure in Complexity Theory, July 1990, pp. 55-65. (Contained in (13))
9. Bar-Yehuda, R., and S. Fogel, Good Splitters with Application to Ray Shooting, Second Canadian Conference on Computational Geometry, Ottawa, Ontario, Canada, August 6-10, 1990. (related to (11), (14))
10. Bar-Yehuda, R., and E. Ben-Hanoch, An $O(N \log^* N)$ Time Algorithm for Covering Simple Polygons With Squares, Second Canadian Conference on Computational Geometry, Ottawa, Ontario, Canada, August 6-10, 1990. (Contained in (15))
11. Bar-Yehuda, R., and R. Grinwald, Triangulating Polygons with Holes, Second Canadian Conference on Computational Geometry, Ottawa, Ontario, Canada, August 6-10, 1990.
12. Bar-Yehuda, R., and R. Grinwald, Merging Polygonal Obstacles, 7th Israeli Symposium on Artificial Intelligence and Computer Vision, Tel Aviv, Dec. 1990. (Continuation of the previous conf.)
13. Bar-Yehuda, R., V. Dabholkar, K. Govindarajan and D. Sivakumar, Randomized Local Approximations with applications to the MAX-CLIQUE problem, Poster in SECOND DIMACS CHALLENGE, (Cliques, Coloring, and Satisfiability), 1993.
14. Bar-Yehuda, R., D. Geiger, J. Naor and R. Roth, Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and bayesian inference, Proceedings of the 5th Annual ACM-Siam Symposium on Discrete Algorithms, Arlington, Virginia, (1994). (Contained in (18))
15. Bar-Yehuda, R., A. Efrat and A. Itai, A simple algorithm for maintaining the center of a planar point-set, Fifth Canadian Conference on Computational Geometry, 252-257, 1993.
16. Bar-Yehuda R., One for the Price of Two: A Unified Approach for Approximating Covering Problems, APPROX 1998 - First International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Aalborg, Denmark, July 17-18, 1998. (Contained in (21)) Postscript BibTeX+Abstract
17. Bar-Yehuda R., Using Homogeneous Weights for Approximating the Partial Cover Problem, Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 17-19, 1999. (Contained in (23)) Postscript BibTeX+Abstract

18. Makbily, Y., C. Gotsman and R. Bar-Yehuda, Geometric Algorithms for Message Filtering in Decentralized Virtual Environments, ACM Symposium on Interactive 3D Graphics April 26-28, 1999. Postscript BibTeX+Abstract
19. Bar-Yehuda, R. and D. Rawitz. Efficient Algorithms for Integer Programs with Two Variables per Constraint, 7th Annual European Symposium on Algorithms. Prague, Czech Republic, July 1999.
20. Becker A., Bar-Yehuda, R., and D. Geiger, Random Algorithms for the Weighted Feedback Vertex Set Problem Fifteenth Conference on Uncertainty in Artificial Intelligence July 30-August 1999, Shtockholm, Sweden
21. Bar-Noy A., Bar-Yehuda, R., Freund A., Naor S., and B. Schieber, A Unified Approach to Approximating Resource Allocation and Scheduling The Thirty Second Annual ACM Symposium on Theory of Computing (STOC), Portland Oragon, May 21-23, 2000.
22. Bar-Yehuda, R., D. Rawitz, On the Equivalence Between the Primal-Dual Schema and the Local-Ratio Technique, APPROX 2001 - 4th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Berkeley, California, USA, 18-20 August 2001. (Contained in (31)) Postscript
23. Bar-Yehuda R., M. M. Halldorsson, J. Naor, H. Shachnai and I. Shapira, Scheduling Split Intervals, Thirteenth ACM-SIAM Symposium on Discrete Algorithms (SODA), January 6-8, 2002 San Francisco. (Contained in (33))
24. R. Bar-Yehuda, Even G., and S. Shahar, On Approximating A Geometric Prize-Collecting Traveling Salesman Problem With Time Windows, in ESA-2003, Lecture Notes in Computer Science 2832:55-66, Springer 2003. (Contained in (30)) Postscript
25. R. Bar-Yehuda and D. Rawitz, Using Fractional Primal-Dual to Schedule Split Intervals with Demands, 13th Annual European Symposium on Algorithms, (ESA-2005), Lecture Notes in Computer Science 3669:714-725, Springer 2005. Palma de Mallorca, Spain, October 3-6, 2005. Pdf Journal link (Contained in Submitted (32))
26. R. Bar-Yehuda and J. Laserson, Exploiting Locality: Approximating Sorting Buffers, Proceedings of the 3rd International Workshop on Approximation and Online Algorithms (WAOA), 2005. Lecture Notes in Computer Science Springer. Mallorca, Spain, October 3-6, 2005 (Contained in Submitted (35))
27. R. Bar-Yehuda I. Feldman and D. Rawitz, Improved Approximation Algorithm for Convex Recoloring of Trees, Proceedings of the 3rd International Workshop on Approximation and Online Algorithms (WAOA), 2005. Lecture Notes in Computer Science Springer. Mallorca, Spain, October 3-6, 2005 13th Annual European Symposium on Algorithms, (Contained in Submitted (36))
28. R. Bar-Yehuda, M. Beder, Y. Cohen, and D. Rawitz. Resource allocation in bounded degree trees, ESA'06: Proceedings of the 14th conference on Annual European Symposium, Lecture Notes in Computer Science 4168:64-75, Springer 2006. (Contained in (38))
29. R. Bar-Yehuda, G. Flysher, J. Mestre, and D. Rawitz, Approximation of Partial Capacitated Vertex Cover. ESA 2007: 335-346 (Contained in (40))
30. D. Amzallag, R. Bar-Yehud, D. Raz, G. Scalosub. Cell Selection in 4G Cellular Networks, 27th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 13-18 April 2008, Phoenix, AZ, INFOCOM 10(2): 198-206, 2008, (Contained in (43))
31. R. Bar-Yehuda, D. Hermelin and D. Rawitz. An extension of the Nemhauser & Trotter Theorem to generalized vertex cover with applications. Preliminary version appeared in 7th WAOA, 2009. (Contained in (39))
32. Bar-Yehuda R., Danny Hermelin and D. Rawitz. Minimum vertex cover in rectangle graphs. Preliminary version appeared in 18th ESA, LNCS 6346:255-266, 2010. (Contained in (41))
33. Bar-Yehuda R., G. Polevoy and D. Rawitz. Bandwidth allocation in cellular networks with multiple interferences. Preliminary version appeared in 6th DIALM-POMC, 33-42, 2010. (Contained in (44))
34. D. Amzallag, R Bar-Yehuda, D. Raz, D. and G. Scalosub, Cell Selection in 4G Cellular Networks, IEEE Infocom 2008 (Contained in (43))
35. Bar-Yehuda R., E. Kantor, S. Kutten, D. Rawitz, Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs. ICALP (2) 2012: 416-427 (Contained in (48))

36. Bar-Yehuda R., M. Beder, and D. Rawitz. A constant factor approximation algorithm for the storage allocation problem. 25th SPAA, 204-213, 2013 BBR14 (Contained in (45))
37. Bar-Yehuda R., G. Kutiel, and D. Rawitz. 1.5-Approximation Algorithm for the 2-Convex Recoloring Problem. 26th IWOCA, 2015. (Contained in (46))

38. Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzmana, A Distributed (2+)-Approximation for Vertex Cover in O(\log/\log\log) Rounds, Best Student Paper Award, PODC 2016 (Contained in (47))

39. Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju: Distributed Approximation on Power Graphs. PODC 2020: 501-510