Jochen Koenemann

Cited by

	All	Since 2018
Citations	3277	1074
h-index	29	17
i10-index	49	29

200

100

150

19971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202310 11 19 19 30 30 53 86 112 134 183 136 135 157 142 107 144 144 145 172 189 185 141 189 194 184 179

Public access

View all

13 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Stefano LeonardiProfessor of Computer Science, Sapienza University of RomeVerified email at dis.uniroma1.it
R RaviCarnegie Mellon UnviersityVerified email at andrew.cmu.edu
Naveen GargComputer Science and Engineering, IIT DelhiVerified email at cse.iitd.ac.in
Laura SanitàAssociate Professor, Bocconi University of MilanVerified email at unibocconi.it
Guido SchäferCWIVerified email at cwi.nl
David A. G. PritchardGoogle Los AngelesVerified email at uwaterloo.ca
Elyot GrantMassachusetts Institute of TechnologyVerified email at mit.edu
Andreas Emil FeldmannCharles University in PragueVerified email at kam.mff.cuni.cz
Deeparnab ChakrabartyDartmouth CollegeVerified email at dartmouth.edu
Stefan van ZwamAssistant professor of mathematics, Louisiana State UniversityVerified email at math.lsu.edu
Nikhil BansalUniversity of MichiganVerified email at umich.edu
Alessandro PanconesiComputer Science - Sapienza, University of RomeVerified email at di.uniroma1.it
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, SwitzerlandVerified email at idsia.ch
Kanstantsin PashkovichAssistant Professor, University of WaterlooVerified email at uwaterloo.ca
Guy EvenEE, Tel-Aviv UnivVerified email at eng.tau.ac.il
Stefan FunkeUniversität Stuttgart, GermanyVerified email at fmi.uni-stuttgart.de
Kedar DhamdhereGoogleVerified email at google.com
Samuel FioriniUniversité libre de BruxellesVerified email at ulb.ac.be
Martin GroßRWTH AachenVerified email at oms.rwth-aachen.de
Mauro SozioProfessor of Computer Science at Institut Polytechnique de Paris, Telecom ParisVerified email at telecom-paristech.fr

Jochen Koenemann

University of Waterloo

Verified email at uwaterloo.ca - Homepage

Combinatorial Optimization Approximation Algorithms Algorithmic Game Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Faster and simpler algorithms for multicommodity flow and other fractional packing problems N Garg, J Könemann SIAM Journal on Computing 37 (2), 630-652, 2007	1036	2007
A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees J Könemann, R Ravi Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000	132	2000
Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling TM Chan, E Grant, J Könemann, M Sharpe Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	125	2012
Min–max tree covers of graphs G Even, N Garg, J Könemann, R Ravi, A Sinha Operations Research Letters 32 (4), 309-315, 2004	122	2004
A group-strategyproof cost sharing mechanism for the Steiner forest game J Könemann, S Leonardi, G Schäfer, SHM van Zwam SIAM Journal on Computing 37 (5), 1319-1341, 2008	113	2008
Primal-dual meets local search: approximating MST's with nonuniform degree bounds J Könemann, R Ravi Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003	99	2003
Exact geometric computation in LEDA C Burnikel, J Könemann, K Mehlhorn, S Näher, S Schirra, C Uhrig Proceedings of the eleventh annual symposium on Computational geometry, 418-419, 1995	99	1995
Approximation algorithms for network design: A survey A Gupta, J Könemann Surveys in Operations Research and Management Science 16 (1), 3-20, 2011	78	2011
A unified approach to approximating partial covering problems J Könemann, O Parekh, D Segev Algorithmica 59 (4), 489-509, 2011	66	2011
A gentle introduction to optimization B Guenin, J Könemann, L Tuncel Cambridge University Press, 2014	65	2014
Approximating k-hop minimum-spanning trees E Althaus, S Funke, S Har-Peled, J Könemann, EA Ramos, M Skutella Operations Research Letters 33 (2), 115-120, 2005	63	2005
On the integrality ratio for tree augmentation J Cheriyan, H Karloff, R Khandekar, J Könemann Operations Research Letters 36 (4), 399-401, 2008	61	2008
Distributed weighted vertex cover via maximal matchings F Grandoni, J Könemann, A Panconesi ACM Transactions on Algorithms (TALG) 5 (1), 1-12, 2008	57	2008
Distributed weighted vertex cover via maximal matchings F Grandoni, J Könemann, A Panconesi ACM Transactions on Algorithms (TALG) 5 (1), 1-12, 2008	57	2008
Non-clairvoyant scheduling for minimizing mean slowdown N Bansal, K Dhamdhere, J Könemann, A Sinha Algorithmica 40, 305-318, 2004	52	2004
On column-restricted and priority covering integer programs D Chakrabarty, E Grant, J Könemann Integer Programming and Combinatorial Optimization: 14th International …, 2010	51	2010
Approximating weighted tree augmentation via Chvátal-Gomory cuts S Fiorini, M Groß, J Könemann, L Sanità Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018	49	2018
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem A Gupta, J Könemann, S Leonardi, R Ravi, G Schäfer SODA 7, 1153-1162, 2007	49	2007
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic steiner tree L Fleischer, J Könemann, S Leonardi, G Schäfer Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006	47	2006
Approximating the degree-bounded minimum diameter spanning tree problem J Könemann, A Levin, A Sinha Algorithmica 41, 117-129, 2005	47	2005

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors