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 55 Citations 11,243 236 World Ranking 2134 National Ranking 39

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Combinatorics
  • Geometry

Haim Kaplan mainly investigates Combinatorics, Discrete mathematics, Algorithm, Data structure and Theoretical computer science. His Combinatorics research includes themes of Dynamic programming and Algebraic number. The concepts of his Discrete mathematics study are interwoven with issues in Rounding and Floyd–Warshall algorithm.

His work carried out in the field of Algorithm brings together such families of science as Euclidean shortest path, Constrained Shortest Path First, Shortest path problem, K shortest path routing and Yen's algorithm. His Data structure study combines topics from a wide range of disciplines, such as Permutation, Time complexity, Sorting, Simple and Metric space. His Theoretical computer science research is multidisciplinary, incorporating perspectives in Structure, XML, Node and Binary tree.

His most cited work include:

  • Reachability and Distance Queries via 2-Hop Labels (343 citations)
  • Reach for A : efficient point-to-point shortest path algorithms (216 citations)
  • Labeling dynamic XML trees (199 citations)

What are the main themes of his work throughout his whole career to date?

Haim Kaplan spends much of his time researching Combinatorics, Discrete mathematics, Algorithm, Data structure and Set. His studies in Combinatorics integrate themes in fields like Point and Upper and lower bounds. Point and Plane are commonly linked in his work.

His Discrete mathematics and Interval graph, Pathwidth, Disjoint sets, Chordal graph and Indifference graph investigations all form part of his Discrete mathematics research activities. His study in Set is interdisciplinary in nature, drawing from both Sampling and Simple. His Binary logarithm study frequently draws connections to adjacent fields such as Directed graph.

He most often published in these fields:

  • Combinatorics (51.31%)
  • Discrete mathematics (27.75%)
  • Algorithm (19.37%)

What were the highlights of his more recent work (between 2018-2021)?

  • Combinatorics (51.31%)
  • Algorithm (19.37%)
  • Upper and lower bounds (9.69%)

In recent papers he was focusing on the following fields of study:

His primary scientific interests are in Combinatorics, Algorithm, Upper and lower bounds, Discrete mathematics and Theoretical computer science. His specific area of interest is Combinatorics, where he studies Binary logarithm. His work in the fields of Algorithm, such as Synthetic data, intersects with other areas such as Generalization.

His Upper and lower bounds research integrates issues from Shortest path problem, Star and Reinforcement learning. Many of his research projects under Discrete mathematics are closely connected to Sample complexity with Sample complexity, tying the diverse disciplines of science together. His Theoretical computer science research incorporates elements of Training set, Assignment problem, Value, Streaming algorithm and Optimal matching.

Between 2018 and 2021, his most popular works were:

  • Privately Learning Thresholds: Closing the Exponential Gap (11 citations)
  • Competitive analysis with a sample and the secretary problem (11 citations)
  • Faster k-SAT algorithms using biased-PPSZ (10 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Combinatorics
  • Geometry

Haim Kaplan focuses on Combinatorics, Upper and lower bounds, Algorithm, Differential privacy and Apprenticeship learning. His Combinatorics research incorporates themes from Discrete mathematics and State. His State research includes elements of Shortest path problem, Rectangle, Bounded function, Regret and Perimeter.

He interconnects Submodular set function, Set, Reachability and Reinforcement learning in the investigation of issues within Upper and lower bounds. His Algorithm research is multidisciplinary, incorporating elements of Transformation and Convex function. His Differential privacy research includes elements of Connection, Data stream, Point and Streaming algorithm.

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

Reachability and Distance Queries via 2-Hop Labels

Edith Cohen;Eran Halperin;Haim Kaplan;Uri Zwick.
SIAM Journal on Computing (2003)

661 Citations

A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

Haim Kaplan;Ron Shamir;Robert E. Tarjan.
SIAM Journal on Computing (1999)

412 Citations

Labeling Dynamic XML Trees

Edith Cohen;Haim Kaplan;Tova Milo.
SIAM Journal on Computing (2010)

394 Citations

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

Andrew V. Goldberg;Haim Kaplan;Renato F. Werneck.
algorithm engineering and experimentation (2006)

370 Citations

Associative search in peer to peer networks: harnessing latent semantics

Edith Cohen;Amos Fiat;Haim Kaplan.
international conference on computer communications (2003)

274 Citations

Optimal oblivious routing in polynomial time

Yossi Azar;Edith Cohen;Amos Fiat;Haim Kaplan.
symposium on the theory of computing (2003)

268 Citations

Graph sandwich problems

Martin Charles Golumbic;Haim Kaplan;Ron Shamir.
Journal of Algorithms (1995)

257 Citations

Compact labeling schemes for ancestor queries

Serge Abiteboul;Haim Kaplan;Tova Milo.
symposium on discrete algorithms (2001)

251 Citations

Compact Labeling Scheme for Ancestor Queries

Serge Abiteboul;Stephen Alstrup;Haim Kaplan;Tova Milo.
SIAM Journal on Computing (2006)

250 Citations

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

Haim Kaplan;Moshe Lewenstein;Nira Shafrir;Maxim Sviridenko.
Journal of the ACM (2005)

240 Citations

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

Contact us

Best Scientists Citing Haim Kaplan

Daniel Delling

Daniel Delling

Apple (United States)

Publications: 58

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 45

Renato F. Werneck

Renato F. Werneck

Microsoft (United States)

Publications: 42

Jeffrey Xu Yu

Jeffrey Xu Yu

Chinese University of Hong Kong

Publications: 38

Andrew V. Goldberg

Andrew V. Goldberg

Amazon (United States)

Publications: 36

Andrzej Pelc

Andrzej Pelc

Université du Québec en Outaouais

Publications: 33

Timothy M. Chan

Timothy M. Chan

University of Illinois at Urbana-Champaign

Publications: 32

Robert E. Tarjan

Robert E. Tarjan

Princeton University

Publications: 32

Giuseppe F. Italiano

Giuseppe F. Italiano

Guido Carli Free International University for Social Studies

Publications: 30

Edith Cohen

Edith Cohen

Tel Aviv University

Publications: 28

Dorothea Wagner

Dorothea Wagner

Karlsruhe Institute of Technology

Publications: 28

Peter Sanders

Peter Sanders

Karlsruhe Institute of Technology

Publications: 26

Tim Roughgarden

Tim Roughgarden

Columbia University

Publications: 23

Nick Duffield

Nick Duffield

Texas A&M University

Publications: 23

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 21

Xuemin Lin

Xuemin Lin

UNSW Sydney

Publications: 21

Something went wrong. Please try again later.