Volker Kaibel
- Computational Theory and Mathematics top 2%
- Industrial and Manufacturing Engineering top 5%
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Numerical Analysis top 10%
- Co-authors
- Marc E. PfetschMichael JüngerKanstantsin PashkovichDirk Oliver TheisSamuel FioriniAlexander SchwartzYuri FaenzaBernd Gärtner
- Topics
- Advanced Graph Theory Research (16 papers)graph theory and CDMA systems (9 papers)Optimization and Packing Problems (8 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsIndustrial and Manufacturing Engineering
- Partner nations
- GermanyUnited StatesNetherlands
In The Last Decade
Volker Kaibel
32 papers receiving 339 citations
Peers
Comparison fields: 5 of 53
- Computational Theory and Mathematics 203
- Industrial and Manufacturing Engineering 112
- Electrical and Electronic Engineering 82
- Computer Networks and Communications 58
- Numerical Analysis 56
Countries citing papers authored by Volker Kaibel
This map shows the geographic impact of Volker Kaibel'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 Volker Kaibel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Volker Kaibel more than expected).
Fields of papers citing papers by Volker Kaibel
This network shows the impact of papers produced by Volker Kaibel. 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 Volker Kaibel. The network helps show where Volker Kaibel may publish in the future.
Co-authorship network of co-authors of Volker Kaibel
This figure shows the co-authorship network connecting the top 25 collaborators of Volker Kaibel. A scholar is included among the top collaborators of Volker Kaibel 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 Volker Kaibel. Volker Kaibel 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 | 4 | |
| 5 | 15 | |
| 6 | 40 | |
| 7 | 7 | |
| 8 | 31 | |
| 9 | 12 | |
| 10 | 7 | |
| 11 | On the Bottleneck Shortest Path Problem | 22 |
| 12 | Integer Programming and Combinatorial Optimization: 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings (Lecture Notes in Computer Science) | 4 |
| 13 | 0 | |
| 14 | 11 | |
| 15 | 17 | |
| 16 | 16 | |
| 17 | 9 | |
| 18 | 13 | |
| 19 | 7 | |
| 20 | 9 |
About Volker Kaibel
Volker Kaibel is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 37 papers that have together received 360 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (16 papers), graph theory and CDMA systems (9 papers) and Optimization and Packing Problems (8 papers). The work is most often cited by research in Computational Theory and Mathematics (203 citations), Discrete Mathematics and Combinatorics (40 citations) and Industrial and Manufacturing Engineering (112 citations). Volker Kaibel has collaborated with scholars based in Germany, United States and Netherlands. Frequent co-authors include Marc E. Pfetsch, Michael Jünger, Kanstantsin Pashkovich, Dirk Oliver Theis, Samuel Fiorini, Alexander Schwartz, Yuri Faenza, Bernd Gärtner, Rekha R. Thomas and Tamás Fleiner. Their work appears in journals such as Mathematical Programming, SIAM Journal on Computing and SIAM Journal on Optimization.
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.