| 2026 | COLT | Space-Efficient Language Generation in the Limit. | Nicolas Flammarion, Chirag Pabbaraju, Hristo Papazov, Miltiadis Stouras, Ola Svensson |
| 2026 | SODA | Nearly Tight Sample Complexity for Matroid Online Contention Resolution. | Moran Feldman, Ola Svensson, Rico Zenklusen |
| 2026 | STOC | An Optimal Algorithm for Stochastic Vertex Cover. | Jan van den Brand, Inge Li Grtz, Chirag Pabbaraju, Debmalya Panigrahi, Clifford Stein, Miltiadis Stouras, Ola Svensson, Ali Vakilian |
| 2026 | STOC | A Strong Linear Programming Relaxation for Weighted Tree Augmentation. | Vincent Cohen-Addad, Marina Drygala, Nathan Klein, Ola Svensson |
| 2026 | STACS | Advancements in Online Edge Coloring Algorithms (Invited Talk). | Ola Svensson |
| 2025 | FOCS | Online Edge Coloring: Sharp Thresholds. | Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc |
| 2025 | SODA | Deterministic Online Bipartite Edge Coloring. | Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc |
| 2025 | STOC | A (2+ε)-Approximation Algorithm for Metric k-Median. | Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn, Ola Svensson |
| 2025 | STOC | The Cost of Consistency: Submodular Maximization with Constant Recourse. | Paul Dtting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson, Morteza Zadimoghaddam |
| 2025 | STOC | Asymptotically Optimal Hardness for k-Set Packing and k-Matroid Intersection. | Euiwoong Lee, Ola Svensson, Theophile Thiery |
| 2024 | ICML | Analyzing Dα seeding for k-means. | tienne Bamas, Sai Ganesh Nagarajan, Ola Svensson |
| 2024 | STOC | Online Edge Coloring Is (Nearly) as Easy as Offline. | Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc |
| 2023 | AISTATS | Online Algorithms with Costly Predictions. | Marina Drygala, Sai Ganesh Nagarajan, Ola Svensson |
| 2023 | FOCS | The Price of Explainability for Clustering. | Anupam Gupta, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan |
| 2023 | ICML | Speeding Up Bellman Ford via Minimum Violation Permutations. | Silvio Lattanzi, Ola Svensson, Sergei Vassilvitskii |
| 2023 | SODA | The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. | Xinrui Jia, Ola Svensson, Weiqiang Yuan |
| 2022 | COLT | Approximate Cluster Recovery from Noisy Labels. | Buddhima Gamlath, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson |
| 2022 | ESA | Submodular Maximization Subject to Matroid Intersection on the Fly. | Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen |
| 2022 | ICALP | Streaming Submodular Maximization Under Matroid Constraints. | Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen |
| 2022 | IPCO | A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. | tienne Bamas, Marina Drygala, Ola Svensson |
| 2022 | STOC | Flow time scheduling and prefix Beck-Fiala. | Nikhil Bansal, Lars Rohwedder, Ola Svensson |
| 2021 | IPCO | Semi-streaming Algorithms for Submodular Matroid Intersection. | Paritosh Garg, Linus Jordan, Ola Svensson |
| 2021 | SODA | Consistent k-Clustering for General Metrics. | Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson |
| 2020 | ICALP | Robust Algorithms Under Adversarial Injections. | Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson |
| 2020 | IPCO | Fair Colorful k-Center Clustering. | Xinrui Jia, Kshiteej Sheth, Ola Svensson |
| 2020 | STOC | The one-way communication complexity of submodular maximization with applications to streaming and robustness. | Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen |
| 2019 | FOCS | New Notions and Constructions of Sparsification for Graphs and Hypergraphs. | Nikhil Bansal, Ola Svensson, Luca Trevisan |
| 2019 | FOCS | Online Matching with General Arrivals. | Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc |
| 2019 | ICALP | Approximately Good and Modern Matchings (Invited Talk). | Ola Svensson |
| 2019 | PODC | Weighted Matchings via Unweighted Augmentations. | Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson |
| 2019 | SODA | Beating Greedy for Stochastic Bipartite Matching. | Buddhima Gamlath, Sagar Kale, Ola Svensson |
| 2018 | ICALP | Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering. | Buddhima Gamlath, Sangxia Huang, Ola Svensson |
| 2018 | ICML | Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. | Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aidasadat Mousavifar, Ola Svensson |
| 2018 | SODA | A Framework for the Secretary Problem on the Intersection of Matroids. | Moran Feldman, Ola Svensson, Rico Zenklusen |
| 2018 | STOC | A constant-factor approximation algorithm for the asymmetric traveling salesman problem. | Ola Svensson, Jakub Tarnawski, Lszl A. Vgh |
| 2017 | FOCS | Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. | Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward |
| 2017 | FOCS | The Matching Problem in General Graphs Is in Quasi-NC. | Ola Svensson, Jakub Tarnawski |
| 2017 | SODA | Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. | Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson |
| 2017 | SODA | Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. | Christos Kalaitzis, Ola Svensson, Jakub Tarnawski |
| 2016 | ESA | Algorithms with Provable Guarantees for Clustering. | Ola Svensson |
| 2016 | IPCO | Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). | Ola Svensson, Jakub Tarnawski, Lszl A. Vgh |
| 2016 | SODA | Online Contention Resolution Schemes. | Moran Feldman, Ola Svensson, Rico Zenklusen |
| 2016 | STOC | Lift-and-round to improve weighted completion time on unrelated machines. | Nikhil Bansal, Aravind Srinivasan, Ola Svensson |
| 2015 | FOCS | No Small Linear Program Approximates Vertex Cover within a Factor 2 - e. | Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson |
| 2015 | FOCS | Approximating ATSP by Relaxing Connectivity. | Ola Svensson |
| 2015 | SODA | Combinatorial Algorithm for Restricted Max-Min Fair Allocation. | Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson |
| 2015 | SODA | Dynamic Facility Location via Exponential Clocks. | Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson |
| 2015 | SODA | A Simple | Moran Feldman, Ola Svensson, Rico Zenklusen |
| 2014 | FOCS | LP-Based Algorithms for Capacitated Facility Location. | Hyung-Chan An, Mohit Singh, Ola Svensson |
| 2014 | IPCO | Centrality of Trees for Capacitated k-Center. | Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson |
| 2014 | IPCO | Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines. | Jos R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Victor Verdugo, Jos Verschae |
| 2014 | IPCO | On the Configuration LP for Maximum Budgeted Allocation. | Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson |
| 2013 | STOC | Approximating k-median via pseudo-approximation. | Shi Li, Ola Svensson |
| 2013 | WG | Overview of New Approaches for Approximating TSP. | Ola Svensson |
| 2012 | ICALP | Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation. | Lukas Polacek, Ola Svensson |
| 2011 | FOCS | Approximating Graphic TSP by Matchings. | Tobias Mmke, Ola Svensson |
| 2011 | STOC | Santa Claus schedules jobs on unrelated machines. | Ola Svensson |
| 2010 | STOC | Conditional hardness of precedence constrained scheduling on identical machines. | Ola Svensson |
| 2009 | ICALP | Improved Bounds for Flow Shop Scheduling. | Monaldo Mastrolilli, Ola Svensson |
| 2008 | FOCS | (Acyclic) JobShops are Hard to Approximate. | Monaldo Mastrolilli, Ola Svensson |
| 2007 | FOCS | Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. | Christoph Ambhl, Monaldo Mastrolilli, Ola Svensson |
| 2007 | IPCO | Scheduling with Precedence Constraints of Low Fractional Dimension. | Christoph Ambhl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson |
| 2006 | AAIM | Linear Programming Polytope and Algorithm for Mean Payoff Games. | Ola Svensson, Sergei G. Vorobyov |