Stefan Näher
About
In The Last Decade
Stefan Näher
22 papers receiving 314 citations
Peers
Comparison fields: 5 of 58
- Computer Graphics and Computer-Aided Design 145
- Artificial Intelligence 111
- Computational Theory and Mathematics 101
- Computer Networks and Communications 88
- Signal Processing 75
Countries citing papers authored by Stefan Näher
This map shows the geographic impact of Stefan Näher'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 Stefan Näher with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stefan Näher more than expected).
Fields of papers citing papers by Stefan Näher
This network shows the impact of papers produced by Stefan Näher. 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 Stefan Näher. The network helps show where Stefan Näher may publish in the future.
Co-authorship network of co-authors of Stefan Näher
This figure shows the co-authorship network connecting the top 25 collaborators of Stefan Näher. A scholar is included among the top collaborators of Stefan Näher 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 Stefan Näher. Stefan Näher is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 16 | |
| 3 | A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem | 4 |
| 4 | 2 | |
| 5 | 1 | |
| 6 | Experiments on curve reconstruction | 9 |
| 7 | Proceedings of the 4th International Workshop on Algorithm Engineering | 1 |
| 8 | AGD-Library: A Library of Algorithms for Graph Drawing | 9 |
| 9 | 25 | |
| 10 | 61 | |
| 11 | LEDA user manual (version R 3.2) | 4 |
| 12 | The Implementation of Geometric Algorithms | 9 |
| 13 | Implementation of a sweep line algorithm for the Straight \& Line Segment Intersection Problem | 5 |
| 14 | LEDA-Manual Version 3.0 | 1 |
| 15 | An implementation of the Hopcroft and Tarjan planarity test and embedding algorithm | 4 |
| 16 | Algorithm Design and Software Libraries: Recent Developments in the LEDA Project | 13 |
| 17 | 34 | |
| 18 | 7 | |
| 19 | 1 | |
| 20 | 5 |
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.