World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
45
Citations
6223
World Ranking
7319
National Ranking
3188

Overview

Guy Kortsarz is affiliated with Rutgers, The State University of New Jersey in the United States. Their research primarily focuses on computer science, with a strong concentration in computational theory and mathematics. Their work extends across a range of related subfields, including computer networks and communications, artificial intelligence, electrical and electronic engineering, and computer graphics and computer-aided design.

The main topics covered in their research include complexity and algorithms in graphs, advanced graph theory research, optimization and search problems, cryptography and data security, computational geometry and mesh generation, optimization and packing problems, and mobile ad hoc networks.

Kortsarz has contributed to a number of papers, with selected recent publications as follows:

  • "From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More", 2020, SIAM Journal on Computing
  • "Approximation algorithms for connected maximum cut and related problems", 2020, Theoretical Computer Science
  • "Approximating activation edge-cover and facility location problems", 2022, Theoretical Computer Science
  • "Approximating Spanners and Directed Steiner Forest", 2020, ACM Transactions on Algorithms
  • "Improved Approximations for Relative Survivable Network Design", 2023, arXiv (Cornell University)

The scientist frequently publishes in several venues, most notably arXiv (Cornell University), Theoretical Computer Science, Algorithmica, SIAM Journal on Computing, and ACM Transactions on Algorithms.

  • arXiv (Cornell University)
  • Theoretical Computer Science
  • Algorithmica
  • SIAM Journal on Computing
  • ACM Transactions on Algorithms

Collaborations have involved various researchers with whom Kortsarz has co-authored multiple papers. These frequent coauthors include:

  • Zeev Nutov
  • Michael Dinitz
  • Magnús M. Halldórsson
  • Marek Cygan
  • Ama Koranteng

Best Publications

  • The Dense k -Subgraph Problem

    Uriel Feige;Guy Kortsarz;David Peleg

  • Approximating the Domatic Number

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

  • How to Allocate Network Centers

    J. Barilan;G. Kortsarz;D. Peleg

  • On choosing a dense subgraph

    G. Kortsarz;D. Peleg

  • Approximating minimum cost connectivity problems

    Guy Kortsarz;Zeev Nutov

  • Generating Sparse 2-Spanners

    G. Kortsarz;D. Peleg

  • On the hardness of approximating spanners

    Guy Kortsarz

  • Hardness of Approximation for Vertex-Connectivity Network Design Problems

    Guy Kortsarz;Robert Krauthgamer;James R. Lee

  • Approximating the weight of shallow Steiner trees

    Guy Kortsarz;David Peleg

  • Approximation Algorithms for Minimum-Time Broadcast

    Guy Kortsarz;David Peleg

  • Minimum Color Sum of Bipartite Graphs

    Amotz Bar-Noy;Guy Kortsarz

  • Generalized submodular cover problems and applications

    Judit Bar-Ilan;Guy Kortsarz;David Peleg

  • A greedy approximation algorithm for the group Steiner problem

    Chandra Chekuri;Guy Even;Guy Kortsarz

  • Approximating Node Connectivity Problems via Set Covers

    Guy Kortsarz;Zeev Nutov

  • An improved approximation algorithm for vertex cover with hard capacities

    Rajiv Gandhi;Eran Halperin;Samir Khuller;Guy Kortsarz

  • Improved approximation algorithms for Directed Steiner Forest

    Moran Feldman;Guy Kortsarz;Zeev Nutov

  • From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More

    Parinya Chalermsook;Marek Cygan;Guy Kortsarz;Bundit Laekhanukit

  • A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem

    Michael Elkin;Guy Kortsarz

  • Sum Multicoloring of Graphs

    Amotz Bar-Noy;Magnús M. Halldórsson;Guy Kortsarz;Ravit Salman

  • Asymmetric k-center is log*n-hard to approximate

    Julia Chuzhoy;Sudipto Guha;Eran Halperin;Sanjeev Khanna

  • Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design

    C. Chekuri;M. T. Hajiaghayi;G. Kortsarz;M. R. Salavatipour

  • Approximating the domatic number

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

  • On Choosing a Dense Subgraph (Extended Abstract)

    Guy Kortsarz;David Peleg

Frequent Co-Authors

MohammadTaghi Hajiaghayi
MohammadTaghi Hajiaghayi University of Maryland, College Park
Magnús M. Halldórsson
Magnús M. Halldórsson Reykjavík University
David Peleg
David Peleg Weizmann Institute of Science
Michael Elkin
Michael Elkin Ben-Gurion University of the Negev
Marek Cygan
Marek Cygan University of Warsaw
Robert Krauthgamer
Robert Krauthgamer Weizmann Institute of Science
Vahab Mirrokni
Vahab Mirrokni Google (United States)
Eran Halperin
Eran Halperin University of California, Los Angeles
Guy Even
Guy Even Tel Aviv University
Aravind Srinivasan
Aravind Srinivasan University of Maryland, College Park

If you think any of the details on this page are incorrect, let us know.

Report an issue

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:

Related Online Degrees & Career Pathways

Exploring career options in Computer Science can often lead you to consider additional or alternative pathways in related fields. Many students and professionals are now seeking flexible learning solutions like online degrees, which can make advanced education more accessible and affordable.

For those interested in foundational knowledge or a career change, an online bachelor degree can provide the credentials needed to enter the tech workforce. If you're thinking more technically, pursuing an engineering online degree opens doors to growing fields like software engineering, data science, and systems architecture.

Professionals aiming for leadership roles in the tech sector might consider advanced management training. Options like the cheapest executive mba online can deliver the business skills needed to lead teams, projects, or startups within technology.

There are also unique options outside traditional tech roles. For example, earning a librarian degree online can lead to careers in digital archiving, knowledge management, or information science—all related to the computer science discipline.

Best Scientists Citing Guy Kortsarz

Trending Scientists