Linear Programming Polytope and Algorithm for Mean Payoff Games. - Ola Svensson; Sergei G. Vorobyov (AAIM, 2006)

Approximating Precedence-Constrained Single Machine Scheduling by Coloring. - Christoph Ambühl; Monaldo Mastrolilli; Ola Svensson (APPROX-RANDOM, 2006)

Linear Complementarity and P-Matrices for Stochastic Games. - Ola Svensson; Sergei G. Vorobyov (Ershov Memorial Conference, 2006)

Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. - Christoph Ambühl; Monaldo Mastrolilli; Ola Svensson (FOCS, 2007)

Scheduling with Precedence Constraints of Low Fractional Dimension. - Christoph Ambühl; Monaldo Mastrolilli; Nikolaus Mutsanas; Ola Svensson (IPCO, 2007)

Approximating Single Machine Scheduling with Scenarios. - Monaldo Mastrolilli; Nikolaus Mutsanas; Ola Svensson (APPROX-RANDOM, 2008)

(Acyclic) JobShops are Hard to Approximate. - Monaldo Mastrolilli; Ola Svensson (FOCS, 2008)

Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders. - Christoph Ambühl; Monaldo Mastrolilli; Nikolaus Mutsanas; Ola Svensson (Bull. EATCS, 2008)

Improved Bounds for Flow Shop Scheduling. - Monaldo Mastrolilli; Ola Svensson (ICALP (1), 2009)

Conditional hardness of precedence constrained scheduling on identical machines. - Ola Svensson (STOC, 2010)

Approximating Linear Threshold Predicates. - Mahdi Cheraghchi; Johan Håstad; Marcus Isaksson; Ola Svensson (Electron. Colloquium Comput. Complex., 2010)

Minimizing the sum of weighted completion times in a concurrent open shop. - Monaldo Mastrolilli; Maurice Queyranne; Andreas S. Schulz; Ola Svensson; Nelson A. Uhan (Oper. Res. Lett., 2010)

Faster Approximation Algorithms for Scheduling with Fixed Jobs. - Klaus Jansen; Lars Prädel; Ulrich M. Schwarz; Ola Svensson (CATS, 2011)

Approximating Graphic TSP by Matchings. - Tobias Mömke; Ola Svensson (FOCS, 2011)

Hardness of Approximating Flow and Job Shop Scheduling Problems. - Monaldo Mastrolilli; Ola Svensson (J. ACM, 2011)

On the Approximability of Single-Machine Scheduling with Precedence Constraints. - Christoph Ambühl; Monaldo Mastrolilli; Nikolaus Mutsanas; Ola Svensson (Math. Oper. Res., 2011)

Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut. - Christoph Ambühl; Monaldo Mastrolilli; Ola Svensson (SIAM J. Comput., 2011)

Hardness of Precedence Constrained Scheduling on Identical Machines. - Ola Svensson (SIAM J. Comput., 2011)

Santa Claus Schedules Jobs on Unrelated Machines. - Ola Svensson (SIAM J. Comput., 2012)

Tight approximation algorithms for scheduling with fixed jobs and nonavailability. - Florian Diedrich; Klaus Jansen; Lars Prädel; Ulrich M. Schwarz; Ola Svensson (ACM Trans. Algorithms, 2012)

Overview of New Approaches for Approximating TSP. - Ola Svensson (WG, 2013)

Centrality of Trees for Capacitated k-Center - Hyung-Chan An; Aditya Bhaskara; Ola Svensson (CoRR, 2013)

Single machine scheduling with scenarios. - Monaldo Mastrolilli; Nikolaus Mutsanas; Ola Svensson (Theor. Comput. Sci., 2013)

Hardness of Vertex Deletion and Project Scheduling. - Ola Svensson (Theory Comput., 2013)

A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. - Moran Feldman; Ola Svensson; Rico Zenklusen (CoRR, 2014)

No Small Linear Program Approximates Vertex Cover within a Factor 2 - e. - Abbas Bazzi; Samuel Fiorini; Sebastian Pokutta; Ola Svensson (FOCS, 2015)

Approximating ATSP by Relaxing Connectivity. - Ola Svensson (FOCS, 2015)

