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.
Countries citing papers authored by Arnold Neumaier
Since
Specialization
Citations
This map shows the geographic impact of Arnold Neumaier'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 Arnold Neumaier with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Arnold Neumaier more than expected).
This network shows the impact of papers produced by Arnold Neumaier. 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 Arnold Neumaier. The network helps show where Arnold Neumaier may publish in the future.
Co-authorship network of co-authors of Arnold Neumaier
This figure shows the co-authorship network connecting the top 25 collaborators of Arnold Neumaier.
A scholar is included among the top collaborators of Arnold Neumaier 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 Arnold Neumaier. Arnold Neumaier is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Neumaier, Arnold, et al.. (2012). Continuity Notions for Multi-Valued Mappings with Possibly Disconnected Images.. Reliable Computing. 16. 84–101.2 indexed citations
4.
Neumaier, Arnold, et al.. (2010). Standardized notation in interval analysis. 15(1).55 indexed citations
5.
Крейнович, Владик, Arnold Neumaier, & Gang Xiang. (2008). Towards a Combination of Interval and Ellipsoid Uncertainty. scholarworks - UTEP (The University of Texas at El Paso). 13(6).4 indexed citations
6.
Fourer, Robert, et al.. (2007). Convexity and Concavity Detection in Computational Graphs. Tree Walks for Convexity Proving. PolyPublie (École Polytechnique de Montréal). 1–25.1 indexed citations
Neumaier, Arnold, et al.. (2004). Global Optimization and Constraint Satisfaction: First International Workshop Global Constraint Optimization and Constraint Satisfaction, Cocos 2002, Valbonne-Sophia Antipolis, France, October 2002 (Lecture Notes in Computer Science, 2861). Springer eBooks.1 indexed citations
9.
Leonhardt, Ulf & Arnold Neumaier. (2003). Explicit effective Hamiltonians for linear quantum-optical networks. arXiv (Cornell University).3 indexed citations
Neumaier, Arnold. (1982). A Better Estimate for Fixed Points of Contractions. ZAMM ‐ Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik. 62(11). 627–627.3 indexed citations
Neumaier, Arnold. (1980). t 1/2 - Designs.. Journal of Combinatorial Theory Series A. 28. 226–248.10 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.