Publications: Thomas Depian
2026
| [1] | The Parameterized Complexity Of Extending Stack Layouts Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026. |
| [2] | Visualizing Treewidth J. Graph Algorithms Appl., volume 30, number 2, pages 199–235, 2026. |
| [3] | On the Recognition of Outerplanar Graphs with Queue Number 1 Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [4] | Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [5] | Point Set Embeddability with List Constraints Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [6] | Realizing Planar Linkages in Polygonal Domains International Workshop on Combinatorial Algorithms (IWOCA'26) (F. Foucaud, A. Parreau, eds.), volume 16587 of LNCS, pages 251–265, 2026, Springer. |
| [7] | Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii European Symposium on Algorithms (ESA'26) (Seth Pettie, Philip Bille, Sabine Storandt, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [8] | The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [9] | The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [10] | The Peculiarities of Extending Queue Layouts Graph-Theoretic Concepts in Computer Science (WG'25) (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of LNCS, pages 177–191, 2026, Springer. |
2025
| [1] | Constrained Boundary Labeling Comput. Geom. Theory Appl., volume 129, pages 102191, 2025. |
| [2] | Transitions in Dynamic Point Labeling Cartography and Geographic Information Science, pages 1–26, 2025. |
| [3] | Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms 33rd Annual European Symposium on Algorithms, ESA 2025, September 15-17, 2025, Warsaw, Poland (Anne Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman, eds.), volume 351 of LIPIcs, pages 15:1–15:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [4] | On Planar Unit-Length Linear Linkages in Polygonal Domains European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 55:1–55:9, 2025. |
| [5] | Partial Level Planarity Parameterized by the Size of the Missing Graph European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 50:1–50:10, 2025. |
| [6] | Pathways to Tractability for Geometric Thickness Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 209–224, 2025, Springer. |
| [7] | Pathways to Tractability for Geometric Thickness (Best Paper Award) 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 (Rastislav Královic, Vera Kurková, eds.), volume 15538 of Lecture Notes in Computer Science, pages 209–224, 2025, Springer. |
| [8] | Structural Parameterizations of Simultaneous Planarity 36th International Symposium on Algorithms and Computation, ISAAC 2025, Tainan, Taiwan, December 7-10, 2025 (Ho-Lin Chen, Wing-Kai Hon, Meng-Tsung Tsai, eds.), volume 359 of LIPIcs, pages 25:1–25:17, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [9] | The Peculiarities of Extending Queue Layouts Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of Lecture Notes in Computer Science, pages 177–191, 2025, Springer. |
| [10] | Visualizing Treewidth Graph Drawing and Network Visualization (GD'25) (Vida Dujmović, Fabrizio Montecchiani, eds.), volume 357 of LIPIcs, pages 17:1–17:20, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [11] | Network Navigation with Online Delays is PSPACE-complete Chapter in Studierendenkonferenz Informatik (SKILL 2023), pages 195–206, 2025, Gesellschaft für Informatik e.V.. |
2024
| [1] | Constrained Boundary Labeling 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. |
| [2] | Minimizing Corners in Colored Rectilinear Grids Algorithms and Computation (WALCOM'24) (Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, eds.), volume 14549 of LNCS, pages 134–148, 2024, Springer. |
| [3] | The Parameterized Complexity of Extending Stack Layouts 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. |
| [4] | The Parameterized Complexity Of Extending Stack Layouts 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
2023
| [1] | Transitions in Dynamic Point Labeling 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. |
AC Admin
Website maintainer