The Parameterized Complexity Of Extending Stack Layouts

Abstract

Full Citation:

Depian, Thomas, Fink, Simon D., Ganian, Robert, Nöllenburg, Martin. The Parameterized Complexity Of Extending Stack Layouts. Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026.

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.

Martin Nöllenburg

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