1 citations · 1 across the 6 of their papers we have counts for
14 papers · 1 filter
On the -Bend Slope Number of -Planar Graphs
Michael A. Bekos, Eleni Katsanou, Philipp Kindermann +3
While drawing planar graphs with few slopes and few bends is a well-studied problem, corresponding extensions to beyond-planar graphs still remain mostly unexplored. Motivated by t…
On the Recognition of Outerplanar Graphs with Queue Number 1
Michael A. Bekos, Thomas Depian, Stefan Felsner +7
A linear layout of a graph is defined as a total order of the vertices and a partition of the edges to pages. In a stack (queue) layout, no two edges on the same page may cross (ne…
How Many Slopes Does Polynomial Area Cost?
Michael A. Bekos, Eleni Katsanou, Philipp Kindermann +1
In this work, we study the interplay between the number of slopes, the number of bends per edge, and the area requirements for planar drawings of bounded-degree graphs. Our motivat…
Upward-Planar Drawings with Bounded Span
Patrizio Angelini, Sabine Cornelsen, Giordano Da Lozzo +4
We consider upward-planar layered drawings of directed graphs, i.e., crossing-free drawings in which each edge is drawn as a y-monotone curve going upward from its tail to its head…
On the Complexity of Extending Storylines
Alexander Dobler, Siddharth Gupta, Philipp Kindermann +2
Storyline layouts visualize temporal interactions by drawing each character as an x-monotone curve and enforcing that the participants of every meeting form a contiguous vertical g…
On Layered Area-Proportional Rectangle Contact Representations
Carolina Haase, Philipp Kindermann
Semantic word clouds visualize the semantic relatedness between the words of a text by placing pairs of related words close to each other. Formally, the problem of drawing semantic…