Jesper Nederlof
- Computational Theory and Mathematics top 2%
- Computer Networks and Communications top 10%
- Artificial Intelligence
- Electrical and Electronic Engineering
- Discrete Mathematics and Combinatorics top 10%
- Co-authors
- Marek CyganStefan KratschHans L. BodlaenderDaniel LokshtanovMichał PilipczukMarcin PilipczukJakub Onufry WojtaszczykJohan M. M. van Rooij
- Topics
- Complexity and Algorithms in Graphs (26 papers)Advanced Graph Theory Research (23 papers)Optimization and Search Problems (9 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Graphics and Computer-Aided Design
- Partner nations
- NetherlandsGermanyPoland
In The Last Decade
Jesper Nederlof
31 papers receiving 360 citations
Peers
Comparison fields: 5 of 29
- Computational Theory and Mathematics 337
- Computer Networks and Communications 132
- Artificial Intelligence 71
- Electrical and Electronic Engineering 48
- Discrete Mathematics and Combinatorics 45
Countries citing papers authored by Jesper Nederlof
This map shows the geographic impact of Jesper Nederlof'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 Jesper Nederlof with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jesper Nederlof more than expected).
Fields of papers citing papers by Jesper Nederlof
This network shows the impact of papers produced by Jesper Nederlof. 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 Jesper Nederlof. The network helps show where Jesper Nederlof may publish in the future.
Co-authorship network of co-authors of Jesper Nederlof
This figure shows the co-authorship network connecting the top 25 collaborators of Jesper Nederlof. A scholar is included among the top collaborators of Jesper Nederlof 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 Jesper Nederlof. Jesper Nederlof is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 0 | |
| 3 | 0 | |
| 4 | 0 | |
| 5 | 2 | |
| 6 | 1 | |
| 7 | 0 | |
| 8 | 1 | |
| 9 | 2 | |
| 10 | 5 | |
| 11 | 30 | |
| 12 | 3 | |
| 13 | 5 | |
| 14 | 67 | |
| 15 | 10 | |
| 16 | 5 | |
| 17 | 2 | |
| 18 | 29 | |
| 19 | 3 | |
| 20 | 28 |
About Jesper Nederlof
Jesper Nederlof is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications, having authored 35 papers that have together received 373 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (26 papers), Advanced Graph Theory Research (23 papers) and Optimization and Search Problems (9 papers). The work is most often cited by research in Computational Theory and Mathematics (337 citations), Discrete Mathematics and Combinatorics (45 citations) and Computer Graphics and Computer-Aided Design (38 citations). Jesper Nederlof has collaborated with scholars based in Netherlands, Germany and Poland. Frequent co-authors include Marek Cygan, Stefan Kratsch, Hans L. Bodlaender, Daniel Lokshtanov, Michał Pilipczuk, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk, Johan M. M. van Rooij, Petteri Kaski and Mikko Koivisto. Their work appears in journals such as IEEE Transactions on Information Theory, Journal of the ACM and SIAM Journal on Computing.
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.