Matthias Kriesell
- Computational Theory and Mathematics top 1%
- Computer Networks and Communications top 5%
- Electrical and Electronic Engineering
- Discrete Mathematics and Combinatorics top 5%
- Geometry and Topology top 5%
- Co-authors
- Tamás KirályAndrás FrankHajo BroersmaJørgen Bang‐JensenReinhard DiestelHenning BruhnPaul WollanRudi Pendavingh
- Topics
- Advanced Graph Theory Research (50 papers)Interconnection Networks and Systems (22 papers)Limits and Structures in Graph Theory (17 papers)
In The Last Decade
Matthias Kriesell
50 papers receiving 396 citations
Peers
Comparison fields: 5 of 30
- Computational Theory and Mathematics 365
- Computer Networks and Communications 170
- Electrical and Electronic Engineering 121
- Discrete Mathematics and Combinatorics 107
- Geometry and Topology 101
Countries citing papers authored by Matthias Kriesell
This map shows the geographic impact of Matthias Kriesell'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 Matthias Kriesell with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Matthias Kriesell more than expected).
Fields of papers citing papers by Matthias Kriesell
This network shows the impact of papers produced by Matthias Kriesell. 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 Matthias Kriesell. The network helps show where Matthias Kriesell may publish in the future.
Co-authorship network of co-authors of Matthias Kriesell
This figure shows the co-authorship network connecting the top 25 collaborators of Matthias Kriesell. A scholar is included among the top collaborators of Matthias Kriesell 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 Matthias Kriesell. Matthias Kriesell 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 | 0 | |
| 3 | 0 | |
| 4 | 7 | |
| 5 | 3 | |
| 6 | 3 | |
| 7 | 6 | |
| 8 | 1 | |
| 9 | 2 | |
| 10 | 5 | |
| 11 | 7 | |
| 12 | 4 | |
| 13 | 58 | |
| 14 | 37 | |
| 15 | 4 | |
| 16 | 17 | |
| 17 | 21 | |
| 18 | 4 | |
| 19 | 4 | |
| 20 | 4 |
About Matthias Kriesell
Matthias Kriesell is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 56 papers that have together received 415 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (50 papers), Interconnection Networks and Systems (22 papers) and Limits and Structures in Graph Theory (17 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (107 citations), Computational Theory and Mathematics (365 citations) and Geometry and Topology (101 citations). Matthias Kriesell has collaborated with scholars based in Germany, Denmark and Czechia. Frequent co-authors include Tamás Király, András Frank, Hajo Broersma, Jørgen Bang‐Jensen, Reinhard Diestel, Henning Bruhn, Paul Wollan, Rudi Pendavingh, Stephan Brandt and János Barát. Their work appears in journals such as Advances in Mathematics, Theoretical Computer Science and Networks.
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.