No Small Linear Program Approximates Vertex Cover within a Factor 2-ε. - Abbas Bazzi; Samuel Fiorini; Sebastian Pokutta; Ola Svensson (CoRR, 2015)

Centrality of trees for capacitated k-center. - Hyung-Chan An; Aditya Bhaskara; Chandra Chekuri; Shalmoli Gupta; Vivek Madan; Ola Svensson (Math. Program., 2015)

Strong LP formulations for scheduling splittable jobs on unrelated machines. - José Correa 001; Alberto Marchetti-Spaccamela; Jannik Matuschke; Leen Stougie; Ola Svensson; Víctor Verdugo; José Verschae (Math. Program., 2015)

On the configuration LP for maximum budgeted allocation. - Christos Kalaitzis; Aleksander Madry; Alantha Newman; Lukás Polácek; Ola Svensson (Math. Program., 2015)

Special Issue: APPROX-RANDOM 2013: Guest Editors' Foreword. - Sofya Raskhodnikova; Ola Svensson (Theory Comput., 2015)

Algorithms with Provable Guarantees for Clustering. - Ola Svensson (ESA, 2016)

Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). - Ola Svensson; Jakub Tarnawski; László A. Végh (IPCO, 2016)

Linear Relaxations for Finding Diverse Elements in Metric Spaces. - Aditya Bhaskara; Mehrdad Ghadiri; Vahab S. Mirrokni; Ola Svensson (NIPS, 2016)

Online Contention Resolution Schemes. - Moran Feldman; Ola Svensson; Rico Zenklusen (SODA, 2016)

Removing and Adding Edges for the Traveling Salesman Problem. - Tobias Mömke; Ola Svensson (J. ACM, 2016)

Approximating k-Median via Pseudo-Approximation. - Shi Li 001; Ola Svensson (SIAM J. Comput., 2016)

Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation. - Lukás Polácek; Ola Svensson (ACM Trans. Algorithms, 2016)

Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. - Christos Kalaitzis; Ola Svensson; Jakub Tarnawski (SODA, 2017)

The Matching Problem in General Graphs is in Quasi-NC. - Ola Svensson; Jakub Tarnawski (Electron. Colloquium Comput. Complex., 2017)

LP-Based Algorithms for Capacitated Facility Location. - Hyung-Chan An; Mohit Singh; Ola Svensson (SIAM J. Comput., 2017)

Dynamic Facility Location via Exponential Clocks. - Hyung-Chan An; Ashkan Norouzi-Fard; Ola Svensson (ACM Trans. Algorithms, 2017)

Combinatorial Algorithm for Restricted Max-Min Fair Allocation. - Chidambaram Annamalai 001; Christos Kalaitzis; Ola Svensson (ACM Trans. Algorithms, 2017)

Algorithms for the Asymmetric Traveling Salesman Problem (Invited Paper). - Ola Svensson (FSTTCS, 2018)

Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering. - Buddhima Gamlath; Sangxia Huang; Ola Svensson (ICALP, 2018)

Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. - Ashkan Norouzi-Fard; Jakub Tarnawski; Slobodan Mitrovic; Amir Zandieh; Aidasadat Mousavifar; Ola Svensson (ICML, 2018)

On Bounded Pitch Inequalities for the Min-Knapsack Polytope. - Yuri Faenza; Igor Malinovic; Monaldo Mastrolilli; Ola Svensson (ISCO, 2018)

A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. - Moran Feldman; Ola Svensson; Rico Zenklusen (Math. Oper. Res., 2018)

Constant factor approximation for ATSP with two edge weights. - Ola Svensson; Jakub Tarnawski; László A. Végh (Math. Program., 2018)

Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. - Abbas Bazzi; Samuel Fiorini; Sangxia Huang; Ola Svensson (Theory Comput., 2018)

Optimal Software Patching Plan for PMUs. - Teklemariam Tsegay Tesfay; Jean-Yves Le Boudec; Ola Svensson (IEEE Trans. Smart Grid, 2018)

New Notions and Constructions of Sparsification for Graphs and Hypergraphs. - Nikhil Bansal 001; Ola Svensson; Luca Trevisan 001 (FOCS, 2019)

Online Matching with General Arrivals. - Buddhima Gamlath; Michael Kapralov; Andreas Maggiori; Ola Svensson; David Wajc (FOCS, 2019)

