1 citations · 1 across the 9 of their papers we have counts for
3 papers · 1 filter
Constrained Level Planarity is FPT with Respect to the Vertex Cover Number
Boris Klemz, Marie Diana Sieper
The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every e…
Constrained and Ordered Level Planarity Parameterized by the Number of Levels
Václav Blažej, Boris Klemz, Felix Klesen +3
The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every e…
Clustered Planarity Variants for Level Graphs
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter +1
We consider variants of the clustered planarity problem for level-planar drawings. So far, only convex clusters have been studied in this setting. We introduce two new variants tha…