D-Index & Metrics Best Publications

D-Index & Metrics

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

Overview

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.

Best Publications

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

Best Scientists Citing Guy Kortsarz

Samir Khuller

Samir Khuller

Northwestern University

Publications: 40

MohammadTaghi Hajiaghayi

MohammadTaghi Hajiaghayi

University of Maryland, College Park

Publications: 38

David Peleg

David Peleg

Weizmann Institute of Science

Publications: 35

Chandra Chekuri

Chandra Chekuri

University of Illinois at Urbana-Champaign

Publications: 33

Anupam Gupta

Anupam Gupta

Carnegie Mellon University

Publications: 30

R. Ravi

R. Ravi

Carnegie Mellon University

Publications: 29

Dániel Marx

Dániel Marx

Saarland University

Publications: 20

Andrzej Pelc

Andrzej Pelc

Université du Québec en Outaouais

Publications: 19

Jin-Kao Hao

Jin-Kao Hao

University of Angers

Publications: 19

Moses Charikar

Moses Charikar

Stanford University

Publications: 18

Michael Elkin

Michael Elkin

Ben-Gurion University of the Negev

Publications: 18

Michael A. Henning

Michael A. Henning

University of Johannesburg

Publications: 17

Saket Saurabh

Saket Saurabh

Institute of Mathematical Sciences

Publications: 15

Anders Yeo

Anders Yeo

University of Johannesburg

Publications: 15

Daniel Lokshtanov

Daniel Lokshtanov

University of California, Santa Barbara

Publications: 15

Fabrizio Grandoni

Fabrizio Grandoni

Dalle Molle Institute for Artificial Intelligence Research

Publications: 15

Trending Scientists

Zhengdong Lu

Zhengdong Lu

Huawei Technologies (China)

Michel Versluis

Michel Versluis

University of Twente

Guo Chen

Guo Chen

UNSW Sydney

Mingzhu Liu

Mingzhu Liu

Lanzhou University

Hongwei Hou

Hongwei Hou

Zhengzhou University

Xiaoming Xie

Xiaoming Xie

Chinese Academy of Sciences

Vitali F. Nesterenko

Vitali F. Nesterenko

University of California, San Diego

Nora L. V. Lapitan

Nora L. V. Lapitan

Colorado State University

Laura Manuelidis

Laura Manuelidis

Yale University

Ilya Raskin

Ilya Raskin

Rutgers, The State University of New Jersey

Patricia E. Klein

Patricia E. Klein

Texas A&M University

Thomas J. Coates

Thomas J. Coates

University of California, Los Angeles

Albert J. Mills

Albert J. Mills

Saint Mary's University

David L. Hull

David L. Hull

Northwestern University

Markus Roth

Markus Roth

Karlsruhe Institute of Technology

Something went wrong. Please try again later.