default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReuven Bar-Yehuda
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c34]Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai
, Sriram V. Pemmaraju:
Distributed Approximation on Power Graphs. PODC 2020: 501-510- [i6]Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju:
Distributed Approximation on Power Graphs. CoRR abs/2006.03746 (2020)
2010 – 2019
- 2018
- [j47]Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz:
1.5-approximation algorithm for the 2-Convex Recoloring problem. Discret. Appl. Math. 246: 2-11 (2018) - [j46]Reuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz:
Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks. SIAM J. Discret. Math. 32(3): 1903-1921 (2018) - 2017
- [j45]Reuven Bar-Yehuda, Michael Beder, Dror Rawitz:
A Constant Factor Approximation Algorithm for the Storage Allocation Problem. Algorithmica 77(4): 1105-1127 (2017) - [j44]Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman:
A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds. J. ACM 64(3): 23:1-23:11 (2017) - [c33]Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman:
Distributed Approximation of Maximum Independent Set and Maximum Matching. PODC 2017: 165-174 - [i5]Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman:
Distributed Approximation of Maximum Independent Set and Maximum Matching. CoRR abs/1708.00276 (2017) - 2016
- [c32]Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman:
A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds. PODC 2016: 3-8 - [i4]Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman:
A Distributed $(2+ε)$-Approximation for Vertex Cover in $O(\logΔ/ε\log\logΔ)$ Rounds. CoRR abs/1602.03713 (2016) - 2015
- [j43]Reuven Bar-Yehuda, Gleb Polevoy, Dror Rawitz:
Bandwidth allocation in cellular networks with multiple interferences. Discret. Appl. Math. 194: 23-36 (2015) - [c31]Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz:
1.5-Approximation Algorithm for the 2-Convex Recoloring Problem. IWOCA 2015: 299-311 - 2014
- [i3]Ann Becker, Reuven Bar-Yehuda, Dan Geiger:
Random Algorithms for the Loop Cutset Problem. CoRR abs/1408.1483 (2014) - 2013
- [j42]Reuven Bar-Yehuda, Dror Rawitz:
A note on multicovering with disks. Comput. Geom. 46(3): 394-399 (2013) - [j41]David Amzallag, Reuven Bar-Yehuda, Danny Raz, Gabriel Scalosub:
Cell Selection in 4G Cellular Networks. IEEE Trans. Mob. Comput. 12(7): 1443-1455 (2013) - [c30]Reuven Bar-Yehuda, Michael Beder, Dror Rawitz:
A constant factor approximation algorithm for the storage allocation problem: extended abstract. SPAA 2013: 204-213 - 2012
- [c29]Reuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz:
Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs. ICALP (2) 2012: 416-427 - 2011
- [j40]Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Minimum vertex cover in rectangle graphs. Comput. Geom. 44(6-7): 356-364 (2011) - [i2]Reuven Bar-Yehuda, Ann Becker, Dan Geiger:
Randomized Algorithms for the Loop Cutset Problem. CoRR abs/1106.0225 (2011) - 2010
- [j39]Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications. SIAM J. Discret. Math. 24(1): 287-300 (2010) - [j38]Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz:
Approximation of Partial Capacitated Vertex Cover. SIAM J. Discret. Math. 24(4): 1441-1469 (2010) - [c28]Reuven Bar-Yehuda, Gleb Polevoy, Dror Rawitz:
Bandwidth allocation in cellular networks with multiple interferences. DIALM-PODC 2010: 33-42 - [c27]Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Minimum Vertex Cover in Rectangle Graphs. ESA (1) 2010: 255-266 - [i1]Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Minimum Vertex Cover in Rectangle Graphs. CoRR abs/1001.3332 (2010)
2000 – 2009
- 2009
- [j37]Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz:
Resource Allocation in Bounded Degree Trees. Algorithmica 54(1): 89-106 (2009) - [j36]Ron Zohar, Reuven Bar-Yehuda:
The maximum weight hierarchy matching problem. Inf. Fusion 10(2): 198-206 (2009) - [c26]Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications. WAOA 2009: 13-24 - 2008
- [j35]Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz:
Improved Approximation Algorithm for Convex Recoloring of Trees. Theory Comput. Syst. 43(1): 3-18 (2008) - [c25]David Amzallag, Reuven Bar-Yehuda, Danny Raz, Gabriel Scalosub:
Cell Selection in 4G Cellular Networks. INFOCOM 2008: 700-708 - 2007
- [j34]Reuven Bar-Yehuda, Jonathan Laserson:
Exploiting locality: approximating sorting buffers. J. Discrete Algorithms 5(4): 729-738 (2007) - [c24]Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz:
Approximation of Partial Capacitated Vertex Cover. ESA 2007: 335-346 - 2006
- [j33]Reuven Bar-Yehuda, Dror Rawitz:
Using fractional primal-dual to schedule split intervals with demands. Discret. Optim. 3(4): 275-287 (2006) - [j32]Reuven Bar-Yehuda, Irad Yavneh:
A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping. J. Graph Algorithms Appl. 10(2): 123-139 (2006) - [j31]Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira:
Scheduling Split Intervals. SIAM J. Comput. 36(1): 1-15 (2006) - [c23]Reuven Bar-Yehuda, Dror Rawitz:
A Tale of Two Methods. Essays in Memory of Shimon Even 2006: 196-217 - [c22]Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz:
Resource Allocation in Bounded Degree Trees. ESA 2006: 64-75 - 2005
- [j30]Reuven Bar-Yehuda, Guy Even, Shimon Shahar:
On approximating a geometric prize-collecting traveling salesman problem with time windows. J. Algorithms 55(1): 76-92 (2005) - [j29]Reuven Bar-Yehuda, Dror Rawitz:
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique. SIAM J. Discret. Math. 19(3): 762-797 (2005) - [c21]Reuven Bar-Yehuda, Dror Rawitz:
Using Fractional Primal-Dual to Schedule Split Intervals with Demands. ESA 2005: 714-725 - [c20]Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz:
Improved Approximation Algorithm for Convex Recoloring of Trees. WAOA 2005: 55-68 - [c19]Reuven Bar-Yehuda, Jonathan Laserson:
Exploiting Locality: Approximating Sorting Buffers. WAOA 2005: 69-81 - 2004
- [j28]Reuven Bar-Yehuda, Keren Bendel, Ari Freund, Dror Rawitz:
Local ratio: A unified framework for approxmation algrithms in memoriam: Shimon Even 1935-2004. ACM Comput. Surv. 36(4): 422-463 (2004) - [j27]Reuven Bar-Yehuda, Zehavit Kehat:
Approximating the dense set-cover problem. J. Comput. Syst. Sci. 69(4): 547-561 (2004) - [j26]Reuven Bar-Yehuda, Dror Rawitz:
Local ratio with negative weights. Oper. Res. Lett. 32(6): 540-546 (2004) - 2003
- [c18]Reuven Bar-Yehuda, Guy Even, Shimon Shahar:
On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract. ESA 2003: 55-66 - 2002
- [j25]Reuven Bar-Yehuda, Dror Rawitz:
Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property. J. Algorithms 42(1): 20-40 (2002) - [c17]Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira:
Scheduling split intervals. SODA 2002: 732-741 - 2001
- [j24]Reuven Bar-Yehuda, Dror Rawitz:
Efficient Algorithms for Integer Programs with Two Variables per Constraint. Algorithmica 29(4): 595-609 (2001) - [j23]Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber:
A unified approach to approximating resource allocation and scheduling. J. ACM 48(5): 1069-1090 (2001) - [j22]Reuven Bar-Yehuda:
Using Homogeneous Weights for Approximating the Partial Cover Problem. J. Algorithms 39(2): 137-144 (2001) - [j21]Reuven Bar-Yehuda, Guy Even, Jon Feldman, Joseph Naor:
Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems. J. Graph Algorithms Appl. 5(4): 1-27 (2001) - [c16]Reuven Bar-Yehuda, Dror Rawitz:
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique. RANDOM-APPROX 2001: 24-35 - 2000
- [j20]Reuven Bar-Yehuda:
One for the Price of Two: a Unified Approach for Approximating Covering Problems. Algorithmica 27(2): 131-144 (2000) - [j19]Ann Becker, Reuven Bar-Yehuda, Dan Geiger:
Randomized Algorithms for the Loop Cutset Problem. J. Artif. Intell. Res. 12: 219-234 (2000) - [c15]Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber:
A unified approach to approximating resource allocation and scheduling. STOC 2000: 735-744
1990 – 1999
- 1999
- [c14]Reuven Bar-Yehuda, Dror Rawitz:
Efficient Algorithms for Integer Programs with Two Variables per Constraint. ESA 1999: 116-126 - [c13]Yohai Makbily, Craig Gotsman, Reuven Bar-Yehuda:
Geometric algorithms for message filtering in decentralized virtual environments. SI3D 1999: 39-46 - [c12]Reuven Bar-Yehuda:
Using Homogenous Weights for Approximating the Partial Cover Problem. SODA 1999: 71-75 - [c11]Ann Becker, Reuven Bar-Yehuda, Dan Geiger:
Random Algorithms for the Loop Cutset Problem. UAI 1999: 49-56 - 1998
- [j18]Reuven Bar-Yehuda, Sergio Fogel:
Partitioning a Sequence into Few Monotone Subsequences. Acta Informatica 35(5): 421-440 (1998) - [j17]Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth:
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. SIAM J. Comput. 27(4): 942-959 (1998) - [c10]Reuven Bar-Yehuda:
One for the Price of Two: A Unified Approach for Approximating Covering Problems. APPROX 1998: 49-62 - 1997
- [j16]Shmuel Cohen, Gershon Elber, Reuven Bar-Yehuda:
Matching of freeform curves. Comput. Aided Des. 29(5): 369-378 (1997) - 1996
- [j15]Reuven Bar-Yehuda, E. Ben-Hanoch:
A linear time algorithm for covering simple polygons with similar rectangles. Int. J. Comput. Geom. Appl. 6(1): 79-102 (1996) - [j14]Reuven Bar-Yehuda, Craig Gotsman:
Time/Space Tradeoffs for Polygon Mesh Rendering. ACM Trans. Graph. 15(2): 141-152 (1996) - 1994
- [j13]Reuven Bar-Yehuda, Sergio Fogel:
Variations on Ray Shooting. Algorithmica 11(2): 133-145 (1994) - [j12]Reuven Bar-Yehuda, Bernard Chazelle:
Triangulating disjoint Jordan chains. Int. J. Comput. Geom. Appl. 4(4): 475-481 (1994) - [c9]Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth:
Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. SODA 1994: 344-354 - 1993
- [j11]Reuven Bar-Yehuda, Amos Israeli, Alon Itai:
Multiple Communication in Multihop Radio Networks. SIAM J. Comput. 22(4): 875-887 (1993) - [j10]Reuven Bar-Yehuda, Tuvi Etzion, Shlomo Moran:
Rotating-Table Games and Derivatives of Words. Theor. Comput. Sci. 108(2): 311-329 (1993) - [j9]Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky:
Privacy, additional information and communication. IEEE Trans. Inf. Theory 39(6): 1930-1943 (1993) - [c8]Reuven Bar-Yehuda, Alon Efrat, Alon Itai:
A Simple Algorithm for Maintaining the Center of a Planar Point-set. CCCG 1993: 252-257 - 1992
- [j8]Reuven Bar-Yehuda, Tuvi Etzion:
Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks. Discret. Appl. Math. 37/38: 29-43 (1992) - [j7]Reuven Bar-Yehuda, Oded Goldreich, Alon Itai:
On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization. J. Comput. Syst. Sci. 45(1): 104-126 (1992) - 1991
- [j6]Reuven Bar-Yehuda, Oded Goldreich, Alon Itai:
Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection. Distributed Comput. 5: 67-71 (1991) - 1990
- [c7]Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz:
Privacy, Additional Information, and Communication. SCT 1990: 55-65
1980 – 1989
- 1989
- [j5]Reuven Bar-Yehuda, Jack A. Feldman, Ron Y. Pinter, Shmuel Wimer:
Depth-first-search and dynamic programming algorithms for efficient CMOS cell generation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(7): 737-743 (1989) - [c6]Reuven Bar-Yehuda, Amos Israeli:
Multiple Communication in Multi-Hop Radio Networks. PODC 1989: 329-338 - [c5]Reuven Bar-Yehuda, Oded Goldreich, Alon Itai:
Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection. WDAG 1989: 24-32 - 1988
- [j4]Reuven Bar-Yehuda, Shay Kutten:
Fault Tolerant Distributed Majority Commitment. J. Algorithms 9(4): 568-582 (1988) - 1987
- [c4]Reuven Bar-Yehuda, Oded Goldreich, Alon Itai:
On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization. PODC 1987: 98-108 - [c3]Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks:
Making Distributed Spanning Tree Algorithms Fault-Resilient. STACS 1987: 432-444 - 1984
- [j3]Reuven Bar-Yehuda, Shlomo Moran:
On approximation problems related to the independent set and vertex cover problems. Discret. Appl. Math. 9(1): 1-10 (1984) - 1983
- [c2]Reuven Bar-Yehuda, Shimon Even:
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem. WG 1983: 17-28 - 1982
- [j2]Reuven Bar-Yehuda, Uzi Vishkin:
Complexity of Finding k-Path-Free Dominating Sets in Graphs. Inf. Process. Lett. 14(5): 228-232 (1982) - [c1]Reuven Bar-Yehuda, Shimon Even:
On Approximating a Vertex Cover for Planar Graphs. STOC 1982: 303-309 - 1981
- [j1]Reuven Bar-Yehuda, Shimon Even:
A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem. J. Algorithms 2(2): 198-203 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
