This map shows the geographic impact of Haim Kaplan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Haim Kaplan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Haim Kaplan more than expected).
This network shows the impact of papers produced by Haim Kaplan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Haim Kaplan. The network helps show where Haim Kaplan may publish in the future.
Co-authorship network of co-authors of Haim Kaplan
This figure shows the co-authorship network connecting the top 25 collaborators of Haim Kaplan.
A scholar is included among the top collaborators of Haim Kaplan based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Haim Kaplan. Haim Kaplan is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Kaplan, Haim, et al.. (2019). A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games.. International Colloquium on Automata, Languages and Programming.1 indexed citations
3.
Kaplan, Haim, et al.. (2013). The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques.. arXiv (Cornell University).2 indexed citations
Buchsbaum, Adam L., Haim Kaplan, Anne Rogers, & Jeffery Westbrook. (2002). Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. arXiv (Cornell University).1 indexed citations
Kaplan, Haim, Martin J. Strauss, & Márió Szegedy. (1999). Just the fax—differentiating voice and fax phone lines using call billing data. Symposium on Discrete Algorithms. 935–936.1 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.