Thomas Depian
Projektass. Dipl.-Ing.

Thomas Depian

BSc

Biography

Thomas Depian is part of the Scientific Staff at TU Wien.

Projects

Parameterized Graph Drawing

Recent Publications

Realizing Planar Linkages in Polygonal Domains
International Workshop on Combinatorial Algorithms (IWOCA'26), 2026.
Note: To appear.
The Peculiarities of Extending Queue Layouts
Graph-Theoretic Concepts in Computer Science (WG'25) (Fernau, Henning and Kindermann, Philipp), volume 16124 of LNCS, pages 177-191, 2026, Springer.
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland (Anne Benoit and Haim Kaplan and Sebastian Wild and Grzegorz Herman), volume 351 of LIPIcs, pages 15:1-15:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Network Navigation with Online Delays is PSPACE-complete
Chapter in Studierendenkonferenz Informatik (SKILL 2023), pages 195-206, 2025, Gesellschaft für Informatik e.V..
On Planar Unit-Length Linear Linkages in Polygonal Domains
European Workshop on Computational Geometry (EuroCG'25) (Kratochvíl, Jan and Liotta, Giuseppe), pages 55:1-55:9, 2025.
Partial Level Planarity Parameterized by the Size of the Missing Graph
European Workshop on Computational Geometry (EuroCG'25) (Kratochvíl, Jan and Liotta, Giuseppe), pages 50:1-50:10, 2025.
Pathways to Tractability for Geometric Thickness
Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic and Vera Kurková), volume 15538 of LNCS, pages 209-224, 2025, Springer.
Structural Parameterizations of Simultaneous Planarity
36th International Symposium on Algorithms and Computation, ISAAC 2025, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
The Peculiarities of Extending Queue Layouts
Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, 2025.
Visualizing Treewidth
Graph Drawing and Network Visualization (GD'25) (Dujmović, Vida and Montecchiani, Fabrizio), volume 357 of LIPIcs, pages 17:1-17:20, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Constrained Boundary Labeling
Algorithms and Computation (ISAAC'24) (Mestre, Julian and Wirth, Anthony), volume 322 of LIPIcs, pages 26:1-26:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Minimizing Corners in Colored Rectilinear Grids
Algorithms and Computation (WALCOM'24) (Ryuhei Uehara and Katsuhisa Yamanaka and Hsu-Chun Yen), volume 14549 of LNCS, pages 134-148, 2024, Springer.
The Parameterized Complexity of Extending Stack Layouts
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 12:1-12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Transitions in Dynamic Point Labeling
Geographic Information Science (GIScience'23) (Roger Beecham and Long, Jed A. and Dianna Smith and Qunshan Zhao and Sarah Wise), volume 277 of LIPIcs, pages 2:1-2:19, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.