Oliver Schaudt
About
In The Last Decade
Oliver Schaudt
39 papers receiving 221 citations
Peers
Comparison fields: 5 of 42
- Computational Theory and Mathematics 192
- Discrete Mathematics and Combinatorics 77
- Computer Networks and Communications 61
- Geometry and Topology 37
- Electrical and Electronic Engineering 28
Countries citing papers authored by Oliver Schaudt
This map shows the geographic impact of Oliver Schaudt'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 Oliver Schaudt with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Oliver Schaudt more than expected).
Fields of papers citing papers by Oliver Schaudt
This network shows the impact of papers produced by Oliver Schaudt. 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 Oliver Schaudt. The network helps show where Oliver Schaudt may publish in the future.
Co-authorship network of co-authors of Oliver Schaudt
This figure shows the co-authorship network connecting the top 25 collaborators of Oliver Schaudt. A scholar is included among the top collaborators of Oliver Schaudt 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 Oliver Schaudt. Oliver Schaudt is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 4 | |
| 2 | 7 | |
| 3 | 7 | |
| 4 | 0 | |
| 5 | 3 | |
| 6 | 9 | |
| 7 | 4 | |
| 8 | Partitioning two-coloured complete multipartite graphs into monochromatic paths. | 2 |
| 9 | 4 | |
| 10 | 4 | |
| 11 | 8 | |
| 12 | 0 | |
| 13 | Connected dominating set in graphs without long paths and cycles | 1 |
| 14 | 9 | |
| 15 | 5 | |
| 16 | The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs | 2 |
| 17 | 3 | |
| 18 | 7 | |
| 19 | 13 | |
| 20 | 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.