… We study k-page upward book embeddings (kUBEs) of st-graphs, that is, book embeddings
… in a topological ordering along the spine of the book. We show that testing whether a graph …

… notable families of plane st-graphs that always admit an embedding-preserving \(2\)UBE. …
embedding setting (Theorem 7). We recall that in the variable embedding setting an st-graphs …

… upward pointset embeddings (UPSEs) of planar st-graphs. Let G be a planar st-graph and
let S ⊂ R2 be a pointset with |S| = |V (G)|. An UPSE of G on S is an upward … for st-graphs that …

… upward planar straight-line drawing of the underlying st -planar graph. We take this idea and
adapt it to upward 2-page book embeddings. … Upward book embeddings of st-graphs. In G. …

… A topological book embedding (TBE) of G is a planar drawing such that all vertices of G are
… We assume that in a topological book embedding every edge is drawn as a sequence of …

… problem of determining an upward 2-page topological book embedding with minimum num…
st-digraphs an upward topological 2-page book embedding with minimum number of spine …

… st-graphs. Being able to compute bitonic st-orderings for planar st-graphs is of particular
interest for upward … We introduce this subset of planar st-graphs in a more formal manner for …

… In this paper new results on upward book embeddings of series–parallel digraphs are
presented and an application of these results to a computational geometry problem is discussed. …

… book embeddings, the (UBT) of a DAG G is defined as the smallest k for which G admits a
k-page UBE. The notion of upward book embeddings is similar to upward … time for st-graphs of …

… In this section more details are given on the drawing of specific embeddings of st-planar …
respectively, and as faces have only one source in st-graphs, we need two faces for a forbidden …