Norbert Zeh
- Artificial Intelligence top 10%
- Molecular Biology
- Computer Networks and Communications top 10%
- Computational Theory and Mathematics top 5%
- Signal Processing top 10%
- Co-authors
- Chris WhiddenRobert G. BeikoAnil MaheshwariLars ArgeLaura TomaPeyman AfshaniD. A. W. HutchinsonAndrew Rau‐Chaplin
- Topics
- Complexity and Algorithms in Graphs (14 papers)Data Management and Algorithms (14 papers)Algorithms and Data Compression (14 papers)
- Cited by
- Computer Graphics and Computer-Aided DesignSignal ProcessingComputational Theory and Mathematics
- Partner nations
- CanadaDenmarkUnited States
In The Last Decade
Norbert Zeh
49 papers receiving 336 citations
Peers
Comparison fields: 5 of 54
- Artificial Intelligence 118
- Molecular Biology 107
- Computer Networks and Communications 99
- Computational Theory and Mathematics 85
- Signal Processing 78
Countries citing papers authored by Norbert Zeh
This map shows the geographic impact of Norbert Zeh'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 Norbert Zeh with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Norbert Zeh more than expected).
Fields of papers citing papers by Norbert Zeh
This network shows the impact of papers produced by Norbert Zeh. 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 Norbert Zeh. The network helps show where Norbert Zeh may publish in the future.
Co-authorship network of co-authors of Norbert Zeh
This figure shows the co-authorship network connecting the top 25 collaborators of Norbert Zeh. A scholar is included among the top collaborators of Norbert Zeh 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 Norbert Zeh. Norbert Zeh 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 | 7 | |
| 3 | 6 | |
| 4 | 2 | |
| 5 | 0 | |
| 6 | 2 | |
| 7 | Relaxed gabriel graphs | 4 |
| 8 | 7 | |
| 9 | 3 | |
| 10 | 1 | |
| 11 | 1 | |
| 12 | 3 | |
| 13 | 20 | |
| 14 | 4 | |
| 15 | 15 | |
| 16 | 12 | |
| 17 | 14 | |
| 18 | 24 | |
| 19 | 10 | |
| 20 | On Finding Minimum Deadly Sets for Directed Networks. | 1 |
About Norbert Zeh
Norbert Zeh is a scholar working on Computer Graphics and Computer-Aided Design, Signal Processing and Computational Theory and Mathematics, having authored 55 papers that have together received 348 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (14 papers), Data Management and Algorithms (14 papers) and Algorithms and Data Compression (14 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (56 citations), Signal Processing (78 citations) and Computational Theory and Mathematics (85 citations). Norbert Zeh has collaborated with scholars based in Canada, Denmark and United States. Frequent co-authors include Chris Whidden, Robert G. Beiko, Anil Maheshwari, Lars Arge, Laura Toma, Peyman Afshani, D. A. W. Hutchinson, Andrew Rau‐Chaplin, Mark Jones and Ulrich Meyer. Their work appears in journals such as Systematic Biology, SIAM Journal on Computing and Theoretical Computer Science.
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.