default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
- Reuven Bar-Yehuda
Technion - Israel Institute of Technology, Haifa, Israel
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 87 matches
- 2020
- Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju:
Distributed Approximation on Power Graphs. PODC 2020: 501-510 - Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju:
Distributed Approximation on Power Graphs. CoRR abs/2006.03746 (2020) - 2018
- Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz:
1.5-approximation algorithm for the 2-Convex Recoloring problem. Discret. Appl. Math. 246: 2-11 (2018) - 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
- Reuven Bar-Yehuda, Michael Beder, Dror Rawitz:
A Constant Factor Approximation Algorithm for the Storage Allocation Problem. Algorithmica 77(4): 1105-1127 (2017) - 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) - Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman:
Distributed Approximation of Maximum Independent Set and Maximum Matching. PODC 2017: 165-174 - 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
- 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 - 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
- Reuven Bar-Yehuda, Gleb Polevoy, Dror Rawitz:
Bandwidth allocation in cellular networks with multiple interferences. Discret. Appl. Math. 194: 23-36 (2015) - Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz:
1.5-Approximation Algorithm for the 2-Convex Recoloring Problem. IWOCA 2015: 299-311 - 2014
- Ann Becker, Reuven Bar-Yehuda, Dan Geiger:
Random Algorithms for the Loop Cutset Problem. CoRR abs/1408.1483 (2014) - 2013
- Reuven Bar-Yehuda, Dror Rawitz:
A note on multicovering with disks. Comput. Geom. 46(3): 394-399 (2013) - David Amzallag, Reuven Bar-Yehuda, Danny Raz, Gabriel Scalosub:
Cell Selection in 4G Cellular Networks. IEEE Trans. Mob. Comput. 12(7): 1443-1455 (2013) - Reuven Bar-Yehuda, Michael Beder, Dror Rawitz:
A constant factor approximation algorithm for the storage allocation problem: extended abstract. SPAA 2013: 204-213 - 2012
- 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
- Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Minimum vertex cover in rectangle graphs. Comput. Geom. 44(6-7): 356-364 (2011) - Reuven Bar-Yehuda, Ann Becker, Dan Geiger:
Randomized Algorithms for the Loop Cutset Problem. CoRR abs/1106.0225 (2011) - 2010
- 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) - 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) - Reuven Bar-Yehuda, Gleb Polevoy, Dror Rawitz:
Bandwidth allocation in cellular networks with multiple interferences. DIALM-PODC 2010: 33-42 - Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Minimum Vertex Cover in Rectangle Graphs. ESA (1) 2010: 255-266 - Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Minimum Vertex Cover in Rectangle Graphs. CoRR abs/1001.3332 (2010) - 2009
- Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz:
Resource Allocation in Bounded Degree Trees. Algorithmica 54(1): 89-106 (2009) - Ron Zohar, Reuven Bar-Yehuda:
The maximum weight hierarchy matching problem. Inf. Fusion 10(2): 198-206 (2009) - 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
- Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz:
Improved Approximation Algorithm for Convex Recoloring of Trees. Theory Comput. Syst. 43(1): 3-18 (2008) - David Amzallag, Reuven Bar-Yehuda, Danny Raz, Gabriel Scalosub:
Cell Selection in 4G Cellular Networks. INFOCOM 2008: 700-708 - 2007
- Reuven Bar-Yehuda, Jonathan Laserson:
Exploiting locality: approximating sorting buffers. J. Discrete Algorithms 5(4): 729-738 (2007)
skipping 57 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-14 12:27 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint