Jochen Koenemann

Cited by

	All	Since 2017
Citations	3033	1008
h-index	28	16
i10-index	49	31

220

110

165

199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120229 11 17 23 27 33 43 93 108 131 176 132 152 161 142 111 143 149 145 166 190 184 130 201 217 84

Public access

View all

15 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
Guido SchäferCWIVerified email at cwi.nl
Naveen GargComputer Science and Engineering, IIT DelhiVerified email at cse.iitd.ac.in
Laura SanitàAssociate Professor, TU EindhovenVerified email at tue.nl
David A. G. PritchardGoogle Los AngelesVerified email at uwaterloo.ca
Nikhil BansalUniversity of MichiganVerified email at umich.edu
Elyot GrantMassachusetts Institute of TechnologyVerified email at mit.edu
Deeparnab ChakrabartyDartmouth CollegeVerified email at dartmouth.edu
Andreas Emil FeldmannCharles University in PragueVerified email at kam.mff.cuni.cz
Anupam GuptaProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
Alessandro PanconesiComputer Science - Sapienza, University of RomeVerified email at di.uniroma1.it
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, SwitzerlandVerified email at idsia.ch
Stefan van ZwamAssistant professor of mathematics, Louisiana State UniversityVerified email at math.lsu.edu
Kanstantsin PashkovichAssistant Professor, University of WaterlooVerified email at uwaterloo.ca
Guy EvenEE, Tel-Aviv UnivVerified email at eng.tau.ac.il
Kedar DhamdhereGoogleVerified email at google.com
Stefan FunkeUniversität Stuttgart, GermanyVerified email at fmi.uni-stuttgart.de
Mauro SozioProfessor of Computer Science at Institut Polytechnique de Paris, Telecom ParisVerified email at telecom-paristech.fr
Friedrich EisenbrandEPFLVerified email at epfl.ch

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	983	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	131	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	110	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	109	2004
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	100	1995
Primal-Dual meets local search: approximating MSTs with nonuniform degree bounds J Könemann, R Ravi SIAM Journal on Computing 34 (3), 763-773, 2005	98	2005
A group-strategyproof mechanism for Steiner forests J Könemann, S Leonardi, G Schäfer SODA 5, 612-619, 2005	75	2005
Approximation algorithms for network design: A survey A Gupta, J Könemann Surveys in Operations Research and Management Science 16 (1), 3-20, 2011	73	2011
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
A unified approach to approximating partial covering problems J Könemann, O Parekh, D Segev Algorithmica 59 (4), 489-509, 2011	58	2011
Distributed weighted vertex cover via maximal matchings F Grandoni, J Könemann, A Panconesi ACM Transactions on Algorithms (TALG) 5 (1), 1-12, 2008	56	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	56	2008
On the integrality ratio for tree augmentation J Cheriyan, H Karloff, R Khandekar, J Könemann Operations Research Letters 36 (4), 399-401, 2008	54	2008
On column-restricted and priority covering integer programs D Chakrabarty, E Grant, J Könemann International Conference on Integer Programming and Combinatorial …, 2010	51	2010
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	48	2007
Approximating the degree-bounded minimum diameter spanning tree problem J Könemann, A Levin, A Sinha Algorithmica 41 (2), 117-129, 2005	48	2005
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	45	2006
Non-clairvoyant scheduling for minimizing mean slowdown N Bansal, K Dhamdhere, J Könemann, A Sinha Algorithmica 40 (4), 305-318, 2004	45	2004
A gentle introduction to optimization B Guenin, J Könemann, L Tuncel Cambridge University Press, 2014	42	2014
From primal-dual to cost shares and back: a stronger LP relaxation for the Steiner forest problem J Könemann, S Leonardi, G Schäfer, S Zwam International Colloquium on Automata, Languages, and Programming, 930-942, 2005	42	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 this author

Cited by

Co-authors