Étienne Bamas

MaRDI QIDQ1989356zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Lift-and-project integrality gaps for Santa Claus	2026-07-03	Paper
The submodular Santa Claus problem	2026-07-03	Paper
The submodular Santa Claus problem in the restricted assignment case	2026-05-12	Paper
Santa claus meets makespan and matroids: algorithms and reductions	2024-11-28	Paper
An improved analysis of greedy for online Steiner forest	2024-07-19	Paper
Better trees for Santa Claus	2024-05-08	Paper
A simple LP-based approximation algorithm for the matching augmentation problem (available as arXiv preprint)	2022-08-16	Paper
Distributed coloring of graphs with an optimal number of colors (available as arXiv preprint)	2022-07-18	Paper
Local approximation of the maximum cut in regular graphs Theoretical Computer Science	2020-04-21	Paper
Local approximation of the maximum cut in regular graphs Graph-Theoretic Concepts in Computer Science	2020-02-24	Paper
Local approximation of the Maximum Cut in regular graphs (available as arXiv preprint)	2019-01-01	Paper
Distributed coloring of graphs with an optimal number of colors (available as arXiv preprint)	2018-09-21	Paper

Research outcomes over time

This page was built for person: Étienne Bamas