World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

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

Guy Kortsarz publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Guy Kortsarz sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 196 publications — 45th percentile

45% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Guy Kortsarz D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Guy Kortsarz sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 45 D-Index — 51st percentile

51% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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

Recently Published Articles