| 2026 | STOC | Randomized Rounding over Dynamic Programs. | tienne Bamas, Shi Li, Lars Rohwedder |
| 2025 | SODA | Lift-and-Project Integrality Gaps for Santa Claus. | tienne Bamas |
| 2025 | SODA | The Submodular Santa Claus Problem. | tienne Bamas, Sarah Morell, Lars Rohwedder |
| 2024 | ICML | Analyzing Dα seeding for k-means. | tienne Bamas, Sai Ganesh Nagarajan, Ola Svensson |
| 2024 | SODA | Santa Claus meets Makespan and Matroids: Algorithms and Reductions. | tienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlter |
| 2023 | STOC | Better Trees for Santa Claus. | tienne Bamas, Lars Rohwedder |
| 2022 | IPCO | A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. | tienne Bamas, Marina Drygala, Ola Svensson |
| 2022 | SODA | An Improved Analysis of Greedy for Online Steiner Forest. | tienne Bamas, Marina Drygala, Andreas Maggiori |
| 2021 | ICALP | The Submodular Santa Claus Problem in the Restricted Assignment Case. | tienne Bamas, Paritosh Garg, Lars Rohwedder |
| 2019 | STACS | Distributed Coloring of Graphs with an Optimal Number of Colors. | tienne Bamas, Louis Esperet |
| 2019 | WG | Local Approximation of the Maximum Cut in Regular Graphs. | tienne Bamas, Louis Esperet |