Ola Svensson

École Polytechnique Fédérale de Lausanne — Switzerland

Computer Science · Physical Sciences

25h-index2.3kcitations184works0.62yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Optimization and Search Problems(96), Complexity and Algorithms in Graphs(88), Advanced Graph Theory Research(43), Scheduling and Optimization Algorithms(30), Cryptography and Data Security(19)

Publications184 total

Accelerating Scientific Research with Gemini: Case Studies and Common Techniques
arXiv (Cornell University)·2026· 2 citedOpen Access
Accelerating Scientific Research with Gemini: Case Studies and Common Techniques
ArXiv.org·2026Open Access
Advancements in Online Edge Coloring Algorithms (Invited Talk)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2026Open Access
Nearly Tight Sample Complexity for Matroid Online Contention Resolution
Society for Industrial and Applied Mathematics eBooks·2026
Clustering with Label Consistency
arXiv (Cornell University)·2025Open Access
Clustering with Label Consistency
ArXiv.org·2025Open Access
Online Edge Coloring: Sharp Thresholds
2025
Online Edge Coloring Is (Nearly) as Easy as Offline
SIAM Journal on Computing·2025
Nearly Tight Sample Complexity for Matroid Online Contention Resolution
arXiv (Cornell University)·2025Open Access
Asymptotically Optimal Hardness for 𝑘-Set Packing and 𝑘-Matroid Intersection
2025Open Access
The Cost of Consistency: Submodular Maximization with Constant Recourse
2025Open Access
A (2+ε)-Approximation Algorithm for Metric 𝑘-Median
2025· 1 citedOpen Access
A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median
arXiv (Cornell University)·2025Open Access
Streaming Submodular Maximization Under Matroid Constraints
Mathematics of Operations Research·2025Open Access
Deterministic Online Bipartite Edge Coloring
Society for Industrial and Applied Mathematics eBooks·2025· 2 citedOpen Access
The Cost of Consistency: Submodular Maximization with Constant Recourse
arXiv (Cornell University)·2024Open Access
Data-Driven Solution Portfolios
arXiv (Cornell University)·2024Open Access
Asymptotically Optimal Hardness for $k$-Set Packing and $k$-Matroid Intersection
arXiv (Cornell University)·2024Open Access
Deterministic Online Bipartite Edge Coloring
arXiv (Cornell University)·2024Open Access
Online Edge Coloring Is (Nearly) as Easy as Offline
2024· 6 citedOpen Access
page 1 of 10Next →

Frequent Co-authors

Monaldo Mastrolilli(10), Christoph Ambühl(6), Moran Feldman(5), Rico Zenklusen(5), Ashkan Norouzi-Fard(4), Nikolaus Mutsanas(4), Hyung-Chan An(3), Aditya Bhaskara(3), Étienne Bamas(3), Andreas Maggiori(3), Shi Li(2), Hyung-Chan An(2), Mohit Singh(2), Tobias Mömke(2), Chandra Chekuri(2), Shalmoli Gupta(2), Vivek Madan(2), Jakub Tarnawski(2), Abbas Bazzi(2), Samuel Fiorini(2)