Thomas Depian
My name is Thomas Depian and I am originally from South Tyrol and currently based in Vienna.
I am a PhD student in the Algorithms and Complexity Group at TU Wien, supervised by Martin Nöllenburg and Robert Ganian. My research interests lie in intersection between parameterized complexity, graph drawing, and computational geometry. The PhD position is funded through the WWTF project on Parameterized Graph Drawing, which aims to apply well-established tool from parameterized complexity to central problems in graph drawing and visualization.
I enjoy working on tough problems — especially when they relate to real-world challenges. What motivates me most is finding elegant solutions to complex questions, ideally with both theoretical depth and some practical relevance.
For more details about my work, you can visit my Google Scholar profile or check out my list of publications. If you want
September 6, 2025
Our paper “Structural Parameterizations of Simultaneous Planarity”, in which we revisit SEFE problem, has been accepted to ISAAC 2025.
August 6, 2025
Our paper “Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms” has been accepted for presentation at ESA 2025. Furthermore, our paper “Visualizing Treewidth” has been accepted to GD 2025.
May 5, 2025
Creating my own webpage had been on my to-do list for a long time; glad to finally cross it off :)