default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÉtienne Bamas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Étienne Bamas, Sai Ganesh Nagarajan, Ola Svensson:
Analyzing Dα seeding for k-means. ICML 2024- [c9]Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter:
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. SODA 2024: 2829-2860 - [i13]Étienne Bamas:
Lift-and-Project Integrality Gaps for Santa Claus. CoRR abs/2406.18273 (2024) - [i12]Étienne Bamas, Sarah Morell, Lars Rohwedder:
The Submodular Santa Claus Problem. CoRR abs/2407.04824 (2024) - 2023
- [c8]Étienne Bamas, Lars Rohwedder
:
Better Trees for Santa Claus. STOC 2023: 1862-1875 - [i11]Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter:
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. CoRR abs/2307.08453 (2023) - [i10]Étienne Bamas, Sai Ganesh Nagarajan, Ola Svensson:
An Analysis of $D^α$ seeding for $k$-means. CoRR abs/2310.13474 (2023) - 2022
- [c7]Étienne Bamas, Marina Drygala, Ola Svensson:
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. IPCO 2022: 57-69 - [c6]Étienne Bamas, Marina Drygala, Andreas Maggiori:
An Improved Analysis of Greedy for Online Steiner Forest. SODA 2022: 3202-3229 - [i9]Étienne Bamas, Marina Drygala, Ola Svensson:
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. CoRR abs/2202.07283 (2022) - [i8]Étienne Bamas, Lars Rohwedder:
Better Trees for Santa Claus. CoRR abs/2211.14259 (2022) - 2021
- [c5]Étienne Bamas, Paritosh Garg, Lars Rohwedder:
The Submodular Santa Claus Problem in the Restricted Assignment Case. ICALP 2021: 22:1-22:18 - [i7]Étienne Bamas, Marina Drygala, Andreas Maggiori:
An Improved Analysis of Greedy for Online Steiner Forest. CoRR abs/2111.10086 (2021) - 2020
- [j1]Étienne Bamas, Louis Esperet:
Local approximation of the Maximum Cut in regular graphs. Theor. Comput. Sci. 820: 45-59 (2020) - [c4]Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson:
Learning Augmented Energy Minimization via Speed Scaling. NeurIPS 2020 - [c3]Étienne Bamas, Andreas Maggiori, Ola Svensson:
The Primal-Dual method for Learning Augmented Algorithms. NeurIPS 2020 - [i6]Étienne Bamas, Paritosh Garg, Lars Rohwedder:
The Combinatorial Santa Claus Problem or: How to Find Good Matchings in Non-Uniform Hypergraphs. CoRR abs/2007.09116 (2020) - [i5]Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson:
Learning Augmented Energy Minimization via Speed Scaling. CoRR abs/2010.11629 (2020) - [i4]Étienne Bamas, Andreas Maggiori, Ola Svensson:
The Primal-Dual method for Learning Augmented Algorithms. CoRR abs/2010.11632 (2020) - [i3]Étienne Bamas, Paritosh Garg, Lars Rohwedder:
The Submodular Santa Claus Problem in the Restricted Assignment Case. CoRR abs/2011.06939 (2020)
2010 – 2019
- 2019
- [c2]Étienne Bamas, Louis Esperet:
Distributed Coloring of Graphs with an Optimal Number of Colors. STACS 2019: 10:1-10:15 - [c1]Étienne Bamas, Louis Esperet:
Local Approximation of the Maximum Cut in Regular Graphs. WG 2019: 66-78 - [i2]Étienne Bamas, Louis Esperet:
Local approximation of the Maximum Cut in regular graphs. CoRR abs/1902.04899 (2019) - 2018
- [i1]Étienne Bamas, Louis Esperet:
Distributed coloring of graphs with an optimal number of colors. CoRR abs/1809.08140 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 00:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
