Étienne Bamas

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 22

Top Topics

Energy Minimization

Subgraph Isomorphism

Top Venues

Publications

Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. SODA (2024)
Étienne Bamas, Sarah Morell, Lars Rohwedder
The Submodular Santa Claus Problem. CoRR (2024)
Étienne Bamas, Lars Rohwedder
Better Trees for Santa Claus. STOC (2023)
Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. CoRR (2023)
Étienne Bamas, Sai Ganesh Nagarajan, Ola Svensson
An Analysis of $D^α$ seeding for $k$-means. CoRR (2023)
Étienne Bamas, Marina Drygala, Ola Svensson
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. CoRR (2022)
Étienne Bamas, Marina Drygala, Andreas Maggiori
An Improved Analysis of Greedy for Online Steiner Forest. SODA (2022)
Étienne Bamas, Lars Rohwedder
Better Trees for Santa Claus. CoRR (2022)
Étienne Bamas, Marina Drygala, Ola Svensson
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. IPCO (2022)
Étienne Bamas, Paritosh Garg, Lars Rohwedder
The Submodular Santa Claus Problem in the Restricted Assignment Case. ICALP (2021)
Étienne Bamas, Marina Drygala, Andreas Maggiori
An Improved Analysis of Greedy for Online Steiner Forest. CoRR (2021)
Étienne Bamas, Andreas Maggiori, Ola Svensson
The Primal-Dual method for Learning Augmented Algorithms. CoRR (2020)
Étienne Bamas, Paritosh Garg, Lars Rohwedder
The Combinatorial Santa Claus Problem or: How to Find Good Matchings in Non-Uniform Hypergraphs. CoRR (2020)
Étienne Bamas, Andreas Maggiori, Ola Svensson
The Primal-Dual method for Learning Augmented Algorithms. NeurIPS (2020)
Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson
Learning Augmented Energy Minimization via Speed Scaling. NeurIPS (2020)
Étienne Bamas, Paritosh Garg, Lars Rohwedder
The Submodular Santa Claus Problem in the Restricted Assignment Case. CoRR (2020)
Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson
Learning Augmented Energy Minimization via Speed Scaling. CoRR (2020)
Étienne Bamas, Louis Esperet
Local approximation of the Maximum Cut in regular graphs. Theor. Comput. Sci. 820 (2020)
Étienne Bamas, Louis Esperet
Local Approximation of the Maximum Cut in Regular Graphs. WG (2019)
Étienne Bamas, Louis Esperet
Local approximation of the Maximum Cut in regular graphs. CoRR (2019)
Étienne Bamas, Louis Esperet
Distributed Coloring of Graphs with an Optimal Number of Colors. STACS (2019)
Étienne Bamas, Louis Esperet
Distributed coloring of graphs with an optimal number of colors. CoRR (2018)