CUFinder

Etienne Bamas

About Etienne Bamas

Etienne Bamas, With an exceptional h-index of 5 and a recent h-index of 5 (since 2020), a distinguished researcher at École Polytechnique Fédérale de Lausanne, specializes in the field of approximation algorithms, online algorithms.

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

Santa Claus meets Makespan and Matroids: Algorithms and Reductions

An Analysis of seeding for -means

Better trees for santa claus

Approximation Algorithms for Allocation and Network Design

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

An Improved Analysis of Greedy for Online Steiner Forest

The Submodular Santa Claus Problem in the Restricted Assignment Case

Local approximation of the Maximum Cut in regular graphs

Etienne Bamas Information

University

Position

___

Citations(all)

189

Citations(since 2020)

188

Cited By

13

hIndex(all)

5

hIndex(since 2020)

5

i10Index(all)

2

i10Index(since 2020)

2

Email

University Profile Page

Google Scholar

Etienne Bamas Skills & Research Interests

approximation algorithms

online algorithms

Top articles of Etienne Bamas

Santa Claus meets Makespan and Matroids: Algorithms and Reductions

2024

Nicole Megow
Nicole Megow

H-Index: 16

Lars Rohwedder
Lars Rohwedder

H-Index: 5

Jens Schlöter
Jens Schlöter

H-Index: 1

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

Better trees for santa claus

2023/6/2

Lars Rohwedder
Lars Rohwedder

H-Index: 5

Approximation Algorithms for Allocation and Network Design

2023

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

2022/5/27

Ola Svensson
Ola Svensson

H-Index: 12

An Improved Analysis of Greedy for Online Steiner Forest

2022

Andreas Maggiori
Andreas Maggiori

H-Index: 2

The Submodular Santa Claus Problem in the Restricted Assignment Case

2021/2/7

Etienne Bamas
Etienne Bamas

H-Index: 3

Lars Rohwedder
Lars Rohwedder

H-Index: 5

Local approximation of the Maximum Cut in regular graphs

Theoretical Computer Science

2020/6/8

The primal-dual method for learning augmented algorithms

Advances in Neural Information Processing Systems

2020

Etienne Bamas
Etienne Bamas

H-Index: 3

Andreas Maggiori
Andreas Maggiori

H-Index: 2

Ola Svensson
Ola Svensson

H-Index: 12

Learning augmented energy minimization via speed scaling

Advances in Neural Information Processing Systems

2020

Andreas Maggiori
Andreas Maggiori

H-Index: 2

Lars Rohwedder
Lars Rohwedder

H-Index: 5

Ola Svensson
Ola Svensson

H-Index: 12

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