Approximately Good and Modern Matchings (Invited Talk). - Ola Svensson (ICALP, 2019)

Weighted Matchings via Unweighted Augmentations. - Buddhima Gamlath; Sagar Kale; Slobodan Mitrovic; Ola Svensson (PODC, 2019)

Beating Greedy for Stochastic Bipartite Matching. - Buddhima Gamlath; Sagar Kale; Ola Svensson (SODA, 2019)

No Small Linear Program Approximates Vertex Cover Within a Factor 2 - ɛ. - Abbas Bazzi; Samuel Fiorini; Sebastian Pokutta; Ola Svensson (Math. Oper. Res., 2019)

Robust Algorithms Under Adversarial Injections. - Paritosh Garg; Sagar Kale; Lars Rohwedder; Ola Svensson (ICALP, 2020)

Learning Augmented Energy Minimization via Speed Scaling. - Étienne Bamas; Andreas Maggiori; Lars Rohwedder; Ola Svensson (NeurIPS, 2020)

The Primal-Dual method for Learning Augmented Algorithms. - Étienne Bamas; Andreas Maggiori; Ola Svensson (NeurIPS, 2020)

Fast and Accurate $k$-means++ via Rejection Sampling. - Vincent Cohen-Addad; Silvio Lattanzi; Ashkan Norouzi-Fard; Christian Sohler; Ola Svensson (NeurIPS, 2020)

Scheduling (Dagstuhl Seminar 20081). - Nicole Megow; David B. Shmoys; Ola Svensson (Dagstuhl Reports, 2020)

A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. - Ola Svensson; Jakub Tarnawski; László A. Végh (J. ACM, 2020)

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. - Sara Ahmadian; Ashkan Norouzi-Fard; Ola Svensson; Justin Ward (SIAM J. Comput., 2020)

Parallel and Efficient Hierarchical k-Median Clustering. - Vincent Cohen-Addad; Silvio Lattanzi; Ashkan Norouzi-Fard; Christian Sohler; Ola Svensson (NeurIPS, 2021)

Nearly-Tight and Oblivious Algorithms for Explainable Clustering. - Buddhima Gamlath; Xinrui Jia 001; Adam Polak 001; Ola Svensson (NeurIPS, 2021)

Consistent k-Clustering for General Metrics. - Hendrik Fichtenberger; Silvio Lattanzi; Ashkan Norouzi-Fard; Ola Svensson (SODA, 2021)

A QPTAS for stabbing rectangles. - Friedrich Eisenbrand; Martina Gallato; Ola Svensson; Moritz Venzin (CoRR, 2021)

Streaming Submodular Maximization with Matroid and Matching Constraints. - Moran Feldman; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (CoRR, 2021)

Towards Non-Uniform k-Center with Constant Types of Radii. - Xinrui Jia 001; Lars Rohwedder; Kshiteej Sheth; Ola Svensson (CoRR, 2021)

Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. - Nikhil Bansal 001; Aravind Srinivasan; Ola Svensson (SIAM J. Comput., 2021)

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems. - Moran Feldman; Ola Svensson; Rico Zenklusen (SIAM J. Comput., 2021)

Approximate Cluster Recovery from Noisy Labels. - Buddhima Gamlath; Silvio Lattanzi; Ashkan Norouzi-Fard; Ola Svensson (COLT, 2022)

Submodular Maximization Subject to Matroid Intersection on the Fly. - Moran Feldman; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (ESA, 2022)

Streaming Submodular Maximization Under Matroid Constraints. - Moran Feldman; Paul Liu 001; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (ICALP, 2022)

A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. - Étienne Bamas; Marina Drygala; Ola Svensson (IPCO, 2022)

Towards Non-Uniform k-Center with Constant Types of Radii. - Xinrui Jia 001; Lars Rohwedder; Kshiteej Sheth; Ola Svensson (SOSA, 2022)

Flow time scheduling and prefix Beck-Fiala. - Nikhil Bansal 001; Lars Rohwedder; Ola Svensson (STOC, 2022)

On inequalities with bounded coefficients and pitch for the min knapsack polytope. - Daniel Bienstock; Yuri Faenza; Igor Malinovic; Monaldo Mastrolilli; Ola Svensson; Mark Zuckerberg (Discret. Optim., 2022)

