Thomas Depian

Address:
Thomas Depian
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Room:	HA0416
Phone:	+43(1)58801–192124
Email:	tdepian@ac.tuwien.ac.at
Web:	http://www.ac.tuwien.ac.at/people/tdepian/

11 results

2025
[11]	Constrained Boundary Labeling Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger Comput. Geom. Theory Appl., volume 129, pages 102191, 2025. [bibtex] [doi]
[10]	Network Navigation with Online Delays is PSPACE-complete Thomas Depian, Christoph Kern, Sebastian Röder, Soeren Terziadis, Markus Wallinger Chapter in Studierendenkonferenz Informatik (SKILL 2023), pages 195–206, 2025, Gesellschaft für Informatik e.V.. [bibtex] [doi]
[9]	On Planar Unit-Length Linear Linkages in Polygonal Domains Thomas Depian, Carolina Haase, Martin Nöllenburg, André Schulz European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 55:1–55:9, 2025. [bibtex]
[8]	Partial Level Planarity Parameterized by the Size of the Missing Graph Thomas Depian, Simon D. Fink, Boris Klemz, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 50:1–50:10, 2025. [bibtex]
[7]	The Peculiarities of Extending Queue Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Graph-Theoretic Concepts in Computer Science (WG'25) (Henning Fernau, Philipp Kindermann, eds.), 2025, Springer. Note: To appear. [bibtex] [doi]
[6]	Pathways to Tractability for Geometric Thickness Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 209–224, 2025, Springer. [bibtex] [doi]
[5]	Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms Thomas Depian, Simon D. Fink, Robert Ganian, Vaishali Surianarayanan 33rd Annual European Symposium on Algorithms (ESA 2025), 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
2024
[4]	Constrained Boundary Labeling Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger Algorithms and Computation (ISAAC'24) (Julian Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 26:1–26:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[3]	The Parameterized Complexity of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[2]	Minimizing Corners in Colored Rectilinear Grids Thomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms Algorithms and Computation (WALCOM'24) (Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, eds.), volume 14549 of LNCS, pages 134–148, 2024, Springer. [bibtex] [doi]
2023
[1]	Transitions in Dynamic Point Labeling Thomas Depian, Guangping Li, Martin Nöllenburg, Jules Wulms Geographic Information Science (GIScience'23) (Roger Beecham, Jed A. Long, Dianna Smith, Qunshan Zhao, Sarah Wise, eds.), volume 277 of LIPIcs, pages 2:1–2:19, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]