5 citations · 14 across the 11 of their papers we have counts for
3 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…
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…
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…