We consider upward planar drawings of directed graphs in the plane (UP), and on standing (SUP) and rolling cylinders (RUP). In the plane and on the standing cylinder the edge curves are monotonically increasing in y-direction. On the rolling cylinder they wind unidirectionally around the cylinder. There is a strict hierarchy of classes of upward planar graphs: UP ⊂ SUP ⊂ RUP. In this paper, we show that rolling and standing cylinders switch roles when considering an upward planar graph and its dual. In particular, we prove that a strongly connected graph is RUP if and only if its dual is a SUP dipole. A dipole is an acyclic graph with a single source and a single sink. All RUP graphs are characterized in terms of their duals using generaliz...
In a mixed upward drawing of a graph G=(V,E) all directed edges E_D \subseteq E are represented by m...
It is proved that every series-parallel digraph whose maximum vertex-degree is ΔΔ admits an upward...
Recently, we presented a new practical method for upward crossing minimization [6], which clearly ou...
We consider directed planar graphs with an upward planar drawing on the rolling and standing cylinde...
We consider planar upward drawings of directed graphs on arbitrary surfaces where the upward directi...
An upward plane drawing of a directed acyclic graph is a plane drawing of the graph in which each di...
. An upward plane drawing of a directed acyclic graph is a plane drawing of the digraph in which eac...
A upward plane drawing of a directed acyclic graph is a straight line drawing in the Euclidean plane...
A directed acyclic graph is upward planar if it allows a drawing without edge crossings where all ed...
A mixed plane graph is a plane graph whose edge set is partitioned into a set of directed edges and ...
In this paper we study the computational complexity of the UPWARD PLANARITY EXTENSION problem, which...
In an upward planar 2-slope drawing of a digraph, edges are drawn as straight-line segments in the u...
An upward embedding of an embedded planar graph specifies, for each vertex v, which edges are incide...
In an upward-planar L-drawing of a directed acyclic graph (DAG) each edge $e$ is represented as a po...
A directed acyclic graph (DAG) is upward planar if it can be drawn without any crossings while all e...
In a mixed upward drawing of a graph G=(V,E) all directed edges E_D \subseteq E are represented by m...
It is proved that every series-parallel digraph whose maximum vertex-degree is ΔΔ admits an upward...
Recently, we presented a new practical method for upward crossing minimization [6], which clearly ou...
We consider directed planar graphs with an upward planar drawing on the rolling and standing cylinde...
We consider planar upward drawings of directed graphs on arbitrary surfaces where the upward directi...
An upward plane drawing of a directed acyclic graph is a plane drawing of the graph in which each di...
. An upward plane drawing of a directed acyclic graph is a plane drawing of the digraph in which eac...
A upward plane drawing of a directed acyclic graph is a straight line drawing in the Euclidean plane...
A directed acyclic graph is upward planar if it allows a drawing without edge crossings where all ed...
A mixed plane graph is a plane graph whose edge set is partitioned into a set of directed edges and ...
In this paper we study the computational complexity of the UPWARD PLANARITY EXTENSION problem, which...
In an upward planar 2-slope drawing of a digraph, edges are drawn as straight-line segments in the u...
An upward embedding of an embedded planar graph specifies, for each vertex v, which edges are incide...
In an upward-planar L-drawing of a directed acyclic graph (DAG) each edge $e$ is represented as a po...
A directed acyclic graph (DAG) is upward planar if it can be drawn without any crossings while all e...
In a mixed upward drawing of a graph G=(V,E) all directed edges E_D \subseteq E are represented by m...
It is proved that every series-parallel digraph whose maximum vertex-degree is ΔΔ admits an upward...
Recently, we presented a new practical method for upward crossing minimization [6], which clearly ou...