EDBT 2026 Demo / reviewers in the wild / expert

Sarah Clusiau

dblp:311/0933 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 3 since 2021
YearPublicationVenuePosition
2023 The speed and threshold of the biased perfect matching and Hamilton cycle games
Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone
 Discret. Appl. Math.2
2021 The Speed and Threshold of the Biased Perfect Matching Game
abstract
We show Maker wins the Maker-Breaker perfect matching game in n/2 + o(n) turns when the bias is at least n/ln n − f(n)n/(ln n)5/4, for any f going to infinity with n and n sufficiently large (in terms of f).
Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone
 LAGOS2
2021 The Speed and Threshold of the Biased Hamilton Cycle Game
abstract
We show that there is a constant C such that for any b < n/ln n − Cn/(ln n)3/2, Maker can win the Maker-Breaker Hamilton cycle game in n + Cn/√ln n steps.
Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone
 LAGOS2