Johannes Zink

Dr. Johannes Zink is a Post-Doc researcher at the Chair of Efficient Algorithms (Prof. Kobourov) at Technical University of Munich (TUM), Campus Heilbronn since October 2024. Previously, he was a Post-Doc at University of Würzburg (2023-2024) and completed his PhD there under the supervision of Prof. Alexander Wolff. His research focuses on graph drawing, computational geometry, and algorithmic complexity problems.

Zink's research interests span multiple areas within theoretical computer science, with particular emphasis on graph drawing algorithms, computational geometry problems, and complexity analysis. His work often involves finding efficient algorithms for geometric representations of graphs, analyzing the segment number of planar graphs, and developing techniques for polyline simplification. He has made significant contributions to understanding upward planar drawings, tangle complexity, and level planarity problems.

His publication record shows a strong trend toward geometric graph representations, with many papers focusing on visualization techniques, algorithmic solutions for drawing problems, and complexity analyses. His research combines theoretical insights with practical applications, particularly in visualization systems and geometric data processing.

Awards and Recognition

• Multiple 1st place wins at Graph Drawing Live Challenges (2018, 2020, 2023, 2024)
• PhD prize from Lower Franconian Memorial Year Foundation (2024)
• PhD prize from University of Würzburg Institute of Computer Science (2023)
• Deutschlandstipendium scholarship (2015-2017)
• Bachelor's thesis prize from University of Würzburg (2016)

Zink has supervised numerous bachelor's and master's theses, demonstrating his commitment to mentoring the next generation of researchers. His teaching portfolio includes courses on computational geometry, advanced algorithms, and graph visualization. He has also served on program committees for major conferences including EuroCG 2025 and GD 2023, reflecting his standing in the academic community.