Jan van den Brand
- Computational Theory and Mathematics top 5%
- Computer Networks and Communications
- Artificial Intelligence
- Numerical Analysis
- Computer Graphics and Computer-Aided Design top 10%
- Co-authors
- Aaron SidfordDanupon NanongkaiZhao SongYin Tat LeeThatchaphol SaranurakDi WangYang P. LiuRichard Peng
- Topics
- Complexity and Algorithms in Graphs (10 papers)Optimization and Search Problems (6 papers)Stochastic Gradient Optimization Techniques (4 papers)
- Cited by
- Computational Theory and MathematicsComputer Graphics and Computer-Aided DesignNumerical Analysis
- Journals
- Research at the University of Copenhagen (University of Copenhagen)DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
- Partner nations
- United StatesSwedenAustria
In The Last Decade
Jan van den Brand
12 papers receiving 125 citations
Peers
Comparison fields: 5 of 24
- Computational Theory and Mathematics 97
- Computer Networks and Communications 56
- Artificial Intelligence 51
- Numerical Analysis 20
- Computer Graphics and Computer-Aided Design 15
Countries citing papers authored by Jan van den Brand
This map shows the geographic impact of Jan van den Brand'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 Jan van den Brand with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jan van den Brand more than expected).
Fields of papers citing papers by Jan van den Brand
This network shows the impact of papers produced by Jan van den Brand. 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 Jan van den Brand. The network helps show where Jan van den Brand may publish in the future.
Co-authorship network of co-authors of Jan van den Brand
This figure shows the co-authorship network connecting the top 25 collaborators of Jan van den Brand. A scholar is included among the top collaborators of Jan van den Brand 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 Jan van den Brand. Jan van den Brand 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 | 5 | |
| 3 | 4 | |
| 4 | 2 | |
| 5 | 11 | |
| 6 | 1 | |
| 7 | 6 | |
| 8 | 5 | |
| 9 | 23 | |
| 10 | 25 | |
| 11 | 30 | |
| 12 | 16 |
About Jan van den Brand
Jan van den Brand is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications, having authored 12 papers that have together received 129 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (10 papers), Optimization and Search Problems (6 papers) and Stochastic Gradient Optimization Techniques (4 papers). The work is most often cited by research in Computational Theory and Mathematics (97 citations), Computer Graphics and Computer-Aided Design (15 citations) and Numerical Analysis (20 citations). Jan van den Brand has collaborated with scholars based in United States, Sweden and Austria. Frequent co-authors include Aaron Sidford, Danupon Nanongkai, Zhao Song, Yin Tat Lee, Thatchaphol Saranurak, Di Wang, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg and Rasmus Kyng. Their work appears in journals such as Research at the University of Copenhagen (University of Copenhagen) and DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
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.