Ola Svensson
Orcid: 0000-0003-2997-1372Affiliations:
- Swiss Federal Institute of Technology in Lausanne, Switzerland
According to our database1,
Ola Svensson
authored at least 98 papers
between 2006 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2006
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
8
9
10
3
4
3
5
3
1
4
4
3
5
1
3
2
4
2
1
2
3
4
6
3
4
5
4
1
4
2
1
2
1
1
2
2
3
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on nada.kth.se
On csauthors.net:
Bibliography
2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025
2024
Asymptotically Optimal Hardness for <i>k</i>-Set Packing and <i>k</i>-Matroid Intersection.
CoRR, 2024
Could ChatGPT get an Engineering Degree? Evaluating Higher Education Vulnerability to AI Assistants.
CoRR, 2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024
Proceedings of the Forty-first International Conference on Machine Learning, 2024
2023
The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness.
J. ACM, August, 2023
Math. Program., February, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the International Conference on Machine Learning, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023
2022
SIAM J. Comput., 2022
Discret. Optim., 2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022
Proceedings of the Integer Programming and Combinatorial Optimization, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022
2021
Online Contention Resolution Schemes with Applications to Bayesian Selection Problems.
SIAM J. Comput., 2021
SIAM J. Comput., 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
2020
SIAM J. Comput., 2020
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem.
J. ACM, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
2019
Math. Oper. Res., 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
Theory Comput., 2018
A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem.
Math. Oper. Res., 2018
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018
Proceedings of the 35th International Conference on Machine Learning, 2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018
2017
ACM Trans. Algorithms, 2017
Electron. Colloquium Comput. Complex., 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
2016
ACM Trans. Algorithms, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016
Proceedings of the Integer Programming and Combinatorial Optimization, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
Math. Program., 2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
2014
A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem.
CoRR, 2014
2013
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013
2012
ACM Trans. Algorithms, 2012
2011
SIAM J. Comput., 2011
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut.
SIAM J. Comput., 2011
Math. Oper. Res., 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011
2010
Oper. Res. Lett., 2010
Electron. Colloquium Comput. Complex., 2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
2009
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
2008
Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders.
Bull. EATCS, 2008
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
Proceedings of the Approximation, 2008
2007
Proceedings of the Integer Programming and Combinatorial Optimization, 2007
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007
2006
Proceedings of the Perspectives of Systems Informatics, 2006
Proceedings of the Approximation, 2006
Proceedings of the Algorithmic Aspects in Information and Management, 2006