Reuven Bar-Yehuda

According to our database, Reuven Bar-Yehuda authored at least 67 papers between 1981 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2020

Distributed Approximation on Power Graphs.

Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2018

Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks.

Reuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz

SIAM J. Discret. Math., 2018

1.5-approximation algorithm for the 2-Convex Recoloring problem.

Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz

Discret. Appl. Math., 2018

2017

A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds.

Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman

J. ACM, 2017

A Constant Factor Approximation Algorithm for the Storage Allocation Problem.

Reuven Bar-Yehuda, Michael Beder, Dror Rawitz

Algorithmica, 2017

Distributed Approximation of Maximum Independent Set and Maximum Matching.

Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016

A Distributed $(2+ε)$-Approximation for Vertex Cover in $O(\logΔ/ε\log\logΔ)$ Rounds.

Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman

CoRR, 2016

A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds.

Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015

Bandwidth allocation in cellular networks with multiple interferences.

Reuven Bar-Yehuda, Gleb Polevoy, Dror Rawitz

Discret. Appl. Math., 2015

2013

Cell Selection in 4G Cellular Networks.

David Amzallag, Reuven Bar-Yehuda, Danny Raz, Gabriel Scalosub

IEEE Trans. Mob. Comput., 2013

A note on multicovering with disks.

Reuven Bar-Yehuda, Dror Rawitz

Comput. Geom., 2013

A constant factor approximation algorithm for the storage allocation problem: extended abstract.

Reuven Bar-Yehuda, Michael Beder, Dror Rawitz

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

2012

Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs.

Reuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Minimum vertex cover in rectangle graphs.

Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz

Comput. Geom., 2011

2010

An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications.

Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz

SIAM J. Discret. Math., 2010

Approximation of Partial Capacitated Vertex Cover.

Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz

SIAM J. Discret. Math., 2010

2009

The maximum weight hierarchy matching problem.

Ron Zohar, Reuven Bar-Yehuda

Inf. Fusion, 2009

Resource Allocation in Bounded Degree Trees.

Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz

Algorithmica, 2009

Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications.

Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

2008

Improved Approximation Algorithm for Convex Recoloring of Trees.

Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz

Theory Comput. Syst., 2008

2007

Exploiting locality: approximating sorting buffers.

Reuven Bar-Yehuda, Jonathan Laserson

J. Discrete Algorithms, 2007

2006

Scheduling Split Intervals.

Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira

SIAM J. Comput., 2006

A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping.

Reuven Bar-Yehuda, Irad Yavneh

J. Graph Algorithms Appl., 2006

Using fractional primal-dual to schedule split intervals with demands.

Reuven Bar-Yehuda, Dror Rawitz

Discret. Optim., 2006

A Tale of Two Methods.

Reuven Bar-Yehuda, Dror Rawitz

Proceedings of the Theoretical Computer Science, 2006

2005

On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique.

Reuven Bar-Yehuda, Dror Rawitz

SIAM J. Discret. Math., 2005

On approximating a geometric prize-collecting traveling salesman problem with time windows.

Reuven Bar-Yehuda, Guy Even, Shimon Shahar

J. Algorithms, 2005

2004

Local ratio with negative weights.

Reuven Bar-Yehuda, Dror Rawitz

Oper. Res. Lett., 2004

Approximating the dense set-cover problem.

Reuven Bar-Yehuda, Zehavit Kehat

J. Comput. Syst. Sci., 2004

Local ratio: A unified framework for approxmation algrithms in memoriam: Shimon Even 1935-2004.

Reuven Bar-Yehuda, Keren Bendel, Ari Freund, Dror Rawitz

ACM Comput. Surv., 2004

2003

On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract.

Reuven Bar-Yehuda, Guy Even, Shimon Shahar

Proceedings of the Algorithms, 2003

2002

Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property.

Reuven Bar-Yehuda, Dror Rawitz

J. Algorithms, 2002

2001

Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems.

Reuven Bar-Yehuda, Guy Even, Jon Feldman, Joseph Naor

J. Graph Algorithms Appl., 2001

Using Homogeneous Weights for Approximating the Partial Cover Problem.

Reuven Bar-Yehuda

J. Algorithms, 2001

A unified approach to approximating resource allocation and scheduling.

Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber

J. ACM, 2001

Efficient Algorithms for Integer Programs with Two Variables per Constraint.

