World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
65
Citations
13992
World Ranking
2495
National Ranking
47

Haim Kaplan 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 Haim Kaplan 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: 337 publications — 80th percentile

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

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

Haim Kaplan 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 Haim Kaplan 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: 65 D-Index — 83rd percentile

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

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

Overview

Haim Kaplan is affiliated with Tel Aviv University in Israel and has a body of research primarily situated within computer science. Their work spans multiple subfields, highlighting significant contributions in areas such as artificial intelligence, computer networks and communications, computational theory and mathematics, computer vision and pattern recognition, and computer graphics and computer-aided design.

The scientist's research topics cover a broad range of domains including privacy-preserving technologies in data, cryptography and data security, complexity and algorithms in graphs, computational geometry and mesh generation, optimization and search problems, machine learning and algorithms, as well as caching and content delivery.

Kaplan has published extensively, with 144 publications classified under computer science. Notable recent papers include:

  • Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications, 2020, Refubium (Universitätsbibliothek der Freien Universität Berlin)
  • Stabbing pairwise intersecting disks by five points, 2021, Discrete Mathematics
  • Optimal Representations of a Traffic Distribution in Switch Memories, 2020, IEEE/ACM Transactions on Networking
  • Adversarially Robust Streaming Algorithms via Differential Privacy, 2022, Journal of the ACM
  • On Radial Isotropic Position: Theory and Algorithms, 2020, arXiv (Cornell University)

Their preferred publication venues reflect the interdisciplinary scope of their research. Frequent outlets include:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • IEEE/ACM Transactions on Networking
  • SIAM Journal on Computing
  • Refubium (Universitätsbibliothek der Freien Universität Berlin)

Kaplan collaborates regularly with several researchers, indicating an active network of frequent co-authors. Among these are Uri Stemmer, Yishay Mansour, Micha Sharir, Yaniv Sadeh, and Ori Rottenstreich, with collaboration counts ranging from 8 to 22 joint publications.

The combination of topics, venues, and collaborations paints a picture of a researcher engaged in both theoretical and applied aspects of computer science, with a focus on algorithmic challenges, data security, and network communications. Their work contributes to advancing knowledge in areas that intersect mathematical foundations and practical implementations within computing systems.

Best Publications

  • Reachability and Distance Queries via 2-Hop Labels

    Edith Cohen;Eran Halperin;Haim Kaplan;Uri Zwick

  • A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

    Haim Kaplan;Ron Shamir;Robert E. Tarjan

  • Reach for A : efficient point-to-point shortest path algorithms

    Andrew V. Goldberg;Haim Kaplan;Renato F. Werneck

  • Labeling dynamic XML trees

    Edith Cohen;Haim Kaplan;Tova Milo

  • Labeling Dynamic XML Trees

    Edith Cohen;Haim Kaplan;Tova Milo

  • Associative search in peer to peer networks: Harnessing latent semantics

    Edith Cohen;Amos Fiat;Haim Kaplan

  • Optimal oblivious routing in polynomial time

    Yossi Azar;Edith Cohen;Amos Fiat;Haim Kaplan

  • Associative search in peer to peer networks: harnessing latent semantics

    E. Cohen;A. Fiat;H. Kaplan

  • Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

    Haim Kaplan;Moshe Lewenstein;Nira Shafrir;Maxim Sviridenko

  • Graph sandwich problems

    Martin Charles Golumbic;Haim Kaplan;Ron Shamir

  • Compact Labeling Scheme for Ancestor Queries

    Serge Abiteboul;Stephen Alstrup;Haim Kaplan;Tova Milo

  • Compact labeling schemes for ancestor queries

    Serge Abiteboul;Haim Kaplan;Tova Milo

  • Reachability and distance queries via 2-hop labels

    Edith Cohen;Eran Halperin;Haim Kaplan;Uri Zwick

  • Four strikes against physical mapping of DNA.

    Paul W. Goldberg;Martin Charles Golumbic;Haim Kaplan;Ron Shamir

  • Prefetching the means for document transfer: a new approach for reducing Web latency

    E. Cohen;H. Kaplan

  • Proactive caching of DNS records: addressing a performance bottleneck

    E. Cohen;H. Kaplan

  • Computing the Discrete Fréchet Distance in Subquadratic Time

    Pankaj K. Agarwal;Rinat Ben Avraham;Haim Kaplan;Micha Sharir

  • Proactive caching of DNS records: addressing a performance bottleneck

    Edith Cohen;Haim Kaplan

  • Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

    Haim Kaplan;Ron Shamir;Robert E. Tarjan

  • Faster and simpler algorithm for sorting signed permutations by reversals

    Haim Kaplan;Ron Shamir;Robert E. Tarjan

Frequent Co-Authors

Micha Sharir
Micha Sharir Tel Aviv University
Edith Cohen
Edith Cohen Tel Aviv University
Robert E. Tarjan
Robert E. Tarjan Princeton University
Yishay Mansour
Yishay Mansour Tel Aviv University
Uri Zwick
Uri Zwick Tel Aviv University
Amos Fiat
Amos Fiat Tel Aviv University
Avinatan Hassidim
Avinatan Hassidim Bar-Ilan University
Pankaj K. Agarwal
Pankaj K. Agarwal Duke University
Ron Shamir
Ron Shamir Tel Aviv University
Mikkel Thorup
Mikkel Thorup University of Copenhagen

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 related online degrees can open numerous doors for students in Computer Science. For those interested in emerging fields, pursuing an affordable data science degree can provide the skills needed for high-demand analytics roles. Data science is a rapidly growing area, and online programs offer a flexible path to break in.

Another sought-after option is earning an online bachelor’s in electrical engineering. Blending computer science with engineering equips graduates for careers in hardware, robotics, and embedded systems.

If you’re seeking shorter-term upskilling, look into certifications for jobs. Industry-recognized certifications can boost your resume and lead to lucrative tech jobs faster, often without the time investment of a full degree.

For those eager to advance quickly, the quickest cheapest masters degree options allow you to gain specialized credentials and leadership potential in record time—entirely online and with minimal cost.

Best Scientists Citing Haim Kaplan

Trending Scientists

Recently Published Articles