The Parameterized Complexity Of Extending Stack Layouts

Abstract

Full Citation:

Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg. 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 and Karsten Klein), volume 320 of LIPIcs, pages 12:1-12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Thomas Depian

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

Simon Dominik Fink

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

Robert Ganian

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