Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and
studies geometric representations of nonplanar graphs in terms of forbidden crossing …

The crossing number is a popular tool in graph drawing and visualization, but there is not
really just one crossing number; there is a large family of crossing number notions of which …

We investigate crossing minimization for 1-page and 2-page book drawings. We show that
computing the 1-page crossing number is fixed-parameter tractable with respect to the …

We study $ k $-page upward book embeddings ($ k $ UBEs) of $ st $-graphs, that is, book
embeddings of single-source single-sink directed acyclic graphs on $ k $ pages with the …

A $ k $-page book embedding of a graph $ G $ draws the vertices of $ G $ on a line and the
edges on $ k $ half-planes (called pages) bounded by this line, such that no two edges on …

A k-page upward book embedding (k UBE) of a directed acyclic graph G is a book
embeddings of G on k pages with the additional requirement that the vertices appear in a …

We introduce the novel concepts of local and union book embeddings, and, as the
corresponding graph parameters, the local page number pn _ ℓ (G) and the union page …

Given a graph G=(V, E) G=(V, E) and a fixed linear order of V, the problem fixed-order book
drawing with bounded number of crossings per edge asks whether there is ak-page book …

A mixed s-stack q-queue layout of a graph consists of a linear order of its vertices and a
partition of its edges into s stacks and q queues, such that no two edges in the same stack …

The problem book drawing with a bounded number of crossings per edge asks, given a
graph G=(V, E) G=(V, E) and two integers k, b, whether there is ak-page book drawing of G …