Étienne Bamas

28 papers A* 9A 1B 2Journal 15
YearRankTypeTitle / Venue / Authors
2025 A* conf
Lift-and-Project Integrality Gaps for Santa Claus.
SODA
Étienne Bamas
2025 J jnl
Randomized Rounding over Dynamic Programs.
CoRR
Étienne Bamas, Shi Li, Lars Rohwedder
2025 A* conf
The Submodular Santa Claus Problem.
SODA
Étienne Bamas, Sarah Morell, Lars Rohwedder
2024 A* conf
Analyzing Dα seeding for k-means.
ICML
Étienne Bamas, Sai Ganesh Nagarajan, Ola Svensson
2024 J jnl
Lift-and-Project Integrality Gaps for Santa Claus.
CoRR
Étienne Bamas
2024 A* conf
Santa Claus meets Makespan and Matroids: Algorithms and Reductions.
SODA
Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
2024 J jnl
The Submodular Santa Claus Problem.
CoRR
Étienne Bamas, Sarah Morell, Lars Rohwedder
2023 J jnl
An Analysis of $D^α$ seeding for $k$-means.
CoRR
Étienne Bamas, Sai Ganesh Nagarajan, Ola Svensson
2023 — —
Approximation Algorithms for Allocation and Network Design.
Étienne Bamas
2023 A* conf
Better Trees for Santa Claus.
STOC
Étienne Bamas, Lars Rohwedder
2023 J jnl
Santa Claus meets Makespan and Matroids: Algorithms and Reductions.
CoRR
Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
2022 B conf
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem.
IPCO
Étienne Bamas, Marina Drygala, Ola Svensson
2022 J jnl
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem.
CoRR
Étienne Bamas, Marina Drygala, Ola Svensson
2022 A* conf
An Improved Analysis of Greedy for Online Steiner Forest.
SODA
Étienne Bamas, Marina Drygala, Andreas Maggiori
2022 J jnl
Better Trees for Santa Claus.
CoRR
Étienne Bamas, Lars Rohwedder
2021 J jnl
An Improved Analysis of Greedy for Online Steiner Forest.
CoRR
Étienne Bamas, Marina Drygala, Andreas Maggiori
2021 A* conf
The Submodular Santa Claus Problem in the Restricted Assignment Case.
ICALP
Étienne Bamas, Paritosh Garg, Lars Rohwedder
2020 A* conf
Learning Augmented Energy Minimization via Speed Scaling.
NeurIPS
Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson
2020 J jnl
Learning Augmented Energy Minimization via Speed Scaling.
CoRR
Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson
2020 J jnl
Local approximation of the Maximum Cut in regular graphs.
Theor. Comput. Sci.
Étienne Bamas, Louis Esperet
2020 J jnl
The Combinatorial Santa Claus Problem or: How to Find Good Matchings in Non-Uniform Hypergraphs.
CoRR
Étienne Bamas, Paritosh Garg, Lars Rohwedder
2020 A* conf
The Primal-Dual method for Learning Augmented Algorithms.
NeurIPS
Étienne Bamas, Andreas Maggiori, Ola Svensson
2020 J jnl
The Primal-Dual method for Learning Augmented Algorithms.
CoRR
Étienne Bamas, Andreas Maggiori, Ola Svensson
2020 J jnl
The Submodular Santa Claus Problem in the Restricted Assignment Case.
CoRR
Étienne Bamas, Paritosh Garg, Lars Rohwedder
2019 A conf
Distributed Coloring of Graphs with an Optimal Number of Colors.
STACS
Étienne Bamas, Louis Esperet
2019 B conf
Local Approximation of the Maximum Cut in Regular Graphs.
WG
Étienne Bamas, Louis Esperet
2019 J jnl
Local approximation of the Maximum Cut in regular graphs.
CoRR
Étienne Bamas, Louis Esperet
2018 J jnl
Distributed coloring of graphs with an optimal number of colors.
CoRR
Étienne Bamas, Louis Esperet