Thomas Depian
Projektass. Dipl.-Ing. / BSc
Role
- PreDoc Researcher
Algorithms and Complexity, E192-01
Contact
- thomas.depian@tuwien.ac.at
- +43-1-58801-192124
- 1040 Wien, Favoritenstrasse 9 / Room HA0416
- vCard from TISS
- orcid.org/0009-0003-7498-6271
- informatics.tuwien.ac.at/people/thomas-depian
- tiss.tuwien.ac.at/person/319073
Courses
Winter 2026
Publications
- Depian, T., Haase, C., Nöllenburg, M., Schulz, A. (2026). Realizing Planar Linkages in Polygonal Domains. In F. Foucaud A. Parreau (Eds.), Combinatorial Algorithms : 37th International Workshop, IWOCA 2026, Clermont-Ferrand, France, June 8–11, 2026, Proceedings (pp. 251–265). Springer.
- Depian, T., Fink, S. D., Ganian, R., Nöllenburg, M. (2026). The Peculiarities of Extending Queue Layouts. In H. Fernau P. Kindermann (Eds.), Graph-Theoretic Concepts in Computer Science : 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11–13, 2025, Revised Selected Papers (pp. 177–191). Springer. Peer-reviewed.
- Depian, T., Nöllenburg, M., Terziadis, S., Wallinger, M. (2025). Constrained boundary labeling. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 129(C), Article 102191. Peer-reviewed.
- Chiu, A., Depian, T., Eppstein, D., Goodrich, M. T., Nöllenburg, M. (2025). Visualizing Treewidth. In V. Dujmović F. Montecchiani (Eds.), 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025). Schloss Dagstuhl. Peer-reviewed.
- Depian, T., Fink, S. D., Ganian, R., Nöllenburg, M. (2025). The Parameterized Complexity Of Extending Stack Layouts. Journal of Graph Algorithms and Applications, 29(3), 39–78. Peer-reviewed.
- Depian, T., Fink, S. D., Ganian, R., Surianarayanan, V. (2025). Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms. In A. Benoit, H. Kaplan, S. Wild, G. Herman (Eds.), 33rd Annual European Symposium on Algorithms (ESA 2025). Schloss Dagstuhl. Peer-reviewed.
- Depian, T., Fink, S. D., Klemz, B., Ganian, R., Nöllenburg, M., Sieper, M. D. (2025). Partial Level Planarity Parameterized by the Size of the Missing Graph. In EUROCG’25 Booklet of Abstracts. EuroCG 2025, Liblice, Czechia. Peer-reviewed.HDL: 20.500.12708/225288
- Depian, T., Haase, C., Nöllenburg, M., Schulz, A. (2025). On Planar Unit-Length Linear Linkages in Polygonal Domains. In EUROCG’25 Booklet of Abstracts. EuroCG 2025, Liblice, Czechia. Peer-reviewed.HDL: 20.500.12708/225309
- Depian, T., Fink, S. D., Firbas, A., Ganian, R., Nöllenburg, M. (2025). Pathways to Tractability for Geometric Thickness. In SOFSEM 2025: Theory and Practice of Computer Science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part I (pp. 209–224). Springer. Peer-reviewed.
- Depian, T., Li, G., Nöllenburg, M., Wulms, J. (2025). Transitions in dynamic point labeling. Cartography and Geographic Information Science. Peer-reviewed.
- Depian, T., Nöllenburg, M., Terziadis, S., Wallinger, M. (2024). Constrained Boundary Labeling. In J. Mestre A. Wirth (Eds.), 35th International Symposium on Algorithms and Computation (ISAAC 2024). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Peer-reviewed.DOI: 10.4230/LIPIcs.ISAAC.2024.26 / Download: PDF / Project: Engineering Linear Ordering Algorithms for Optimizing Data Visualizations
- Depian, T., Dobler, A., Kern, C., Wulms, J. (2024). Minimizing Corners in Colored Rectilinear Grids. In WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, Proceedings (pp. 134–148). Springer, Singapore. Peer-reviewed.
- Depian, T., Fink, S. D., Ganian, R., Nöllenburg, M. (2024). The Parameterized Complexity Of Extending Stack Layouts. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024) (pp. 12:1-12:17). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Peer-reviewed.DOI: 10.4230/LIPIcs.GD.2024.12 / Download: PDF
- Depian, T., Li, G., Nöllenburg, M., Wulms, J. (2023). Transitions in Dynamic Point Labeling. In 12th International Conference on Geographic Information Science (GIScience 2023). 12th International Conference on Geographic Information Science (GIScience 2023), Leeds, United Kingdom of Great Britain and Northern Ireland (the). Schloss-Dagstuhl - Leibniz Zentrum für Informatik.DOI: 10.4230/LIPIcs.GIScience.2023.2 / Download: PDF / Projects: HumAlgo, Engineering Linear Ordering Algorithms for Optimizing Data Visualizations
Presentations
- Depian, T., Li, G., Nöllenburg, M., Wulms, J. (2022). Transitions in Dynamic Map Labeling [Conference Presentation]. European Workshop on Computational Geometry, Perugia, Italy.DOI: 10.34726/3122 / Download: PDF / Projects: HumAlgo, Engineering Linear Ordering Algorithms for Optimizing Data Visualizations
Theses
- Pressel, F. (2025). Visualizing geophylogenies : external labeling with modifiable phylogenetic tree constraints [Diploma Thesis, Technische Universität Wien]. reposiTUm.DOI: 10.34726/hss.2025.128362 / Download: PDF
- Depian, T. (2023). Grouping and ordering constraints in boundary labeling [Diploma Thesis, Technische Universität Wien]. reposiTUm.DOI: 10.34726/hss.2023.113812 / Download: PDF