Reuven Bar-Yehuda, Dror Rawitz

Algorithmica, 2001

2000

Randomized Algorithms for the Loop Cutset Problem.

Ann Becker, Reuven Bar-Yehuda, Dan Geiger

J. Artif. Intell. Res., 2000

One for the Price of Two: a Unified Approach for Approximating Covering Problems.

Reuven Bar-Yehuda

Algorithmica, 2000

1999

Random Algorithms for the Loop Cutset Problem.

Ann Becker, Reuven Bar-Yehuda, Dan Geiger

Proceedings of the UAI '99: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, Stockholm, Sweden, July 30, 1999

Using Homogenous Weights for Approximating the Partial Cover Problem.

Reuven Bar-Yehuda

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Geometric algorithms for message filtering in decentralized virtual environments.

Yohai Makbily, Craig Gotsman, Reuven Bar-Yehuda

Proceedings of the 1999 Symposium on Interactive 3D Graphics, 1999

1998

Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference.

Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth

SIAM J. Comput., 1998

Partitioning a Sequence into Few Monotone Subsequences.

Reuven Bar-Yehuda, Sergio Fogel

Acta Informatica, 1998

1997

Matching of freeform curves.

Shmuel Cohen, Gershon Elber, Reuven Bar-Yehuda

Comput. Aided Des., 1997

1996

Time/Space Tradeoffs for Polygon Mesh Rendering.

Reuven Bar-Yehuda, Craig Gotsman

ACM Trans. Graph., 1996

A linear time algorithm for covering simple polygons with similar rectangles.

Reuven Bar-Yehuda, E. Ben-Hanoch

Int. J. Comput. Geom. Appl., 1996

1994

Triangulating disjoint Jordan chains.

Reuven Bar-Yehuda, Bernard Chazelle

Int. J. Comput. Geom. Appl., 1994

Variations on Ray Shooting.

Reuven Bar-Yehuda, Sergio Fogel

Algorithmica, 1994

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

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

Privacy, additional information and communication.

Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky

IEEE Trans. Inf. Theory, 1993

Rotating-Table Games and Derivatives of Words.

Reuven Bar-Yehuda, Tuvi Etzion, Shlomo Moran

Theor. Comput. Sci., 1993

Multiple Communication in Multihop Radio Networks.

Reuven Bar-Yehuda, Amos Israeli, Alon Itai

SIAM J. Comput., 1993

A Simple Algorithm for Maintaining the Center of a Planar Point-set.

Reuven Bar-Yehuda, Alon Efrat, Alon Itai

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization.

Reuven Bar-Yehuda, Oded Goldreich, Alon Itai

J. Comput. Syst. Sci., 1992

Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks.

Reuven Bar-Yehuda, Tuvi Etzion

Discret. Appl. Math., 1992

1991

Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection.

Reuven Bar-Yehuda, Oded Goldreich, Alon Itai

Distributed Comput., 1991

1990

Privacy, Additional Information, and Communication.

Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz

Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1989

Depth-first-search and dynamic programming algorithms for efficient CMOS cell generation.

Reuven Bar-Yehuda, Jack A. Feldman, Ron Y. Pinter, Shmuel Wimer

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1989

Multiple Communication in Multi-Hop Radio Networks.

Reuven Bar-Yehuda, Amos Israeli

Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

1988

Fault Tolerant Distributed Majority Commitment.

Reuven Bar-Yehuda, Shay Kutten

J. Algorithms, 1988

1987

Making Distributed Spanning Tree Algorithms Fault-Resilient.

Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks

Proceedings of the STACS 87, 1987

On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization.

Reuven Bar-Yehuda, Oded Goldreich, Alon Itai

Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

1984

On approximation problems related to the independent set and vertex cover problems.

Reuven Bar-Yehuda, Shlomo Moran

Discret. Appl. Math., 1984

1983

A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem.

Reuven Bar-Yehuda, Shimon Even

Proceedings of the WG '83, 1983

1982

Complexity of Finding k-Path-Free Dominating Sets in Graphs.

Reuven Bar-Yehuda, Uzi Vishkin

Inf. Process. Lett., 1982

On Approximating a Vertex Cover for Planar Graphs

Reuven Bar-Yehuda, Shimon Even

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1981

A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem.

Reuven Bar-Yehuda, Shimon Even

J. Algorithms, 1981