Fair colorful k-center clustering. - Xinrui Jia 001; Kshiteej Sheth; Ola Svensson (Math. Program., 2022)

A Framework for the Secretary Problem on the Intersection of Matroids. - Moran Feldman; Ola Svensson; Rico Zenklusen (SIAM J. Comput., 2022)

Online Algorithms with Costly Predictions. - Marina Drygala; Sai Ganesh Nagarajan; Ola Svensson (AISTATS, 2023)

The Price of Explainability for Clustering. - Anupam Gupta 001; Madhusudhan Reddy Pittu; Ola Svensson; Rachel Yuan (FOCS, 2023)

Speeding Up Bellman Ford via Minimum Violation Permutations. - Silvio Lattanzi; Ola Svensson; Sergei Vassilvitskii (ICML, 2023)

The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. - Xinrui Jia 001; Ola Svensson; Weiqiang Yuan 002 (SODA, 2023)

An Analysis of $D^α$ seeding for $k$-means. - Étienne Bamas; Sai Ganesh Nagarajan; Ola Svensson (CoRR, 2023)

Scheduling (Dagstuhl Seminar 23061). - Nicole Megow; Benjamin Moseley; David B. Shmoys; Ola Svensson; Sergei Vassilvitskii; Jens Schlöter (Dagstuhl Reports, 2023)

Semi-streaming algorithms for submodular matroid intersection. - Paritosh Garg; Linus Jordan; Ola Svensson (Math. Program., 2023)

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. - Moran Feldman; Ashkan Norouzi-Fard; Ola Svensson; Rico Zenklusen (J. ACM, 2023)

Analyzing Dα seeding for k-means. - Étienne Bamas; Sai Ganesh Nagarajan; Ola Svensson (ICML, 2024)

Simple and Asymptotically Optimal Online Bipartite Edge Coloring. - Joakim Blikstad; Ola Svensson; Radu Vintan; David Wajc (SOSA, 2024)

Online Edge Coloring Is (Nearly) as Easy as Offline. - Joakim Blikstad; Ola Svensson; Radu Vintan; David Wajc (STOC, 2024)

Could ChatGPT get an Engineering Degree? Evaluating Higher Education Vulnerability to AI Assistants. - Beatriz Borges; Negar Foroutan; Deniz Bayazit; Anna Sotnikova; Syrielle Montariol; Tanya Nazaretzky; Mohammadreza Banaei; Alireza Sakhaeirad; Philippe Servant; Seyed Parsa Neshaei; Jibril Frej; Angelika Romanou; et al. (CoRR, 2024)

Asymptotically Optimal Hardness for k-Set Packing and k-Matroid Intersection. - Euiwoong Lee; Ola Svensson; Theophile Thiery (CoRR, 2024)

Data-Driven Solution Portfolios. - Marina Drygala; Silvio Lattanzi; Andreas Maggiori; Miltiadis Stouras; Ola Svensson; Sergei Vassilvitskii (ITCS, 2025)

Deterministic Online Bipartite Edge Coloring. - Joakim Blikstad; Ola Svensson; Radu Vintan; David Wajc (SODA, 2025)

A (2+ε)-Approximation Algorithm for Metric k-Median. - Vincent Cohen-Addad; Fabrizio Grandoni 001; Euiwoong Lee; Chris Schwiegelshohn; Ola Svensson (STOC, 2025)

The Cost of Consistency: Submodular Maximization with Constant Recourse. - Paul Dütting; Federico Fusco; Silvio Lattanzi; Ashkan Norouzi-Fard; Ola Svensson; Morteza Zadimoghaddam (STOC, 2025)

Asymptotically Optimal Hardness for k-Set Packing and k-Matroid Intersection. - Euiwoong Lee; Ola Svensson; Theophile Thiery (STOC, 2025)

A (2+ ϵ)-Approximation Algorithm for Metric k-Median. - Vincent Cohen-Addad; Fabrizio Grandoni 001; Euiwoong Lee; Chris Schwiegelshohn; Ola Svensson (CoRR, 2025)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution. - Moran Feldman; Ola Svensson; Rico Zenklusen (CoRR, 2025)

Online Edge Coloring: Sharp Thresholds. - Joakim Blikstad; Ola Svensson; Radu Vintan; David Wajc (CoRR, 2025)