Contributed Talks

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., 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.
3. 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.
4. 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.
5. 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.
6. Bar-Yehuda, R., and R. Grinwald, Triangulating Polygons with Holes, Second Canadian Conference on Computational Geometry, Ottawa, Ontario, Canada, August 6-10, 1990.
7. Bar-Yehuda, R., One for the Price of Two: A Unified Approach for Approximating Covering Problems, APPROX98, Aalborg, Denemark, July 17-18, 1998.
8. Bar-Yehuda R., Using Homogeneous Weights for Approximating the Partial Cover Problem, Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, Maryland, January 17-19, 1999. Postscript BibTeX+Abstract (Contained in (23))
9. 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. Postscript BibTeX+Abstract (Contained in (24))
10. 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 11th Annual European Symposium on Algorithms, (ESA-2003), Lecture Notes in Computer Science 2832:55-66, Springer 2003. Budapest, Hotel Benczúr, 15-20 September, 2003 (Contained in (30))
11. 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))
12. 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))
13. 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 (Contained in (36))
14. 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))