Jochen Könemann

2.8k total citations · 1 hit paper
50 papers, 1.2k citations indexed

About

Jochen Könemann is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Economics and Econometrics. According to data from OpenAlex, Jochen Könemann has authored 50 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computational Theory and Mathematics, 21 papers in Computer Networks and Communications and 11 papers in Economics and Econometrics. Recurrent topics in Jochen Könemann's work include Complexity and Algorithms in Graphs (41 papers), Advanced Graph Theory Research (27 papers) and Optimization and Search Problems (20 papers). Jochen Könemann is often cited by papers focused on Complexity and Algorithms in Graphs (41 papers), Advanced Graph Theory Research (27 papers) and Optimization and Search Problems (20 papers). Jochen Könemann collaborates with scholars based in Canada, United States and Italy. Jochen Könemann's 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 and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Jochen Könemann

48 papers receiving 1.2k citations

Hit Papers

Faster and simpler algorithms for multicommodity flow and... 2002 2026 2010 2018 2002 100 200 300
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Faster and simpler algorithms for multicommodity flow and other fractional packing problems
    2002 332 citations Naveen Garg, Jochen Könemann profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Jochen Könemann Canada 19 715 497 285 169 121 50 1.2k
Mohammad Taghi Hajiaghayi United States 21 895 1.3× 469 0.9× 303 1.1× 97 0.6× 339 2.8× 75 1.4k
Zhao Zhang China 19 683 1.0× 436 0.9× 258 0.9× 84 0.5× 98 0.8× 153 1.2k
Harald Räcke United States 16 904 1.3× 525 1.1× 279 1.0× 65 0.4× 101 0.8× 50 1.3k
S. Thomas McCormick Canada 19 430 0.6× 430 0.9× 190 0.7× 488 2.9× 102 0.8× 61 1.3k
Asaf Levin Israel 18 596 0.8× 358 0.7× 146 0.5× 574 3.4× 199 1.6× 130 1.3k
Viswanath Nagarajan United States 16 396 0.6× 331 0.7× 82 0.3× 220 1.3× 161 1.3× 76 862
Kazuhisa Makino Japan 18 329 0.5× 587 1.2× 88 0.3× 109 0.6× 116 1.0× 146 1.1k
Niv Buchbinder Israel 18 956 1.3× 457 0.9× 164 0.6× 115 0.7× 391 3.2× 62 1.4k
Vangélis Th. Paschos France 18 451 0.6× 589 1.2× 99 0.3× 304 1.8× 73 0.6× 119 1.1k
Mohit Singh United States 16 332 0.5× 363 0.7× 80 0.3× 122 0.7× 111 0.9× 81 782

Countries citing papers authored by Jochen Könemann

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

20 of 20 papers shown
1.
Könemann, Jochen, et al.. (2024). On the complexity of nucleolus computation for bipartite b-matching games. Theoretical Computer Science. 998. 114476–114476.
2.
Könemann, Jochen, et al.. (2020). Computing the nucleolus of weighted cooperative matching games in polynomial time. Mathematical Programming. 183(1-2). 555–581. 9 indexed citations
3.
Feldmann, Andreas Emil, et al.. (2016). Lehman's Theorem and the Directed Steiner Tree Problem. SIAM Journal on Discrete Mathematics. 30(1). 141–153. 2 indexed citations
4.
Feldmann, Andreas Emil, Jochen Könemann, Neil Olver, & Laura Sanità. (2016). On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Mathematical Programming. 160(1-2). 379–406. 8 indexed citations
5.
Guenin, Bertrand, Jochen Könemann, & Levent Tunçel. (2014). A Gentle Introduction to Optimization. Cambridge University Press eBooks. 31 indexed citations
6.
Georgiou, Konstantinos, et al.. (2013). Social exchange networks with distant bargaining. Theoretical Computer Science. 554. 263–274.
7.
Könemann, Jochen, et al.. (2013). An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree. 568–577. 10 indexed citations
8.
Chan, Timothy M., et al.. (2012). Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. Symposium on Discrete Algorithms. 1576–1585. 24 indexed citations
9.
Bansal, Nikhil, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, & Britta Peis. (2012). On generalizations of network design problems with degree bounds. Mathematical Programming. 141(1-2). 479–506. 8 indexed citations
10.
Gupta, Anupam & Jochen Könemann. (2010). Approximation algorithms for network design: A survey. 16(1). 3–20. 23 indexed citations
11.
Könemann, Jochen, Ojas Parekh, & Danny Segev. (2009). A Unified Approach to Approximating Partial Covering Problems. Algorithmica. 59(4). 489–509. 38 indexed citations
12.
Gupta, Anupam, Jochen Könemann, Stefano Leonardi, R. Ravi, & Guido Schäfer. (2007). An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. Symposium on Discrete Algorithms. 1153–1162. 15 indexed citations
13.
Becchetti, Luca, et al.. (2007). Sharing the cost more efficiently. ACM Transactions on Algorithms. 3(2). 23–23. 3 indexed citations
14.
Könemann, Jochen, et al.. (2006). Cut problems in graphs with a budget constraint. Journal of Discrete Algorithms. 5(2). 262–279. 12 indexed citations
15.
Könemann, Jochen, Stefano Leonardi, & Guido Schäfer. (2005). A group-strategyproof mechanism for Steiner forests. Symposium on Discrete Algorithms. 612–619. 25 indexed citations
16.
Becchetti, Luca, Jochen Könemann, Stefano Leonardi, & Martin Pál. (2005). Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. Symposium on Discrete Algorithms. 375–384. 8 indexed citations
17.
Althaus, Ernst, Stefan Funke, Sariel Har-Peled, et al.. (2004). Approximating k-hop minimum-spanning trees. Operations Research Letters. 33(2). 115–120. 33 indexed citations
18.
Eisenbrand, Friedrich, Stefan Funke, Naveen Garg, & Jochen Könemann. (2003). A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. Symposium on Discrete Algorithms. 517–522. 10 indexed citations
19.
Könemann, Jochen & R. Ravi. (2003). Primal-dual meets local search. 389–395. 25 indexed citations
20.
Garg, Naveen & Jochen Könemann. (2002). Faster and simpler algorithms for multicommodity flow and other fractional packing problems. 300–309. 332 indexed citations breakdown →

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Mohammad Taghi Hajiaghayi Breakdown of academic impact, for papers by Zhao Zhang Breakdown of academic impact, for papers by Harald Räcke Breakdown of academic impact, for papers by S. Thomas McCormick Breakdown of academic impact, for papers by Asaf Levin Breakdown of academic impact, for papers by Viswanath Nagarajan Breakdown of academic impact, for papers by Kazuhisa Makino Breakdown of academic impact, for papers by Niv Buchbinder Breakdown of academic impact, for papers by Vangélis Th. Paschos Breakdown of academic impact, for papers by Mohit Singh
Rankless by CCL
2026