Reuven Bar-Yehuda

Technion – Israel Institute of Technology — Israel

Computer Science · Physical Sciences

30h-index4.0kcitations89works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(43), Optimization and Search Problems(29), Computational Geometry and Mesh Generation(24), Advanced Graph Theory Research(22), Vehicle Routing Optimization Methods(11)

Publications89 total

Distributed Approximation on Power Graphs
2020· 1 citedOpen Access
Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks
SIAM Journal on Discrete Mathematics·2018· 1 cited
Distributed Approximation of Maximum Independent Set and Maximum Matching
arXiv (Cornell University)·2017· 4 citedOpen Access
Distributed Approximation of Maximum Independent Set and Maximum\n Matching
arXiv (Cornell University)·2017Open Access
Distributed Approximation of Maximum Independent Set and Maximum Matching
2017· 35 cited
A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds
Journal of the ACM·2017· 16 cited
1.5-approximation algorithm for the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml18" display="inline" overflow="scroll" altimg="si1.gif"><mml:mn>2</mml:mn></mml:math>-Convex Recoloring problem
Discrete Applied Mathematics·2017· 3 cited
A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds
2016· 9 cited
A Constant Factor Approximation Algorithm for the Storage Allocation Problem
Algorithmica·2016· 7 cited
A Distributed $(2+ε)$-Approximation for Vertex Cover in $O(\logΔ/ε\log\logΔ)$ Rounds
arXiv (Cornell University)·2016Open Access
A Distributed $(2+\epsilon)$-Approximation for Vertex Cover in $O(\log{\Delta}/\epsilon\log\log{\Delta})$ Rounds
arXiv (Cornell University)·2016· 3 citedOpen Access
1.5-Approximation Algorithm for the 2-Convex Recoloring Problem
Lecture notes in computer science·2016· 4 cited
Bandwidth allocation in cellular networks with multiple interferences
Discrete Applied Mathematics·2015· 5 cited
Random Algorithms for the Loop Cutset Problem
arXiv (Cornell University)·2014· 15 citedOpen Access
A constant factor approximation algorithm for the storage allocation problem
2013· 3 cited
A note on multicovering with disks
Computational Geometry·2012· 21 cited
Cell Selection in 4G Cellular Networks
IEEE Transactions on Mobile Computing·2012· 46 cited
Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs
Lecture notes in computer science·2012· 8 cited
Minimum vertex cover in rectangle graphs
Computational Geometry·2011· 4 cited
Bandwidth allocation in cellular networks with multiple interferences
2010
page 1 of 5Next →

Frequent Co-authors

Dror Rawitz(14), Joseph Naor(7), Alon Itai(4), Ari Freund(4), Oded Goldreich(3), Shimon Even(3), Dan Geiger(3), Amotz Bar-Noy(2), Baruch Schieber(2), Ron M. Roth(2), Amos Israeli(2), Magnús M. Halldórsson(2), Hadas Shachnai(2), Keren Bendel(2), Craig Gotsman(2), Guy Even(2), David Amzallag(2), Gabriel Scalosub(2), Keren Censor-Hillel(2), Gregory Schwartzman(2)