Logo

Etienne Bamas’ webpage

Hello and welcome to my webpage. I am a post-doctoral fellow at the ETH AI Center, mostly working in the groups of Prof. Rico Zenklusen and Prof. Roger Wattenhofer. I obtained my PhD in 2023 from EPFL, where I was fortunate to be advised by Ola Svensson. I am broadly interested in Theoretical Computer Science with a focus on Combinatorial Optimization, also in connection with Machine Learning. Before joining EPFL, I completed my bachelor and master in France at Ecole polytechnique and the Parisian Master of Research in Computer Science. My master thesis was advised by Louis Esperet.

Below you can find the list of my publications. Recently, I advised two student projects whose goal was to solve classic operation research problems using ML techniques (e.g. the stochastic vehicle scheduling problem, see the final poster of the students). Also, I regularly advise MSc theses on various topics (e.g. approximation algorithms, online selection problems).

For my CV, click here.

If you would like to contact me, my email is: firstname dot lastname at inf dot ethz dot ch.

Publications

All my publications can also be found on my scholar profile.

The Submodular Santa Claus Problem

Etienne Bamas, Sarah Morell, Lars Rohwedder.

Lift-and-Project Integrality Gaps for Santa Claus

Etienne Bamas.

An Analysis of $D^\alpha$ seeding for k-means

Etienne Bamas, Sai Ganesh Nagarajan, Ola Svensson.

Santa Claus meets Makespan and Matroids: Algorithms and Reductions

Etienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter.

Better Trees for Santa Claus

Etienne Bamas, Lars Rohwedder.

A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem

Etienne Bamas, Marina Drygala, Ola Svensson.

An Improved Analysis of Greedy for Online Steiner Forest

Etienne Bamas, Marina Drygala, Andreas Maggiori.

The Submodular Santa Claus Problem in the Restricted Assignment Case

Etienne Bamas, Paritosh Garg, Lars Rohwedder.

The Primal-Dual method for Learning Augmented Algorithms

Etienne Bamas, Andreas Maggiori, Ola Svensson.

Learning Augmented Energy Minimization via Speed Scaling

Etienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson.

Local Approximation of the Maximum Cut in Regular Graphs

Etienne Bamas, Louis Esperet.

Distributed coloring of graphs with an optimal number of colors

Etienne Bamas, Louis Esperet.