- Home
- Best Scientists - Computer Science
- Guy Kortsarz

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
35
Citations
5,207
134
World Ranking
5999
National Ranking
2911

- Combinatorics
- Graph theory
- Discrete mathematics

Guy Kortsarz spends much of his time researching Combinatorics, Discrete mathematics, Approximation algorithm, Graph theory and Logarithm. Guy Kortsarz connects Combinatorics with Bounded function in his study. His studies link Theory of computation with Discrete mathematics.

His Approximation algorithm study combines topics from a wide range of disciplines, such as Time complexity, Greedy algorithm, Graph, Minimum weight and Spanning tree. His work in Minimum weight tackles topics such as Steiner tree problem which are related to areas like Linear programming and Algorithm. His research in Graph theory intersects with topics in Subgraph isomorphism problem and Graph factorization.

- The Dense k -Subgraph Problem (496 citations)
- Approximating the Domatic Number (180 citations)
- How to Allocate Network Centers (145 citations)

The scientist’s investigation covers issues in Combinatorics, Approximation algorithm, Discrete mathematics, Graph and Steiner tree problem. His Combinatorics research focuses on Binary logarithm, Bipartite graph, Hardness of approximation, Vertex and Directed graph. His work in Bipartite graph addresses subjects such as Independent set, which are connected to disciplines such as Graph coloring.

His research integrates issues of Time complexity, Graph and Vertex in his study of Approximation algorithm. His research combines Graph theory and Discrete mathematics. His study in Steiner tree problem is interdisciplinary in nature, drawing from both Arborescence, Path, Tree and Degree.

- Combinatorics (80.28%)
- Approximation algorithm (56.34%)
- Discrete mathematics (48.83%)

- Combinatorics (80.28%)
- Approximation algorithm (56.34%)
- Discrete mathematics (48.83%)

His scientific interests lie mostly in Combinatorics, Approximation algorithm, Discrete mathematics, Steiner tree problem and Binary logarithm. His Graph, Bipartite graph and Exponential time hypothesis study, which is part of a larger body of work in Combinatorics, is frequently linked to Bounded function and Cover, bridging the gap between disciplines. His studies in Approximation algorithm integrate themes in fields like Hypergraph, Path, Graph and Tree.

His Path research includes themes of Arborescence and Vertex. His Steiner tree problem research includes elements of Degree and Polymatroid. His studies deal with areas such as Spanner and Maximum cut as well as Binary logarithm.

- From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More (44 citations)
- A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2 (27 citations)
- The Densest $k$-Subhypergraph Problem (20 citations)

- Combinatorics
- Discrete mathematics
- Graph theory

The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Approximation algorithm, Graph and Disjoint sets. Guy Kortsarz interconnects Tree and Relaxation in the investigation of issues within Combinatorics. His research in Discrete mathematics tackles topics such as Algorithm which are related to areas like Mathematical optimization.

The concepts of his Approximation algorithm study are interwoven with issues in Hypergraph and Minimization problem. His study on Connectivity is often connected to Soundness and Long code as part of broader study in Graph. His Disjoint sets research is multidisciplinary, incorporating elements of Time complexity and Undirected graph.

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.

The Dense k -Subgraph Problem

Uriel Feige;Guy Kortsarz;David Peleg.

Algorithmica **(2001)**

612 Citations

Approximating the Domatic Number

Uriel Feige;Magnús M. Halldórsson;Guy Kortsarz;Aravind Srinivasan.

SIAM Journal on Computing **(2003)**

244 Citations

How to Allocate Network Centers

J. Barilan;G. Kortsarz;D. Peleg.

Journal of Algorithms **(1993)**

198 Citations

On choosing a dense subgraph

G. Kortsarz;D. Peleg.

foundations of computer science **(1993)**

184 Citations

Approximating Minimum-Cost Connectivity Problems.

Guy Kortsarz;Zeev Nutov.

Handbook of Approximation Algorithms and Metaheuristics **(2007)**

147 Citations

Generating Sparse 2-Spanners

G. Kortsarz;D. Peleg.

Journal of Algorithms **(1994)**

129 Citations

On the hardness of approximating spanners

Guy Kortsarz.

Algorithmica **(2001)**

122 Citations

Hardness of Approximation for Vertex-Connectivity Network Design Problems

Guy Kortsarz;Robert Krauthgamer;James R. Lee.

SIAM Journal on Computing **(2004)**

115 Citations

Approximating the weight of shallow Steiner trees

Guy Kortsarz;David Peleg.

Discrete Applied Mathematics **(1999)**

105 Citations

Minimum Color Sum of Bipartite Graphs

Amotz Bar-Noy;Guy Kortsarz.

Journal of Algorithms **(1998)**

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

University of Maryland, College Park

Reykjavík University

Weizmann Institute of Science

Ben-Gurion University of the Negev

Weizmann Institute of Science

University of California, Los Angeles

Tel Aviv University

Google (United States)

University of Maryland, College Park

University of Udine

Huawei Technologies (China)

University of Twente

UNSW Sydney

Lanzhou University

Zhengzhou University

Chinese Academy of Sciences

University of California, San Diego

TU Wien

Colorado State University

Yale University

Rutgers, The State University of New Jersey

Texas A&M University

University of California, Los Angeles

Saint Mary's University

Northwestern University

Karlsruhe Institute of Technology

Something went wrong. Please try again later.