Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
This map shows the geographic impact of Kurt Mehlhorn'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 Kurt Mehlhorn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kurt Mehlhorn more than expected).
This network shows the impact of papers produced by Kurt Mehlhorn. 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 Kurt Mehlhorn. The network helps show where Kurt Mehlhorn may publish in the future.
Co-authorship network of co-authors of Kurt Mehlhorn
This figure shows the co-authorship network connecting the top 25 collaborators of Kurt Mehlhorn.
A scholar is included among the top collaborators of Kurt Mehlhorn 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 Kurt Mehlhorn. Kurt Mehlhorn is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Fogel, Efi, et al.. (2007). Sweeping and maintaining two-dimensional arrangements on quadrics. Max Planck Institute for Plasma Physics. 223–226.3 indexed citations
Irving, Robert W., Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, & Katarzyna Paluch. (2004). Rank-maximal matchings. Symposium on Discrete Algorithms. 68–75.5 indexed citations
Althaus, Ernst, Kurt Mehlhorn, Stefan Näher, & Stefan Schirra. (2000). Experiments on curve reconstruction. Max Planck Institute for Plasma Physics. 103–114.9 indexed citations
12.
Mehlhorn, Kurt, et al.. (1997). A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. Max Planck Institute for Plasma Physics. 702–709.
Mehlhorn, Kurt, et al.. (1994). The Implementation of Geometric Algorithms. Max Planck Institute for Plasma Physics. 223–231.9 indexed citations
15.
Mehlhorn, Kurt, et al.. (1994). On degeneracy in geometric computations. Max Planck Institute for Plasma Physics. 16–23.1 indexed citations
16.
Mehlhorn, Kurt, et al.. (1992). Algorithm Design and Software Libraries: Recent Developments in the LEDA Project. Max Planck Institute for Plasma Physics. 493–505.13 indexed citations
Mehlhorn, Kurt & Uzi Vishkin. (1983). Granularity of Memory in Parallel Computation.. 231–240.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.