Sebastian Haslebacher

Orcid: 0000-0003-3988-3325

According to our database1, Sebastian Haslebacher authored at least 12 papers between 2021 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Faster Approximate Fixed Points of ℓ<sub>∞</sub>-Contractions.
CoRR, April, 2026

A Levelset Algorithm for 3D-Tarski.
Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

Sinks and Ladders: ARRIVAL and SSG with Two Vertices per Level.
Proceedings of the 13th International Conference on Fun with Algorithms, 2026

Splitting Sandwiches Unevenly via Unique Sink Orientations and Rainbow Arrangements.
Proceedings of the 42nd International Symposium on Computational Geometry, 2026

2025
A Levelset Algorithm for 3D-Tarksi.
CoRR, October, 2025

Query-Efficient Fixpoints of ℓ<sub>p</sub>-Contractions.
CoRR, March, 2025

ARRIVAL: Recursive Framework & ℓ<sub>1</sub>-Contraction.
CoRR, February, 2025

ARRIVAL: Recursive Framework &amp; ℓ<sub>1</sub>-Contraction.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Query-Efficient Fixpoints of ℓp-Contractions.
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

On Finding 𝓁-Th Smallest Perfect Matchings.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024
On the Exact Matching Problem in Dense Graphs.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2021
A Subexponential Algorithm for ARRIVAL.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021


  Loading...