Ola Svensson - RankMe

181 papers A* 50A 6B 10C 2Journal 101Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Strong Linear Programming Relaxation for Weighted Tree Augmentation. CoRR Vincent Cohen-Addad, Marina Drygala, Nathan Klein, Ola Svensson
2026	J	`jnl`	Accelerating Scientific Research with Gemini: Case Studies and Common Techniques. CoRR David P. Woodruff, Vincent Cohen-Addad, Lalit Jain, Jieming Mao, Song Zuo, MohammadHossein Bateni, Simina Brânzei, Michael P. Brenner, Lin Chen, Ying Feng, Lance Fortnow, Gang Fu, Ziyi Guan, Zahra Hadizadeh, Mohammad T. Hajiaghayi, Mahdi JafariRaviz, Adel Javanmard, Karthik C. S., Ken-ichi Kawarabayashi, Ravi Kumar, Silvio Lattanzi, Euiwoong Lee, Yi Li, Ioannis Panageas, Dimitris Paparas, Benjamin Przybocki, Bernardo Subercaseaux, Ola Svensson, Shayan Taherijam, Xuan Wu, Eylon Yogev, Morteza Zadimoghaddam, Samson Zhou, Yossi Matias, James Manyika, Vahab Mirrokni
2026	A	`conf`	Advancements in Online Edge Coloring Algorithms (Invited Talk). STACS Ola Svensson
2026	J	`jnl`	An Optimal Algorithm for Stochastic Vertex Cover. CoRR Jan van den Brand, Inge Li Gørtz, Chirag Pabbaraju, Debmalya Panigrahi, Clifford Stein, Miltiadis Stouras, Ola Svensson, Ali Vakilian
2026	A*	`conf`	Nearly Tight Sample Complexity for Matroid Online Contention Resolution. SODA Moran Feldman, Ola Svensson, Rico Zenklusen
2026	J	`jnl`	Streaming Submodular Maximization Under Matroid Constraints. Math. Oper. Res. Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2025	J	`jnl`	A (2+ ϵ)-Approximation Algorithm for Metric CoRR Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn, Ola Svensson
2025	A*	`conf`	A (2+ε)-Approximation Algorithm for Metric k-Median. STOC Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee, Chris Schwiegelshohn, Ola Svensson
2025	A*	`conf`	Asymptotically Optimal Hardness for k-Set Packing and k-Matroid Intersection. STOC Euiwoong Lee, Ola Svensson, Theophile Thiery
2025	J	`jnl`	Clustering with Label Consistency. CoRR Diptarka Chakraborty, Hendrik Fichtenberger, Bernhard Haeupler, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson
2025	A	`conf`	Data-Driven Solution Portfolios. ITCS Marina Drygala, Silvio Lattanzi, Andreas Maggiori, Miltiadis Stouras, Ola Svensson, Sergei Vassilvitskii
2025	A*	`conf`	Deterministic Online Bipartite Edge Coloring. SODA Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2025	J	`jnl`	Nearly Tight Sample Complexity for Matroid Online Contention Resolution. CoRR Moran Feldman, Ola Svensson, Rico Zenklusen
2025	A*	`conf`	Online Edge Coloring: Sharp Thresholds. FOCS Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2025	J	`jnl`	Online Edge Coloring: Sharp Thresholds. CoRR Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2025	A*	`conf`	The Cost of Consistency: Submodular Maximization with Constant Recourse. STOC Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson, Morteza Zadimoghaddam
2024	A*	`ed.`	51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, Tallinn, Estonia, July 8-12, 2024 ICALP Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson
2024	A*	`conf`	Analyzing Dα seeding for k-means. ICML Étienne Bamas, Sai Ganesh Nagarajan, Ola Svensson
2024	J	`jnl`	Asymptotically Optimal Hardness for CoRR Euiwoong Lee, Ola Svensson, Theophile Thiery
2024	J	`jnl`	Could ChatGPT get an Engineering Degree? Evaluating Higher Education Vulnerability to AI Assistants. CoRR 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, Gail Weiss, Sepideh Mamooler, Zeming Chen, Simin Fan, Silin Gao, Mete Ismayilzada, Debjit Paul, Alexandre Schöpfer, Andrej Janchevski, Anja Tiede, Clarence Linden, Emanuele Troiani, Francesco Salvi, Freya Behrens, Giacomo Orsi, Giovanni Piccioli, Hadrien Sevel, Louis Coulon, Manuela Pineros-Rodriguez, Marin Bonnassies, Pierre Hellich, Puck van Gerwen, Sankalp Gambhir, Solal Pirelli, Thomas Blanchard, Timothée Callens, Toni Abi Aoun, Yannick Calvino Alonso, Yuri Cho, Alberto Silvio Chiappa, Antonio Sclocchi, Étienne Bruno, Florian Hofhammer, Gabriel Pescia, Geovani Rizk, Leello Dadi, Lucas Stoffl, Manoel Horta Ribeiro, Matthieu Bovel, Yueyang Pan, Aleksandra Radenovic, Alexandre Alahi, Alexander Mathis, Anne-Florence Bitbol, Boi Faltings, Cécile Hébert, Devis Tuia, François Maréchal, George Candea, Giuseppe Carleo, Jean-Cédric Chappelier, Nicolas Flammarion, Jean-Marie Fürbringer, Jean-Philippe Pellet, Karl Aberer, Lenka Zdeborová, Marcel Salathé, Martin Jaggi, Martin Rajman, Mathias Payer, Matthieu Wyart, Michael Gastpar, Michele Ceriotti, Ola Svensson, Olivier Lévêque, Paolo Ienne, Rachid Guerraoui, Robert West, Sanidhya Kashyap, Valerio Piazza, Viesturs Simanis, Viktor Kuncak, Volkan Cevher, Philippe Schwaller, Sacha Friedli, Patrick Jermann, Tanja Käser, Antoine Bosselut
2024	J	`jnl`	Data-Driven Solution Portfolios. CoRR Marina Drygala, Silvio Lattanzi, Andreas Maggiori, Miltiadis Stouras, Ola Svensson, Sergei Vassilvitskii
2024	J	`jnl`	Deterministic Online Bipartite Edge Coloring. CoRR Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2024	A*	`conf`	Online Edge Coloring Is (Nearly) as Easy as Offline. STOC Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2024	J	`jnl`	Online Edge Coloring is (Nearly) as Easy as Offline. CoRR Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2024	—	`conf`	Simple and Asymptotically Optimal Online Bipartite Edge Coloring. SOSA Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2024	J	`jnl`	The Cost of Consistency: Submodular Maximization with Constant Recourse. CoRR Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson, Morteza Zadimoghaddam
2023	J	`jnl`	An Analysis of $D^α$ seeding for $k$-means. CoRR Étienne Bamas, Sai Ganesh Nagarajan, Ola Svensson
2023	A	`conf`	Online Algorithms with Costly Predictions. AISTATS Marina Drygala, Sai Ganesh Nagarajan, Ola Svensson
2023	J	`jnl`	Scheduling (Dagstuhl Seminar 23061). Dagstuhl Reports Nicole Megow, Benjamin Moseley, David B. Shmoys, Ola Svensson, Sergei Vassilvitskii, Jens Schlöter
2023	J	`jnl`	Semi-streaming algorithms for submodular matroid intersection. Math. Program. Paritosh Garg, Linus Jordan, Ola Svensson
2023	J	`jnl`	Simple and Asymptotically Optimal Online Bipartite Edge Coloring. CoRR Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
2023	A*	`conf`	Speeding Up Bellman Ford via Minimum Violation Permutations. ICML Silvio Lattanzi, Ola Svensson, Sergei Vassilvitskii
2023	A*	`conf`	The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. SODA Xinrui Jia, Ola Svensson, Weiqiang Yuan
2023	J	`jnl`	The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. J. ACM Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2023	A*	`conf`	The Price of Explainability for Clustering. FOCS Anupam Gupta, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan
2023	J	`jnl`	The Price of Explainability for Clustering. CoRR Anupam Gupta, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan
2022	J	`jnl`	A Framework for the Secretary Problem on the Intersection of Matroids. SIAM J. Comput. Moran Feldman, Ola Svensson, Rico Zenklusen
2022	B	`conf`	A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. IPCO Étienne Bamas, Marina Drygala, Ola Svensson
2022	J	`jnl`	A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. CoRR Étienne Bamas, Marina Drygala, Ola Svensson
2022	A*	`conf`	Approximate Cluster Recovery from Noisy Labels. COLT Buddhima Gamlath, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson
2022	J	`jnl`	Fair colorful k-center clustering. Math. Program. Xinrui Jia, Kshiteej Sheth, Ola Svensson
2022	J	`jnl`	Flow Time Scheduling and Prefix Beck-Fiala. CoRR Nikhil Bansal, Lars Rohwedder, Ola Svensson
2022	A*	`conf`	Flow time scheduling and prefix Beck-Fiala. STOC Nikhil Bansal, Lars Rohwedder, Ola Svensson
2022	J	`jnl`	On inequalities with bounded coefficients and pitch for the min knapsack polytope. Discret. Optim. Daniel Bienstock, Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson, Mark Zuckerberg
2022	A*	`conf`	Streaming Submodular Maximization Under Matroid Constraints. ICALP Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2022	A	`conf`	Submodular Maximization Subject to Matroid Intersection on the Fly. ESA Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2022	J	`jnl`	Submodular Maximization Subject to Matroid Intersection on the Fly. CoRR Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2022	J	`jnl`	The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. CoRR Xinrui Jia, Ola Svensson, Weiqiang Yuan
2022	—	`conf`	Towards Non-Uniform SOSA Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson
2021	J	`jnl`	A QPTAS for stabbing rectangles. CoRR Friedrich Eisenbrand, Martina Gallato, Ola Svensson, Moritz Venzin
2021	A*	`conf`	Consistent k-Clustering for General Metrics. SODA Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson
2021	J	`jnl`	Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. SIAM J. Comput. Nikhil Bansal, Aravind Srinivasan, Ola Svensson
2021	A*	`conf`	Nearly-Tight and Oblivious Algorithms for Explainable Clustering. NeurIPS Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson
2021	J	`jnl`	Nearly-Tight and Oblivious Algorithms for Explainable Clustering. CoRR Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson
2021	J	`jnl`	Online Contention Resolution Schemes with Applications to Bayesian Selection Problems. SIAM J. Comput. Moran Feldman, Ola Svensson, Rico Zenklusen
2021	A*	`conf`	Parallel and Efficient Hierarchical k-Median Clustering. NeurIPS Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson
2021	J	`jnl`	Semi-Streaming Algorithms for Submodular Matroid Intersection. CoRR Paritosh Garg, Linus Jordan, Ola Svensson
2021	B	`conf`	Semi-streaming Algorithms for Submodular Matroid Intersection. IPCO Paritosh Garg, Linus Jordan, Ola Svensson
2021	J	`jnl`	Streaming Submodular Maximization with Matroid and Matching Constraints. CoRR Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2021	J	`jnl`	Towards Non-Uniform k-Center with Constant Types of Radii. CoRR Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson
2020	J	`jnl`	A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. J. ACM Ola Svensson, Jakub Tarnawski, László A. Végh
2020	J	`jnl`	Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. SIAM J. Comput. Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward
2020	J	`jnl`	Consistent k-Clustering for General Metrics. CoRR Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson
2020	B	`conf`	Fair Colorful k-Center Clustering. IPCO Xinrui Jia, Kshiteej Sheth, Ola Svensson
2020	J	`jnl`	Fair Colorful k-Center Clustering. CoRR Xinrui Jia, Kshiteej Sheth, Ola Svensson
2020	A*	`conf`	Fast and Accurate $k$-means++ via Rejection Sampling. NeurIPS Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson
2020	J	`jnl`	Fast and Accurate k-means++ via Rejection Sampling. CoRR Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson
2020	A*	`conf`	Learning Augmented Energy Minimization via Speed Scaling. NeurIPS Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson
2020	J	`jnl`	Learning Augmented Energy Minimization via Speed Scaling. CoRR Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson
2020	A*	`conf`	Robust Algorithms Under Adversarial Injections. ICALP Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson
2020	J	`jnl`	Robust Algorithms under Adversarial Injections. CoRR Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson
2020	J	`jnl`	Scheduling (Dagstuhl Seminar 20081). Dagstuhl Reports Nicole Megow, David B. Shmoys, Ola Svensson
2020	J	`jnl`	The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. CoRR Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2020	A*	`conf`	The Primal-Dual method for Learning Augmented Algorithms. NeurIPS Étienne Bamas, Andreas Maggiori, Ola Svensson
2020	J	`jnl`	The Primal-Dual method for Learning Augmented Algorithms. CoRR Étienne Bamas, Andreas Maggiori, Ola Svensson
2020	A*	`conf`	The one-way communication complexity of submodular maximization with applications to streaming and robustness. STOC Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
2019	A	`ed.`	27th Annual European Symposium on Algorithms, ESA 2019, Munich/Garching, Germany, September 9-11, 2019 ESA Michael A. Bender, Ola Svensson, Grzegorz Herman
2019	A*	`conf`	Approximately Good and Modern Matchings (Invited Talk). ICALP Ola Svensson
2019	A*	`conf`	Beating Greedy for Stochastic Bipartite Matching. SODA Buddhima Gamlath, Sagar Kale, Ola Svensson
2019	J	`jnl`	Beating Greedy for Stochastic Bipartite Matching. CoRR Buddhima Gamlath, Sagar Kale, Ola Svensson
2019	A*	`conf`	New Notions and Constructions of Sparsification for Graphs and Hypergraphs. FOCS Nikhil Bansal, Ola Svensson, Luca Trevisan
2019	J	`jnl`	New Notions and Constructions of Sparsification for Graphs and Hypergraphs. CoRR Nikhil Bansal, Ola Svensson, Luca Trevisan
2019	J	`jnl`	No Small Linear Program Approximates Vertex Cover Within a Factor 2 - Math. Oper. Res. Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson
2019	A*	`conf`	Online Matching with General Arrivals. FOCS Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc
2019	J	`jnl`	Online Matching with General Arrivals. CoRR Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc
2019	A*	`conf`	Weighted Matchings via Unweighted Augmentations. PODC Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson
2018	A*	`conf`	A Framework for the Secretary Problem on the Intersection of Matroids. SODA Moran Feldman, Ola Svensson, Rico Zenklusen
2018	J	`jnl`	A Simple Math. Oper. Res. Moran Feldman, Ola Svensson, Rico Zenklusen
2018	A*	`conf`	A constant-factor approximation algorithm for the asymmetric traveling salesman problem. STOC Ola Svensson, Jakub Tarnawski, László A. Végh
2018	—	`conf`	Algorithms for the Asymmetric Traveling Salesman Problem (Invited Paper). FSTTCS Ola Svensson
2018	A*	`conf`	Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. ICML Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aidasadat Mousavifar, Ola Svensson
2018	J	`jnl`	Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. CoRR Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aida Mousavifar, Ola Svensson
2018	J	`jnl`	Constant factor approximation for ATSP with two edge weights. Math. Program. Ola Svensson, Jakub Tarnawski, László A. Végh
2018	C	`conf`	On Bounded Pitch Inequalities for the Min-Knapsack Polytope. ISCO Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson
2018	J	`jnl`	On bounded pitch inequalities for the min-knapsack polytope. CoRR Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson
2018	J	`jnl`	Optimal Software Patching Plan for PMUs. IEEE Trans. Smart Grid Teklemariam Tsegay Tesfay, Jean-Yves Le Boudec, Ola Svensson
2018	A*	`conf`	Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering. ICALP Buddhima Gamlath, Sangxia Huang, Ola Svensson
2018	J	`jnl`	Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering. CoRR Buddhima Gamlath, Sangxia Huang, Ola Svensson
2018	J	`jnl`	Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. Theory Comput. Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson
2018	J	`jnl`	Weighted Matchings via Unweighted Augmentations. CoRR Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson
2017	J	`jnl`	A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. CoRR Ola Svensson, Jakub Tarnawski, László A. Végh
2017	J	`jnl`	A Framework for the Secretary Problem on the Intersection of Matroids. CoRR Moran Feldman, Ola Svensson, Rico Zenklusen
2017	A*	`conf`	Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. FOCS Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward
2017	J	`jnl`	Combinatorial Algorithm for Restricted Max-Min Fair Allocation. ACM Trans. Algorithms Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson
2017	J	`jnl`	Dynamic Facility Location via Exponential Clocks. ACM Trans. Algorithms Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson
2017	J	`jnl`	LP-Based Algorithms for Capacitated Facility Location. SIAM J. Comput. Hyung-Chan An, Mohit Singh, Ola Svensson
2017	A*	`conf`	Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. SODA Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson
2017	A*	`conf`	The Matching Problem in General Graphs Is in Quasi-NC. FOCS Ola Svensson, Jakub Tarnawski
2017	J	`jnl`	The Matching Problem in General Graphs is in Quasi-NC. CoRR Ola Svensson, Jakub Tarnawski
2017	J	`jnl`	The Matching Problem in General Graphs is in Quasi-NC. Electron. Colloquium Comput. Complex. Ola Svensson, Jakub Tarnawski
2017	A*	`conf`	Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. SODA Christos Kalaitzis, Ola Svensson, Jakub Tarnawski
2016	A	`conf`	Algorithms with Provable Guarantees for Clustering. ESA Ola Svensson
2016	J	`jnl`	Approximating k-Median via Pseudo-Approximation. SIAM J. Comput. Shi Li, Ola Svensson
2016	J	`jnl`	Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. CoRR Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward
2016	B	`conf`	Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). IPCO Ola Svensson, Jakub Tarnawski, László A. Végh
2016	A*	`conf`	Lift-and-round to improve weighted completion time on unrelated machines. STOC Nikhil Bansal, Aravind Srinivasan, Ola Svensson
2016	—	`conf`	Linear Relaxations for Finding Diverse Elements in Metric Spaces. NIPS Aditya Bhaskara, Mehrdad Ghadiri, Vahab S. Mirrokni, Ola Svensson
2016	A*	`conf`	Online Contention Resolution Schemes. SODA Moran Feldman, Ola Svensson, Rico Zenklusen
2016	J	`jnl`	Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation. ACM Trans. Algorithms Lukás Polácek, Ola Svensson
2016	J	`jnl`	Removing and Adding Edges for the Traveling Salesman Problem. J. ACM Tobias Mömke, Ola Svensson
2016	J	`jnl`	Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. CoRR Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson
2016	J	`jnl`	Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. CoRR Christos Kalaitzis, Ola Svensson, Jakub Tarnawski
2015	A*	`conf`	A Simple SODA Moran Feldman, Ola Svensson, Rico Zenklusen
2015	A*	`conf`	Approximating ATSP by Relaxing Connectivity. FOCS Ola Svensson
2015	J	`jnl`	Approximating ATSP by Relaxing Connectivity. CoRR Ola Svensson
2015	B	`ed.`	Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers WAOA Evripidis Bampis, Ola Svensson
2015	J	`jnl`	Centrality of trees for capacitated k-center. Math. Program. Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson
2015	A*	`conf`	Combinatorial Algorithm for Restricted Max-Min Fair Allocation. SODA Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson
2015	J	`jnl`	Constant Factor Approximation for ATSP with Two Edge Weights. CoRR Ola Svensson, Jakub Tarnawski, László A. Végh
2015	A*	`conf`	Dynamic Facility Location via Exponential Clocks. SODA Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson
2015	J	`jnl`	Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. CoRR Nikhil Bansal, Ola Svensson, Aravind Srinivasan
2015	A*	`conf`	No Small Linear Program Approximates Vertex Cover within a Factor 2 - e. FOCS Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson
2015	J	`jnl`	No Small Linear Program Approximates Vertex Cover within a Factor 2-ε. CoRR Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson
2015	J	`jnl`	On the configuration LP for maximum budgeted allocation. Math. Program. Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukás Polácek, Ola Svensson
2015	J	`jnl`	Online Contention Resolution Schemes. CoRR Moran Feldman, Ola Svensson, Rico Zenklusen
2015	J	`jnl`	Special Issue: APPROX-RANDOM 2013: Guest Editors' Foreword. Theory Comput. Sofya Raskhodnikova, Ola Svensson
2015	J	`jnl`	Strong LP formulations for scheduling splittable jobs on unrelated machines. Math. Program. José Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Víctor Verdugo, José Verschae
2014	J	`jnl`	A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. CoRR Moran Feldman, Ola Svensson, Rico Zenklusen
2014	B	`conf`	Centrality of Trees for Capacitated k-Center. IPCO Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson
2014	J	`jnl`	Combinatorial Algorithm for Restricted Max-Min Fair Allocation. CoRR Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson
2014	J	`jnl`	Dynamic Facility Location via Exponential Clocks. CoRR Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson
2014	A*	`conf`	LP-Based Algorithms for Capacitated Facility Location. FOCS Hyung-Chan An, Mohit Singh, Ola Svensson
2014	J	`jnl`	LP-Based Algorithms for Capacitated Facility Location. CoRR Hyung-Chan An, Mohit Singh, Ola Svensson
2014	B	`conf`	On the Configuration LP for Maximum Budgeted Allocation. IPCO Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson
2014	J	`jnl`	On the Configuration LP for Maximum Budgeted Allocation. CoRR Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson
2014	B	`conf`	Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines. IPCO José R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Victor Verdugo, José Verschae
2013	A*	`conf`	Approximating k-median via pseudo-approximation. STOC Shi Li, Ola Svensson
2013	J	`jnl`	Centrality of Trees for Capacitated k-Center CoRR Hyung-Chan An, Aditya Bhaskara, Ola Svensson
2013	J	`jnl`	Hardness of Vertex Deletion and Project Scheduling. Theory Comput. Ola Svensson
2013	B	`conf`	Overview of New Approaches for Approximating TSP. WG Ola Svensson
2013	J	`jnl`	Single machine scheduling with scenarios. Theor. Comput. Sci. Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
2012	J	`jnl`	Approximating $k$-Median via Pseudo-Approximation CoRR Shi Li, Ola Svensson
2012	J	`jnl`	Approximating Linear Threshold Predicates. ACM Trans. Comput. Theory Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson
2012	J	`jnl`	Hardness of Vertex Deletion and Project Scheduling CoRR Ola Svensson
2012	—	`conf`	Hardness of Vertex Deletion and Project Scheduling. APPROX-RANDOM Ola Svensson
2012	J	`jnl`	Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation CoRR Lukas Polacek, Ola Svensson
2012	—	`conf`	Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation. ICALP (1) Lukas Polacek, Ola Svensson
2012	J	`jnl`	Santa Claus Schedules Jobs on Unrelated Machines. SIAM J. Comput. Ola Svensson
2012	J	`jnl`	Tight approximation algorithms for scheduling with fixed jobs and nonavailability. ACM Trans. Algorithms Florian Diedrich, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson
2011	J	`jnl`	Approximating Graphic TSP by Matchings CoRR Tobias Mömke, Ola Svensson
2011	A*	`conf`	Approximating Graphic TSP by Matchings. FOCS Tobias Mömke, Ola Svensson
2011	—	`conf`	Faster Approximation Algorithms for Scheduling with Fixed Jobs. CATS Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson
2011	J	`jnl`	Hardness of Approximating Flow and Job Shop Scheduling Problems. J. ACM Monaldo Mastrolilli, Ola Svensson
2011	J	`jnl`	Hardness of Precedence Constrained Scheduling on Identical Machines. SIAM J. Comput. Ola Svensson
2011	J	`jnl`	Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut. SIAM J. Comput. Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
2011	J	`jnl`	On the Approximability of Single-Machine Scheduling with Precedence Constraints. Math. Oper. Res. Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
2011	A*	`conf`	Santa Claus schedules jobs on unrelated machines. STOC Ola Svensson
2010	—	`conf`	Approximating Linear Threshold Predicates. APPROX-RANDOM Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson
2010	J	`jnl`	Approximating Linear Threshold Predicates. Electron. Colloquium Comput. Complex. Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson
2010	A*	`conf`	Conditional hardness of precedence constrained scheduling on identical machines. STOC Ola Svensson
2010	J	`jnl`	Minimizing the sum of weighted completion times in a concurrent open shop. Oper. Res. Lett. Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan
2010	J	`jnl`	Santa Claus Schedules Jobs on Unrelated Machines CoRR Ola Svensson
2009	—	`conf`	Improved Bounds for Flow Shop Scheduling. ICALP (1) Monaldo Mastrolilli, Ola Svensson
2008	A*	`conf`	(Acyclic) JobShops are Hard to Approximate. FOCS Monaldo Mastrolilli, Ola Svensson
2008	—	`conf`	Approximating Single Machine Scheduling with Scenarios. APPROX-RANDOM Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
2008	J	`jnl`	Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders. Bull. EATCS Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
2007	A*	`conf`	Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. FOCS Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
2007	B	`conf`	Scheduling with Precedence Constraints of Low Fractional Dimension. IPCO Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
2006	—	`conf`	Approximating Precedence-Constrained Single Machine Scheduling by Coloring. APPROX-RANDOM Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
2006	—	`conf`	Linear Complementarity and P-Matrices for Stochastic Games. Ershov Memorial Conference Ola Svensson, Sergei G. Vorobyov
2006	C	`conf`	Linear Programming Polytope and Algorithm for Mean Payoff Games. AAIM Ola Svensson, Sergei G. Vorobyov