73 citations · 178 across the 49 of their papers we have counts for
6 papers · 1 filter
Edge-Minimum Saturated k-Planar Drawings
Steven Chaplick, Fabian Klute, Irene Parada +2
For a class of drawings of loopless (multi-)graphs in the plane, a drawing is \emph{saturated} when the addition of any edge to results in $D'…
The Local Queue Number of Graphs with Bounded Treewidth
Laura Merker, Torsten Ueckerdt
A queue layout of a graph consists of a vertex ordering of and a partition of the edges into so-called queues such that no two edges in the same queue nest, i.e., have thei…
Plattenbauten: Touching Rectangles in Space
Stefan Felsner, Kolja Knauer, Torsten Ueckerdt
Planar bipartite graphs can be represented as touching graphs of horizontal and vertical segments in . We study a generalization in space: touching graphs of axis-ali…
Guarding Quadrangulations and Stacked Triangulations with Edges
Paul Jungeblut, Torsten Ueckerdt
Let be a plane graph. A face of is guarded by an edge if at least one vertex from is on the boundary of . For a planar graph class $\mat…
Four Pages Are Indeed Necessary for Planar Graphs
Michael A. Bekos, Michael Kaufmann, Fabian Klute +3
An embedding of a graph in a book consists of a linear order of its vertices along the spine of the book and of an assignment of its edges to the pages of the book, so that no two…
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets
Gábor Damásdi, Stefan Felsner, António Girão +4
We study covering numbers and local covering numbers with respect to difference graphs and complete bipartite graphs. In particular we show that in every cover of a Young diagram w…