What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- 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)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Approximation algorithm (55.43%)
- Combinatorics (50.00%)
- Discrete mathematics (39.13%)
What were the highlights of his more recent work (between 2010-2020)?
- Combinatorics (50.00%)
- Approximation algorithm (55.43%)
- Vertex cover (27.17%)
In recent papers he was focusing on the following fields of study:
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.
Between 2010 and 2020, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
