55 citations · 188 across the 40 of their papers we have counts for
4 papers · 1 filter
Determining Factorial Speed Fast
Zhidan Feng, Henning Fernau, Pamela Fleischmann +2
The speed of a graph class measures how many labeled graphs on vertices one can find in . This graph class complexity function is explicitly provided on graphc…
On Mixed Linear Layouts of Series-Parallel Graphs
Patrizio Angelini, Michael A. Bekos, Philipp Kindermann +1
A mixed s-stack q-queue layout of a graph consists of a linear order of its vertices and of a partition of its edges into s stacks and q queues, such that no two edges in the same…
The Complexity of Finding Tangles
Oksana Firman, Philipp Kindermann, Boris Klemz +3
We study the following combinatorial problem. Given a set of y-monotone curves, which we call wires, a tangle determines the order of the wires on a number of horizontal layers…
Computing Height-Optimal Tangles Faster
Oksana Firman, Philipp Kindermann, Alexander Ravsky +2
We study the following combinatorial problem. Given a set of y-monotone wires, a tangle determines the order of the wires on a number of horizontal layers such that the orders…