Sebastian Haslebacher

activity

20212026

most citedA Subexponential Algorithm for ARRIVAL

3 citations · 4 across the 8 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2025

Query-Efficient Fixpoints of $ℓ_{p}$ -Contractions

Sebastian Haslebacher, Jonas Lill, Patrick Schnider +1

We prove that an $ε$ -approximate fixpoint of a map $f : [0, 1]^{d} \to [0, 1]^{d}$ can be found with $O (d^{2} (lo g \frac{1}{ε} + lo g \frac{1}{1 - λ}))$ queries to $f$ if $f$ is $…

cs.CC2024★ 1 cited

On the Exact Matching Problem in Dense Graphs

Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf

In the Exact Matching problem, we are given a graph whose edges are colored red or blue and the task is to decide for a given integer k, if there is a perfect matching with exactly…

Query-Efficient Fixpoints of ℓp​-Contractions

On the Exact Matching Problem in Dense Graphs

Query-Efficient Fixpoints of $ℓ_{p}$ -Contractions