What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- The Dense k -Subgraph Problem (496 citations)
- Approximating the Domatic Number (180 citations)
- How to Allocate Network Centers (145 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (80.28%)
- Approximation algorithm (56.34%)
- Discrete mathematics (48.83%)
What were the highlights of his more recent work (between 2013-2020)?
- Combinatorics (80.28%)
- Approximation algorithm (56.34%)
- Discrete mathematics (48.83%)
In recent papers he was focusing on the following fields of study:
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.
Between 2013 and 2020, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
