Distributed Coloring of Graphs with an Optimal Number of Colors. - Étienne Bamas; Louis Esperet (STACS, 2019)

Learning Augmented Energy Minimization via Speed Scaling. - Étienne Bamas; Andreas Maggiori; Lars Rohwedder; Ola Svensson (NeurIPS, 2020)

The Primal-Dual method for Learning Augmented Algorithms. - Étienne Bamas; Andreas Maggiori; Ola Svensson (NeurIPS, 2020)

The Combinatorial Santa Claus Problem or: How to Find Good Matchings in Non-Uniform Hypergraphs. - Étienne Bamas; Paritosh Garg; Lars Rohwedder (CoRR, 2020)

Local approximation of the Maximum Cut in regular graphs. - Étienne Bamas; Louis Esperet (Theor. Comput. Sci., 2020)

The Submodular Santa Claus Problem in the Restricted Assignment Case. - Étienne Bamas; Paritosh Garg; Lars Rohwedder (ICALP, 2021)

A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. - Étienne Bamas; Marina Drygala; Ola Svensson (IPCO, 2022)

An Improved Analysis of Greedy for Online Steiner Forest. - Étienne Bamas; Marina Drygala; Andreas Maggiori (SODA, 2022)

Better Trees for Santa Claus. - Étienne Bamas; Lars Rohwedder (STOC, 2023)

An Analysis of $D^α$ seeding for $k$-means. - Étienne Bamas; Sai Ganesh Nagarajan; Ola Svensson (CoRR, 2023)

Analyzing Dα seeding for k-means. - Étienne Bamas; Sai Ganesh Nagarajan; Ola Svensson (ICML, 2024)

Santa Claus meets Makespan and Matroids: Algorithms and Reductions. - Étienne Bamas; Alexander Lindermayr; Nicole Megow; Lars Rohwedder; Jens Schlöter (SODA, 2024)

Lift-and-Project Integrality Gaps for Santa Claus. - Étienne Bamas (SODA, 2025)

The Submodular Santa Claus Problem. - Étienne Bamas; Sarah Morell; Lars Rohwedder (SODA, 2025)