CUFinder

Ola Svensson

About Ola Svensson

Ola Svensson, With an exceptional h-index of 32 and a recent h-index of 25 (since 2020), a distinguished researcher at École Polytechnique Fédérale de Lausanne, specializes in the field of Theoretical Computer Science.

His recent articles reflect a diverse array of research interests and contributions to the field:

Online Edge Coloring is (Nearly) as Easy as Offline

Simple and Asymptotically Optimal Online Bipartite Edge Coloring

The price of explainability for clustering

An Analysis of seeding for -means

Dagstuhl Reports, Vol. 13, Issue 2 ISSN 2192-5283

The one-way communication complexity of submodular maximization with applications to streaming and robustness

Speeding up bellman ford via minimum violation permutations

Online algorithms with costly predictions

Ola Svensson Information

University

Position

___

Citations(all)

3328

Citations(since 2020)

2136

Cited By

2080

hIndex(all)

32

hIndex(since 2020)

25

i10Index(all)

56

i10Index(since 2020)

45

Email

University Profile Page

Google Scholar

Ola Svensson Skills & Research Interests

Theoretical Computer Science

Top articles of Ola Svensson

Online Edge Coloring is (Nearly) as Easy as Offline

arXiv preprint arXiv:2402.18339

2024/2/28

Ola Svensson
Ola Svensson

H-Index: 12

David Wajc
David Wajc

H-Index: 10

Simple and Asymptotically Optimal Online Bipartite Edge Coloring

2024

Ola Svensson
Ola Svensson

H-Index: 12

David Wajc
David Wajc

H-Index: 10

The price of explainability for clustering

2023/11/6

Anupam Gupta
Anupam Gupta

H-Index: 12

Madhusudhan Reddy Pittu
Madhusudhan Reddy Pittu

H-Index: 1

Ola Svensson
Ola Svensson

H-Index: 12

An Analysis of seeding for -means

arXiv preprint arXiv:2310.13474

2023/10/20

Etienne Bamas
Etienne Bamas

H-Index: 3

Sai Ganesh Nagarajan
Sai Ganesh Nagarajan

H-Index: 7

Ola Svensson
Ola Svensson

H-Index: 12

Dagstuhl Reports, Vol. 13, Issue 2 ISSN 2192-5283

2023/9

Nicole Megow
Nicole Megow

H-Index: 16

Ola Svensson
Ola Svensson

H-Index: 12

Jens Schlöter
Jens Schlöter

H-Index: 1

Michael Pradel
Michael Pradel

H-Index: 28

Baishakhi Ray
Baishakhi Ray

H-Index: 21

Eran Yahav
Eran Yahav

H-Index: 34

Martin Farach-Colton
Martin Farach-Colton

H-Index: 29

Ronitt Rubinfeld
Ronitt Rubinfeld

H-Index: 29

Przemysław Uznański
Przemysław Uznański

H-Index: 13

Yingzhen Li
Yingzhen Li

H-Index: 14

Kevin Murphy
Kevin Murphy

H-Index: 0

Stephan Mandt
Stephan Mandt

H-Index: 21

Andrei Ciortea
Andrei Ciortea

H-Index: 10

Andreas Harth
Andreas Harth

H-Index: 25

Alessandro Ricci
Alessandro Ricci

H-Index: 18

Danai Vachtsevanou
Danai Vachtsevanou

H-Index: 3

Jürgen Cito
Jürgen Cito

H-Index: 15

Ruzica Piskac
Ruzica Piskac

H-Index: 14

Mark Santolucito
Mark Santolucito

H-Index: 6

Andy Zaidman
Andy Zaidman

H-Index: 39

Daniel Sokolowski
Daniel Sokolowski

H-Index: 1

Irina Kostitsyna
Irina Kostitsyna

H-Index: 11

Marc Hassenzahl
Marc Hassenzahl

H-Index: 42

The one-way communication complexity of submodular maximization with applications to streaming and robustness

Journal of the ACM

2023/8/12

Ola Svensson
Ola Svensson

H-Index: 12

Speeding up bellman ford via minimum violation permutations

2023/7/3

Ola Svensson
Ola Svensson

H-Index: 12

Online algorithms with costly predictions

2023/4/11

Sai Ganesh Nagarajan
Sai Ganesh Nagarajan

H-Index: 7

Ola Svensson
Ola Svensson

H-Index: 12

Semi-streaming algorithms for submodular matroid intersection

Mathematical Programming

2023/2

Ola Svensson
Ola Svensson

H-Index: 12

Scheduling (Dagstuhl Seminar 23061)

2023

Nicole Megow
Nicole Megow

H-Index: 16

Ola Svensson
Ola Svensson

H-Index: 12

Jens Schlöter
Jens Schlöter

H-Index: 1

The exact bipartite matching polytope has exponential extension complexity

2023

Xinrui Jia
Xinrui Jia

H-Index: 1

Ola Svensson
Ola Svensson

H-Index: 12

Submodular Maximization Subject to Matroid Intersection on the Fly

arXiv preprint arXiv:2204.05154

2022/4/11

Ola Svensson
Ola Svensson

H-Index: 12

Polyhedral techniques in combinatorial optimization: matchings and tours

Proc. Int. Cong. Math

2022

Ola Svensson
Ola Svensson

H-Index: 12

A Framework for the Secretary Problem on the Intersection of Matroids

SIAM Journal on Computing

2022

Ola Svensson
Ola Svensson

H-Index: 12

Towards Non-Uniform k-Center with Constant Types of Radii

2022

Xinrui Jia
Xinrui Jia

H-Index: 1

Lars Rohwedder
Lars Rohwedder

H-Index: 5

Kshiteej Sheth
Kshiteej Sheth

H-Index: 3

Ola Svensson
Ola Svensson

H-Index: 12

Combinatorial Optimization

Introduction to Evolutionary Algorithms

2010

Xinjie Yu
Xinjie Yu

H-Index: 12

Approximate cluster recovery from noisy labels

2022/6/28

Buddhima Gamlath
Buddhima Gamlath

H-Index: 4

Ola Svensson
Ola Svensson

H-Index: 12

Flow time scheduling and prefix beck-fiala

2022/6/9

Nikhil Bansal
Nikhil Bansal

H-Index: 31

Lars Rohwedder
Lars Rohwedder

H-Index: 5

Ola Svensson
Ola Svensson

H-Index: 12

A simple LP-based approximation algorithm for the matching augmentation problem

2022/5/27

Ola Svensson
Ola Svensson

H-Index: 12

On inequalities with bounded coefficients and pitch for the min knapsack polytope

Discrete Optimization

2022/5/1

Daniel Bienstock
Daniel Bienstock

H-Index: 24

Yuri Faenza
Yuri Faenza

H-Index: 10

Ola Svensson
Ola Svensson

H-Index: 12

See List of Professors in Ola Svensson University(École Polytechnique Fédérale de Lausanne)