Étienne Bamas

According to our database1, Étienne Bamas authored at least 11 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Santa Claus meets Makespan and Matroids: Algorithms and Reductions.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
An Analysis of $D^α$ seeding for $k$-means.
CoRR, 2023

Better Trees for Santa Claus.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
An Improved Analysis of Greedy for Online Steiner Forest.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021
The Submodular Santa Claus Problem in the Restricted Assignment Case.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Local approximation of the Maximum Cut in regular graphs.
Theor. Comput. Sci., 2020

The Combinatorial Santa Claus Problem or: How to Find Good Matchings in Non-Uniform Hypergraphs.
CoRR, 2020

The Primal-Dual method for Learning Augmented Algorithms.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Learning Augmented Energy Minimization via Speed Scaling.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Distributed Coloring of Graphs with an Optimal Number of Colors.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019


  Loading...