Etienne Bamas

Etienne Bamas is a Lecturer at the Department of Computer Science, ETH Zürich, and a member of the ETH AI Center. His research focuses on algorithms, combinatorial optimization, and approximation algorithms. He has contributed to areas such as the Santa Claus problem, distributed graph coloring, and learning-augmented algorithms. Recent work includes advancements in submodular optimization, k-means clustering analysis, and network design algorithms. His publications span from 2016 to 2025, addressing both theoretical and applied challenges in computer science.

Key research interests include:

• Approximation Algorithms for NP-hard Problems
• Combinatorial Optimization and Resource Allocation
• Online and Distributed Algorithms
• Algorithmic Game Theory

His articles often bridge theoretical foundations with practical applications, such as energy minimization in scheduling and satellite mission design (SERB project). No specific academic awards or grants are listed in the provided information.