1 citations · 1 across the 3 of their papers we have counts for
4 papers
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
Thomas Depian, Simon D. Fink, Robert Ganian +1
In spite of the extensive study of stack and queue layouts, many fundamental questions remain open concerning the complexity-theoretic frontiers for computing stack and queue layou…
The Peculiarities of Extending Queue Layouts
Thomas Depian, Simon D. Fink, Robert Ganian +1
We consider the problem of computing -page queue layouts, which are linear arrangements of vertices accompanied with an assignment of the edges to pages from one to th…
Pathways to Tractability for Geometric Thickness
Thomas Depian, Simon Dominik Fink, Alexander Firbas +2
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible…
Level Planarity Is More Difficult Than We Thought
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter +1
We consider three simple quadratic time algorithms for the problem Level Planarity and give a level-planar instance that they either falsely report as negative or for which they ou…