| Approximating -Median via Pseudo-Approximation S Li, O Svensson SIAM Journal on Computing 45 (2), 530-547, 2016 | 252 | 2016 |
| Better Guarantees for -Means and Euclidean -Median by Primal-Dual Algorithms S Ahmadian, A Norouzi-Fard, O Svensson, J Ward SIAM Journal on Computing 49 (4), FOCS17-97-FOCS17-156, 2019 | 198 | 2019 |
| Approximating graphic TSP by matchings T Mömke, O Svensson 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 560-569, 2011 | 124 | 2011 |
| Santa claus schedules jobs on unrelated machines O Svensson SIAM Journal on Computing 41 (5), 1318-1341, 2012 | 115 | 2012 |
| LP-based algorithms for capacitated facility location HC An, M Singh, O Svensson SIAM Journal on Computing 46 (1), 272-306, 2017 | 108 | 2017 |
| A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem M Feldman, O Svensson, R Zenklusen Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 100 | 2014 |
| Minimizing the sum of weighted completion times in a concurrent open shop M Mastrolilli, M Queyranne, AS Schulz, O Svensson, NA Uhan Operations Research Letters 38 (5), 390-395, 2010 | 89 | 2010 |
| Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling C Ambuhl, M Mastrolilli, O Svensson 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 329-337, 2007 | 88 | 2007 |
| Online contention resolution schemes M Feldman, O Svensson, R Zenklusen Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 86 | 2016 |
| Hardness of precedence constrained scheduling on identical machines O Svensson SIAM Journal on Computing 40 (5), 1258-1274, 2011 | 73* | 2011 |
| Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut C Ambühl, M Mastrolilli, O Svensson SIAM Journal on Computing 40 (2), 567-596, 2011 | 72 | 2011 |
| Centrality of trees for capacitated k -center HC An, A Bhaskara, C Chekuri, S Gupta, V Madan, O Svensson Mathematical Programming 154 (1), 29-53, 2015 | 71 | 2015 |
| Beyond 1/2-approximation for submodular maximization on massive data streams A Norouzi-Fard, J Tarnawski, S Mitrovic, A Zandieh, A Mousavifar, ... International Conference on Machine Learning, 3829-3838, 2018 | 66 | 2018 |
| A constant-factor approximation algorithm for the asymmetric traveling salesman problem O Svensson, J Tarnawski, LA Végh Journal of the ACM (JACM) 67 (6), 1-53, 2020 | 61 | 2020 |
| Combinatorial algorithm for restricted max-min fair allocation C Annamalai, C Kalaitzis, O Svensson ACM Transactions on Algorithms (TALG) 13 (3), 1-28, 2017 | 53 | 2017 |
| The matching problem in general graphs is in quasi-NC O Svensson, J Tarnawski 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 50 | 2017 |
| Weighted matchings via unweighted augmentations B Gamlath, S Kale, S Mitrovic, O Svensson Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 49 | 2019 |
| Online matching with general arrivals B Gamlath, M Kapralov, A Maggiori, O Svensson, D Wajc 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 26-37, 2019 | 46 | 2019 |
| Removing and adding edges for the traveling salesman problem T Mömke, O Svensson Journal of the ACM (JACM) 63 (1), 1-28, 2016 | 42 | 2016 |
| Lift-and-round to improve weighted completion time on unrelated machines N Bansal, A Srinivasan, O Svensson SIAM Journal on Computing 50 (3), STOC16-138-STOC16-159, 2019 | 40 | 2019 |
