I am doctoral student in the algorithm engineering group Heidelberg. My research focus is on process mapping algorithms.
Google Scholar
ResearchGate
LinkedIN
GitHub

Contact

• henning.woydt@informatik.uni-heidelberg.de
• Room: 1/331
  Im Neuenheimer Feld 205
  69120 Heidelberg
  Germany

Publications

Peer-reviewed Papers

1. SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints. Henning Martin Woydt, Christian Komusiewicz, and Frank Sommer. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 102:1-102:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024). [Link]




Technical Reports

2. Shared-Memory Hierarchical Process Mapping. Christian Schulz and Henning Woydt. Technical Report, Heidelberg University, 2025. [Link]




Software

3. SubModST
   C++ solver for submodular function maximization with cardinality constraints. [GitHub]
4. Process Mapping Analyzer
   C++ tool to evaluate generated partitions for process mapping algorithms. [GitHub]
5. SharedMap
   C++ shared-memory process mapping algorithm based on hierarchical multisection. [GitHub]