1 citations · 1 across the 9 of their papers we have counts for
5 papers · 1 filter
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
Thomas Depian, Simon D. Fink, Alexander Firbas +3
In this paper, we study the Pattern Avoidance problem of determining whether a given graph admits a linear vertex order which avoids a given pattern , i.e., a vertex sequenc…
Monotone Clustered Level Planarity
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter +1
We consider the combination of the two constrained planarity problems Level- and Clustered Planarity. Traditionally, level-planar drawings with convex clusters have been studied in…
Chunky Chains: Graph Drawings on Small Screens
Tim Hegemann, Dominik Jilg, Marie Diana Sieper +1
We introduce Chunky Chains, a graph drawing style designed for small screens such as smartphones, where vertical scrolling is the dominant means of interaction. A Chunky Chain cons…
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…
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem
Walter Didimo, Fedor V. Fomin, Petr A. Golovach +3
A vertex of a plane digraph is bimodal if all its incoming edges (and hence all its outgoing edges) are consecutive in the cyclic order around it. A plane digraph is bimodal if all…