Research Interests

In my research, I mostly study graph embeddings with a focus on algorithms for automatic generation of graph embeddings, their time complexity as well as theoretical bounds for aesthetic criteria which are motivated by needs of their practical applications. Graph embeddings arise quite naturally not only in network visualization both in professional (e.g. UML diagrams in computer engineering, petri nets in engineering applications or BPMN diagrams in economics) and everyday contexts (e.g. metromaps) but also in various technical application such as VLSI layouting or floor planning applications. Unsurprisingly each application domain has different demands for the necessary embeddings giving rise to a vast array of research questions. The fact that efficient embedding algorithms can help various users in their professional or daily lifes, e.g., by making relational data easier to understand, is a major motivation for my research.

Short CV

2024-today	Post-Doc Technical University of Munich
2020-2024	Post-Doc University of Tübingen
2016-2020	Dr. rer. nat. University of Tübingen • Topic: Graph Drawing Beyond the Beaten Tracks  Advisor: Michael Kaufmann • Degree: summa cum laude
2014-2016	M.Sc. in Computer Science University of Tübingen • Thesis Topic: An ILP for Perfect Smooth Orthogonal Drawings Advisors: Michael Kaufmann, Michael A. Bekos • Degree: 1.4
2010-2014	B.Sc. in Engineering & Computing TU Bergakademie Freiberg • Degree: 1.8
2010	Abitur Gymnasium "Am Markt" Hettstedt

Publications

Please refer to the list on DBLP.

Awards

• Best Paper Award at GD 2024.
• First Place at GD Contest 2022 Live Challenge (Manual Category).
• Best Presentation Award at GD 2022.
• First Place at GD Contest 2020 Live Challenge (Automatic Category).
• First Place at GD Contest 2019 Live Challenge (Automatic Category).
• First Place at GD Contest 2019 Live Challenge (Manual Category).
• First Place at GD Contest 2018 Live Challenge (Automatic Category).

Committees and Other Services to the Community

• PC member GD2025
• PC member WG2025
• OC member WG2022
• PC member GD2022
• OC member GD2021
• SafeToC advocate for GD

Teaching