World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

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

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