Tim Nieberg
About
In The Last Decade
Tim Nieberg
33 papers receiving 548 citations
Peers
Comparison fields: 5 of 47
- Computer Networks and Communications 454
- Electrical and Electronic Engineering 258
- Computational Theory and Mathematics 80
- Hardware and Architecture 55
- Industrial and Manufacturing Engineering 40
Countries citing papers authored by Tim Nieberg
This map shows the geographic impact of Tim Nieberg'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 Tim Nieberg with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tim Nieberg more than expected).
Fields of papers citing papers by Tim Nieberg
This network shows the impact of papers produced by Tim Nieberg. 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 Tim Nieberg. The network helps show where Tim Nieberg may publish in the future.
Co-authorship network of co-authors of Tim Nieberg
This figure shows the co-authorship network connecting the top 25 collaborators of Tim Nieberg. A scholar is included among the top collaborators of Tim Nieberg 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 Tim Nieberg. Tim Nieberg is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 22 | |
| 2 | 26 | |
| 3 | 5 | |
| 4 | Colored Independent Sets. | 1 |
| 5 | A local approximation algorithm for maximum weight matching. | 1 |
| 6 | 16 | |
| 7 | 23 | |
| 8 | 11 | |
| 9 | 5 | |
| 10 | A Distributed and Self-Organizing Scheduling Algorithm for Energy-Efficient Data Aggregation in Wireless Sensor Networks | 2 |
| 11 | 3 | |
| 12 | 38 | |
| 13 | 28 | |
| 14 | 52 | |
| 15 | On cyclic plans for scheduling a smart card personalisation system | 1 |
| 16 | A PTAS for the minimum dominating set problem in unit disk graphs | 1 |
| 17 | Multipath Routing with Erasure Coding for Wireless Sensor Networks | 11 |
| 18 | A new PTAS for maximum independent sets in unit disk graphs | 3 |
| 19 | A Data Aggregation Framework for Wireless Sensor Network | 10 |
| 20 | Collaborative communication protocols for wireless sensor networks | 8 |
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.