84 citations · 92 across the 11 of their papers we have counts for
5 papers · 1 filter
Queue Layouts of Planar 3-Trees
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann +2
A queue layout of a graph G consists of a linear order of the vertices of G and a partition of the edges of G into queues, so that no two independent edges of the same queue are ne…
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
Evmorfia Argyriou, Sabine Cornelsen, Henry Förster +5
While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of c…
A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution
Michael A. Bekos, Henry Förster, Christian Geckeler +4
The crossing resolution of a non-planar drawing of a graph is the value of the minimum angle formed by any pair of crossing edges. Recent experiments have shown that the larger the…
On RAC Drawings of Graphs with one Bend per Edge
Patrizio Angelini, Michael A. Bekos, Henry Förster +1
A k-bend right-angle-crossing drawing or (k-bend RAC drawing}, for short) of a graph is a polyline drawing where each edge has at most k bends and the angles formed at the crossing…
On Dispersable Book Embeddings
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann +2
In a dispersable book embedding, the vertices of a given graph must be ordered along a line l, called spine, and the edges of G must be drawn at different half-planes bounded b…