21 citations · 92 across the 45 of their papers we have counts for
8 papers · 1 filter
Planar Graphs of Bounded Degree have Constant Queue Number
Michael A. Bekos, Henry Förster, Martin Gronemann +4
A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same que…
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…
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…
Greedy Rectilinear Drawings
Patrizio Angelini, Michael A. Bekos, Walter Didimo +6
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vert…
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…
Universal Slope Sets for Upward Planar Drawings
Michael A. Bekos, Emilio Di Giacomo, Walter Didimo +2
We prove that every set of slopes containing the horizontal slope is universal for -bend upward planar drawings of bitonic -graphs with maximum vertex degre…
Edge Partitions of Optimal -plane and -plane Graphs
Michael Bekos, Emilio Di Giacomo, Walter Didimo +3
A topological graph is a graph drawn in the plane. A topological graph is -plane, , if each edge is crossed at most times. We study the problem of partitioning the edge…