I am a doctoral student in the algorithm engineering group Heidelberg. My research focus is at the moment on algorithms for b-matchings in hypergraphs.

Contact

• henrik.reinstaedtler at informatik.uni-heidelberg.de
• +49 6221 54 14356
• Room: 1/304
  Im Neuenheimer Feld 205
  69120 Heidelberg
  Germany

Publications

Peer-reviewed Papers

1. Engineering Edge Orientation Algorithms. Henrik Reinstädtler, Christian Schulz, Bora Uçar. In European Symposium on Algorithms (ESA'24), Volume 308 of LIPIcs, pages 97:1--97:18, 2024. https://doi.org/10.4230/LIPIcs.ESA.2024.97 [ paper ]
2. Engineering Fully Dynamic Exact Δ-Orientation Algorithms. Ernestine Großmann, Henrik Reinstädtler, Christian Schulz, Fabian Walliser. In Algorithm Engineering and Experiments 25 (ALENEX 2025), 2025. [ paper, preprint ]
3. Semi-Streaming Algorithms for Hypergraph Matching. Henrik Reinstädtler, S M Ferdous, Alex Pothen, Bora Uçar, Christian Schulz. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 79:1-79:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) [paper, preprint]
4. From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation Ernestine Großmann, Ivor van der Hoog, Henrik Reinstädtler, Eva Rotenberg, Christian Schulz, Juliette Vlieghe In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 65:1-65:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) [paper,preprint]
5. Practical Insertion-Only Convex Hull. Ivor van der Hoog, Henrik Reinstädtler, Eva Rotenberg. to appear In Algorithm Engineering and Experiments 26 (ALENEX 2026), 2026. [, preprint ]

Technical Reports

6. Engineering Hypergraph b-Matching Algorithms. Ernestine Großmann, Felix Joos, Henrik Reinstädtler, Christian Schulz. Technical report, Heidelberg University, 2024. PDF