Abstract
Full Citation:
Depian, Thomas, Fink, Simon D., Firbas, Alexander, Ganian, Robert, Nöllenburg, Martin. Pathways to Tractability for Geometric Thickness. Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Kr'alovic and Vera Kurkov'a), volume 15538 of LNCS, pages 209-224, 2025, Springer.

Thomas Depian is a University Assistant at the Algorithms and Complexity Group.

Simon Dominik Fink was a Project Assistant at the Algorithms and Complexity Group.

Alexander Firbas is a Project Assistant at the Algorithms and Complexity Group.

Robert Ganian is a Professor at the Algorithms and Complexity Group.

Martin Nöllenburg is a Professor at the Algorithms and Complexity Group.