24 citations · 124 across the 75 of their papers we have counts for
14 papers · 1 filter
Perfect Rectangular Tilings with Two Colors
Oswin Aichholzer, Robert Ganian, Phillip Keldenich +5
We study a finite tiling problem, where tiles are unit squares whose four edges are colored with one of two colors. We ask whether a given rectangle admits a perfect rectangular ti…
Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms
Alexander Firbas, Robert Ganian, Sylvain Meunier +1
Two-layer drawings of bipartite graphs place the vertices of each part on one of two parallel lines and draw the edges as straight-line links. Traditionally, the optimization goal…
A Fixed-Parameter Algorithm for Extending Upward Planar Drawings
Vera Chekan, Robert Ganian, Viktoriia Korchemna
An upward planar drawing of a directed acyclic graph is a planar drawing where every edge is pointed upward from its tail to head. Upward planar drawings are among the most natural…
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…
The Parameterized Complexity of Extending Stack Layouts
Thomas Depian, Simon D. Fink, Robert Ganian +1
An -page stack layout (also known as an -page book embedding) of a graph is a linear order of the vertex set together with a partition of the edge set into stack…
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs
Cornelius Brand, Robert Ganian, Sebastian Röder +1
In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly , where the number of bend…