- Home
- Best Scientists - Computer Science
- Guy Even

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
33
Citations
4,519
194
World Ranking
8731
National Ranking
155

- Algorithm
- Operating system
- Programming language

Guy Even mainly focuses on Combinatorics, Approximation algorithm, Discrete mathematics, Directed graph and Algorithm. His Combinatorics research incorporates themes from Upper and lower bounds and Theory of computation. Guy Even focuses mostly in the field of Approximation algorithm, narrowing it down to matters related to Linear programming and, in some cases, Set, Discrete geometry and Probability measure.

As part of one scientific family, he deals mainly with the area of Discrete mathematics, narrowing it down to issues related to the Computational complexity theory, and often State and Asynchronous communication. His Directed graph research is multidisciplinary, incorporating perspectives in Feedback vertex set, Graph theory, Graph and Feedback arc set. His Algorithm research is multidisciplinary, incorporating elements of Mathematical optimization and Rounding.

- Approximating Minimum Feedback Sets and Multicuts in Directed Graphs (275 citations)
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks (188 citations)
- Observability of Boolean networks: A graph-theoretic approach (148 citations)

His primary areas of study are Combinatorics, Discrete mathematics, Algorithm, Approximation algorithm and Upper and lower bounds. Guy Even merges many fields, such as Combinatorics and Constant, in his writings. His Discrete mathematics research includes elements of Linear programming and Decoding methods.

Guy Even combines subjects such as Set, Rounding and Graph partition with his study of Algorithm. His study in Approximation algorithm is interdisciplinary in nature, drawing from both Computational complexity theory, Steiner tree problem, Graph theory and Scheduling, Job shop scheduling. In his study, Load balancing is inextricably linked to Bin, which falls within the broad field of Upper and lower bounds.

- Combinatorics (37.29%)
- Discrete mathematics (34.46%)
- Algorithm (24.29%)

- Discrete mathematics (34.46%)
- Combinatorics (37.29%)
- Algorithm (24.29%)

Guy Even focuses on Discrete mathematics, Combinatorics, Algorithm, Binary logarithm and Online algorithm. The study incorporates disciplines such as Decoding methods, Code word, Universal code, Polynomial code and Data structure in addition to Discrete mathematics. His Combinatorics study is mostly concerned with Graph and Girth.

His studies in Algorithm integrate themes in fields like Space and Deep learning. Guy Even regularly ties together related areas like Upper and lower bounds in his Binary logarithm studies. His work deals with themes such as Deterministic algorithm, Competitive analysis, Network packet, Throughput and Randomized algorithm, which intersect with Online algorithm.

- An Approximation Algorithm for Path Computation and Function Placement in SDNs (36 citations)
- Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs (28 citations)
- Minimal controllability of conjunctive Boolean networks is NP-complete (20 citations)

- Algorithm
- Operating system
- Programming language

Guy Even mostly deals with Graph, Combinatorics, Distributed algorithm, Discrete mathematics and Bounded function. His work in Binary logarithm and Minimum weight are all subfields of Combinatorics research. His work on Set expands to the thematically related Discrete mathematics.

His Bounded function research integrates issues from Stateless protocol, Algorithm and Maximal independent set. His work in Algorithm tackles topics such as Graph coloring which are related to areas like Randomized algorithm. His Upper and lower bounds research includes themes of Approximation algorithm, Path, Task, Node and Function.

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.

Approximating Minimum Feedback Sets and Multicuts in Directed Graphs

Guy Even;Joseph Naor;Baruch Schieber;Madhu Sudan.

Algorithmica **(1998)**

423 Citations

Divide-and-conquer approximation algorithms via spreading metrics

Guy Even;Joseph Seffi Naor;Satish Rao;Baruch Schieber.

Journal of the ACM **(2000)**

278 Citations

Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks

Guy Even;Zvi Lotker;Dana Ron;Shakhar Smorodinsky.

SIAM Journal on Computing **(2004)**

240 Citations

Fast Approximate Graph Partitioning Algorithms

Guy Even.

SIAM Journal on Computing **(1999)**

196 Citations

Observability of Boolean networks: A graph-theoretic approach

Dmitriy Laschov;Michael Margaliot;Guy Even.

Automatica **(2013)**

192 Citations

A comparison of three rounding algorithms for IEEE floating-point multiplication

G. Even;P.-M. Seidel.

IEEE Transactions on Computers **(2000)**

160 Citations

Delay-optimized implementation of IEEE floating-point addition

P.-M. Seidel;G. Even.

IEEE Transactions on Computers **(2004)**

146 Citations

Hitting sets when the VC-dimension is small

Guy Even;Dror Rawitz;Shimon (Moni) Shahar.

Information Processing Letters **(2005)**

136 Citations

Graph Algorithms: Frontmatter

Shimon Even;Guy Even.

**(2011)**

128 Citations

Lower bounds for sampling algorithms for estimating the average

Ran Canetti;Guy Even;Oded Goldreich.

Information Processing Letters **(1995)**

112 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:

New Jersey Institute of Technology

Technion – Israel Institute of Technology

Technion – Israel Institute of Technology

Tel Aviv University

Rutgers, The State University of New Jersey

Technion – Israel Institute of Technology

University of Vienna

University of California, Berkeley

Reykjavík University

Weizmann Institute of Science

University of California, Irvine

Google (United States)

ETH Zurich

Lawrence Livermore National Laboratory

United States Air Force Research Laboratory

University of Sydney

INRAE : Institut national de recherche pour l'agriculture, l'alimentation et l'environnement

Johns Hopkins University School of Medicine

University of British Columbia

University of Tennessee at Knoxville

University of Arizona

National Science Foundation

New York University

University of Geneva

Harvard University

Emory University

Something went wrong. Please try again later.