Sebastian Haslebacher

According to our database, Sebastian Haslebacher authored at least 6 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

On Finding ℓ-th Smallest Perfect Matchings.

Nicolas El Maalouly, Sebastian Haslebacher, Adrian Taubner, Lasse Wulf

CoRR, June, 2025

Query-Efficient Fixpoints of ℓ_p-Contractions.

Sebastian Haslebacher, Jonas Lill, Patrick Schnider, Simon Weber

CoRR, March, 2025

ARRIVAL: Recursive Framework & ℓ₁-Contraction.

Sebastian Haslebacher

CoRR, February, 2025

ARRIVAL: Recursive Framework & ℓ₁-Contraction.

Sebastian Haslebacher

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

On the Exact Matching Problem in Dense Graphs.

Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2021

A Subexponential Algorithm for ARRIVAL.

Bernd Gärtner, Sebastian Haslebacher, Hung P. Hoang

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021