Jochen Könemann
- Computer Networks and Communications top 2%
- Computational Theory and Mathematics top 1%
- Electrical and Electronic Engineering
- Industrial and Manufacturing Engineering top 2%
- Management Science and Operations Research top 5%
- Co-authors
- Naveen GargR. RaviAmitabh SinhaStefano LeonardiGuido SchäferOjas ParekhAnupam GuptaGuy Even
- Topics
- Complexity and Algorithms in Graphs (41 papers)Advanced Graph Theory Research (27 papers)Optimization and Search Problems (20 papers)
- Cited by
- Computer Graphics and Computer-Aided DesignComputer Networks and CommunicationsComputational Theory and Mathematics
- Partner nations
- CanadaUnited StatesItaly
In The Last Decade
Jochen Könemann
48 papers receiving 1.2k citations
Hit Papers
Peers
Comparison fields: 5 of 83
- Computer Networks and Communications 715
- Computational Theory and Mathematics 497
- Electrical and Electronic Engineering 285
- Industrial and Manufacturing Engineering 169
- Management Science and Operations Research 121
Countries citing papers authored by Jochen Könemann
This map shows the geographic impact of Jochen Könemann'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 Jochen Könemann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jochen Könemann more than expected).
Fields of papers citing papers by Jochen Könemann
This network shows the impact of papers produced by Jochen Könemann. 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 Jochen Könemann. The network helps show where Jochen Könemann may publish in the future.
Co-authorship network of co-authors of Jochen Könemann
This figure shows the co-authorship network connecting the top 25 collaborators of Jochen Könemann. A scholar is included among the top collaborators of Jochen Könemann 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 Jochen Könemann. Jochen Könemann 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 | 9 | |
| 3 | 2 | |
| 4 | 8 | |
| 5 | 31 | |
| 6 | 0 | |
| 7 | 10 | |
| 8 | 24 | |
| 9 | 8 | |
| 10 | 23 | |
| 11 | 38 | |
| 12 | 15 | |
| 13 | 3 | |
| 14 | 12 | |
| 15 | 25 | |
| 16 | 8 | |
| 17 | 33 | |
| 18 | 10 | |
| 19 | 25 | |
| 20 | Faster and simpler algorithms for multicommodity flow and other fractional packing problemsbreakdown → | 332 |
About Jochen Könemann
Jochen Könemann is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Networks and Communications, having authored 50 papers that have together received 1.2k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (41 papers), Advanced Graph Theory Research (27 papers) and Optimization and Search Problems (20 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (116 citations), Computer Networks and Communications (715 citations) and Computational Theory and Mathematics (497 citations). Jochen Könemann has collaborated with scholars based in Canada, United States and Italy. Frequent co-authors include Naveen Garg, R. Ravi, Amitabh Sinha, Stefano Leonardi, Guido Schäfer, Ojas Parekh, Anupam Gupta, Guy Even, Fabrizio Grandoni and Alessandro Panconesi. Their work appears in journals such as Mathematical Programming, SIAM Journal on Computing and Theoretical Computer Science.
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.