- Home
- Best Scientists - Computer Science
- Reuven Bar-Yehuda

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
30
Citations
5,418
72
World Ranking
10089
National Ranking
173

- Computer network
- Algorithm
- Combinatorics

Reuven Bar-Yehuda spends much of his time researching Discrete mathematics, Combinatorics, Randomized algorithm, Approximation algorithm and Time complexity. His work on Distributed algorithm expands to the thematically related Discrete mathematics. His research in Independent set, Vertex cover, Feedback vertex set and Real line are components of Combinatorics.

The study incorporates disciplines such as Binary logarithm, Loop, Inference and Greedy algorithm in addition to Randomized algorithm. His Approximation algorithm research integrates issues from Max-min fairness, Bandwidth allocation, Rate-monotonic scheduling and Two-level scheduling. His Time complexity study integrates concerns from other disciplines, such as Upper and lower bounds, Exponential function and Logarithm.

- On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization (421 citations)
- A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem (376 citations)
- A linear-time approximation algorithm for the weighted vertex cover problem (368 citations)

Reuven Bar-Yehuda mostly deals with Approximation algorithm, Combinatorics, Discrete mathematics, Vertex cover and Algorithm. His Approximation algorithm study combines topics in areas such as Feedback vertex set, Scheduling, Bounded function and Time complexity. The Combinatorics study combines topics in areas such as Upper and lower bounds and Constant.

His work deals with themes such as Minimum weight, Parameterized complexity and Greedy algorithm, which intersect with Discrete mathematics. The concepts of his Vertex cover study are interwoven with issues in Covering problems, Set cover problem, Intersection, Edge cover and Planar graph. In general Algorithm, his work in Dynamic programming is often linked to Line, Transistor array and Electronic circuit linking many areas of study.

- Approximation algorithm (55.43%)
- Combinatorics (50.00%)
- Discrete mathematics (39.13%)

- Combinatorics (50.00%)
- Approximation algorithm (55.43%)
- Vertex cover (27.17%)

His primary areas of investigation include Combinatorics, Approximation algorithm, Vertex cover, Upper and lower bounds and Discrete mathematics. Combinatorics is frequently linked to Constant in his study. His Approximation algorithm study is related to the wider topic of Mathematical optimization.

His Vertex cover study incorporates themes from Intersection, Chordal graph, Largest empty rectangle and Planar graph. His biological study focuses on Intersection graph. His Time complexity research is multidisciplinary, incorporating elements of Model of computation and Computation.

- Cell Selection in 4G Cellular Networks (37 citations)
- Distributed Approximation of Maximum Independent Set and Maximum Matching (23 citations)
- A note on multicovering with disks (10 citations)

- Computer network
- Algorithm
- Combinatorics

Reuven Bar-Yehuda focuses on Combinatorics, Approximation algorithm, Minimum weight, Constant and Maximal independent set. His Upper and lower bounds research extends to Combinatorics, which is thematically connected. His study in Minimum weight is interdisciplinary in nature, drawing from both Point, Plane, Discrete mathematics and Piecewise constant approximation.

Reuven Bar-Yehuda combines subjects such as Matching, Reduction and Degree with his study of Constant. His research integrates issues of Distributed algorithm, Independent set, Mathematical optimization and Binary logarithm in his study of Maximal independent set. He interconnects Overhead and Reduction in the investigation of issues within Distributed algorithm.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

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.

Journal of Computer and System Sciences **(1992)**

652 Citations

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

Reuven Bar-Yehuda;Shimon Even.

workshop on graph-theoretic concepts in computer science **(1985)**

583 Citations

A unified approach to approximating resource allocation and scheduling

Amotz Bar-Noy;Reuven Bar-Yehuda;Ari Freund;Joseph (Seffi) Naor.

Journal of the ACM **(2001)**

547 Citations

A linear-time approximation algorithm for the weighted vertex cover problem

Reuven Bar-Yehuda;Shimon Even.

Journal of Algorithms **(1981)**

533 Citations

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

Reuven Bar-Yehuda;Dan Geiger.

SIAM Journal on Computing **(1998)**

209 Citations

Scheduling Split Intervals

R. Bar-Yehuda;M. M. Halldórsson.

SIAM Journal on Computing **(2006)**

202 Citations

On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization

Reuven Bar-Yehuda;Oded Goldreich;Alon Itai.

principles of distributed computing **(1987)**

186 Citations

Randomized algorithms for the loop cutset problem

Ann Becker;Reuven Bar-Yehuda;Dan Geiger.

Journal of Artificial Intelligence Research **(2000)**

170 Citations

Multiple communication im multihop radio networks

Reuven Bar-Yehuda;Amos Israeli;Alon Itai.

SIAM Journal on Computing **(1993)**

162 Citations

Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004

Reuven Bar-Yehuda;Keren Bendel;Ari Freund;Dror Rawitz.

ACM Computing Surveys **(2004)**

142 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Technion – Israel Institute of Technology

Tel Aviv University

Technion – Israel Institute of Technology

Technion – Israel Institute of Technology

Weizmann Institute of Science

Technion – Israel Institute of Technology

Technion – Israel Institute of Technology

Technion – Israel Institute of Technology

New Jersey Institute of Technology

New Jersey Institute of Technology

Something went wrong. Please try again later.