معرفی
Ola Svensson is an Associate Professor at the School of Computer and Communication Sciences, EPFL. His research spans approximation algorithms, combinatorial optimization, computational complexity, and scheduling. He holds an ERC Consolidator Grant (2023–) and previously received an ERC Starting Grant (2014–2019) and SNF grant (2019–2023).
Education:
- PhD in Computer Science from IDSIA, Università della Svizzera italiana (2009)
- M.Sc. from Uppsala University (2005)
Research Focus: Svensson develops novel techniques for NP-hard problems, with emphasis on primal-dual methods, LP/SDP hierarchies, and hardness proofs. His work applies to clustering, scheduling, network design, and submodular optimization.
Publications: His 15 most recent works (2018–2021) focus on learning-augmented algorithms, robust optimization, and improved approximations for clustering/TSP. Key trends include integration of ML with classical algorithms and quasi-polynomial methods for combinatorial problems.
Awards:
- Best Paper Awards at FOCS (2011, 2017) and STOC (2018)
- I&C Teaching Award at EPFL
Advising & Grants: He advises 6 current PhD students and graduated 8 others. Major grants include ERC Starting Grant 'OptApprox' (€1.4M) and ERC Consolidator Grant 'POTCO' (€2M).
Teaching: Leads courses in Advanced Algorithms, Computational Complexity, and Approximation Algorithms. He developed pedagogical frameworks for scribe notes and project-based learning in theoretical computer science.
