New PhD: Ronald De Haan
Ronald de Haan successfully defended his PhD thesis "Parameterized Complexity in the Polynomial Hierarchy" on November 8th, 2016. Congratulations!
Ronald was supervised by Stefan Szeider.
News
PhD completed by Soeren Terziadis
Soeren Terziadis successfully defended his PhD thesis “Algorithms for Schematic Representations” on January 9, 2024. Congratulations, Dr. Terziadis! Soeren was …Read More »
Informatics Awards 2023
The Algorithms and Complexity group was very successful at the Informatics Awards 2023: André Schidler won the Best Dissertation Award …Read More »
Jiehua Chen: promotion to tenured Associate Professor
After her successful tenure evaluation, our colleague Jiehua Chen has been promoted to an Associate Professor. Hua joined the Algorithms …Read More »
Successful Graph Drawing conference 2023 in Palermo
The 31st edition of the International Symposium on Graph Drawing and Network Visualization in Palermo, Italy, ended on September 22, …Read More »
PhD completed by Anaïs Villedieu
Anaïs Villedieu successfully defended her PhD thesis “Engineering Human-in-the-loop Graph Drawing Algorithms” on July 24, 2023. Congratulations, Dr. Villedieu! Anaïs …Read More »
Comments are closed.