Philipp Kindermann

Philipp Kindermann is an Associate Professor in the Department of Computer Science at the University of Trier, Germany, where he leads the Algorithmics team within the Faculty of Mathematics and Computer Science. He holds a PhD from the University of Würzburg and has held academic positions at the University of Waterloo, FernUniversität in Hagen, and Universität Passau. His research is centered on theoretical and applied aspects of graph algorithms, computational geometry, and graph drawing.

Research Interests: His work focuses on graph drawing, geometric graph algorithms, planarity, parameterized complexity, and combinatorial optimization. He investigates algorithmic solutions for visualizing graphs with geometric constraints, including rectilinear drawings, layered layouts, and contact representations. His research also extends to computational complexity of graph problems, especially in beyond-planar graph classes.

Publication Trends: His recent publications (2022–2024) show a strong emphasis on parameterized algorithms, planarity variants (upward, orthogonal), geometric representations (rectangle contacts, tangles), and algorithmic challenges in graph drawing. His work frequently appears in top venues such as GD, ISAAC, SOFSEM, and Algorithmica, reflecting sustained contributions to theoretical computer science and visualization.

• Special Issue Editor, Journal of Graph Algorithms and Applications (JGAA)
• Special Issue Editor, Computational Geometry: Theory and Applications (CGTA)
• Steering Committee Member, WG (2025–2028)
• Program Committee Chair, WG 2025 and EuroCG 2020
• PC Member for GD, WALCOM, PacificVis, SOFSEM, IWOCA, and others
• Organizer of ISSEP 2025, WG 2025, IWOCA 2022, EuroCG 2020, GD 2014
• Workshop Organizer: Dagstuhl Seminar (2026), GGWeek 2024, PhD Schools
• Member of PACE Challenge Steering Committee (since 2024); PC Chair PACE 2024
• Advisory Committee, Computational Geometry Challenge (since 2020)
• Graph Drawing Contest Committee (2015–2023), Chair (2018–2022)

Philipp Kindermann actively contributes to the academic community through editorial work, conference leadership, and organizing competitive events in algorithmics and visualization. He collaborates extensively with researchers across Europe and North America. He teaches courses such as Algorithms and Data Structures, Algorithms for Programming Contests, and Advanced Algorithms. He maintains an active research lab focused on geometric and graph-theoretic problems, fostering innovation in algorithm design and visualization techniques.