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.
Genevestigator V3: A Reference Expression Database for the Meta‐Analysis of Transcriptomes
Countries citing papers authored by Peter Widmayer
Since
Specialization
Citations
This map shows the geographic impact of Peter Widmayer'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 Peter Widmayer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Widmayer more than expected).
This network shows the impact of papers produced by Peter Widmayer. 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 Peter Widmayer. The network helps show where Peter Widmayer may publish in the future.
Co-authorship network of co-authors of Peter Widmayer
This figure shows the co-authorship network connecting the top 25 collaborators of Peter Widmayer.
A scholar is included among the top collaborators of Peter Widmayer 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 Peter Widmayer. Peter Widmayer is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Disser, Yann, Matúš Mihaľák, & Peter Widmayer. (2011). A polygon is determined by its angles. Computational Geometry. 44(8). 418–426.8 indexed citations
Eidenbenz, Stephan, et al.. (1998). Inapproximability of some art gallery problems.. Canadian Conference on Computational Geometry.7 indexed citations
15.
Seeger, Bernhard, et al.. (1997). A Generic Approach to Bulk Loading Multidimensional Index Structures. Very Large Data Bases. 406–415.100 indexed citations
16.
Roos, Thomas, et al.. (1993). Balanced Cuts of a Set of Hyperrectangles.. Canadian Conference on Computational Geometry. 121–126.1 indexed citations
17.
Henrich, Andreas, H.-W. Six, & Peter Widmayer. (1989). The LSD tree: spatial access to multidimensional and non-point objects. Very Large Data Bases. 45–53.130 indexed citations
Lausen, Georg, Eljas Soisalon-Soininen, & Peter Widmayer. (1985). Pre-analysis locking: a safe and deadlock free locking policy. Very Large Data Bases. 270–281.4 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.