Scholar
Thomas Depian
Google Scholar ID: mlFrfkcAAAAJ
PhD Student, TU Wien
Citations & Impact
Citations
8
H-index
1
i10-index
0
Publications
11
Co-authors
13
list available
Contact
Publications
Cited
0
Resume (English only)
Academic Achievements
- 2025: 'Constrained Boundary Labeling' published in Comput. Geom. Theory Appl.
- 2025: 'Network Navigation with Online Delays is PSPACE-complete' published in Studierendenkonferenz Informatik (SKILL 2023).
- 2025: 'On Planar Unit-Length Linear Linkages in Polygonal Domains' presented at European Workshop on Computational Geometry (EuroCG'25).
- 2025: 'Partial Level Planarity Parameterized by the Size of the Missing Graph' presented at European Workshop on Computational Geometry (EuroCG'25).
- 2025: 'The Peculiarities of Extending Queue Layouts' to be presented at Graph-Theoretic Concepts in Computer Science (WG'25).
- 2025: 'Pathways to Tractability for Geometric Thickness' presented at Theory and Practice of Computer Science (SOFSEM'25).
- 2025: 'Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms' to be presented at 33rd Annual European Symposium on Algorithms (ESA 2025).
- 2024: 'Constrained Boundary Labeling' presented at Algorithms and Computation (ISAAC'24).
- 2024: 'The Parameterized Complexity of Extending Stack Layouts' presented at Graph Drawing and Network Visualization (GD'24).
- 2024: 'Minimizing Corners in Colored Rectilinear Grids' presented at Algorithms and Computation (WALCOM'24).
- 2023: 'Transitions in Dynamic Point Labeling' presented at Geographic Information Science (GIScience'23).
Research Experience
- Involved in multiple research projects, including constrained boundary labeling, online delays in network navigation, planar unit-length linear linkages, etc.
Background
- Member of the Algorithms and Complexity Group; focuses on computational geometry and graph theory.
