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

This paper studies the problem of computing quasi-upward planar drawings of bimodal
plane digraphs with minimum curve complexity, ie, drawings such that the maximum number …

This is an invitation to the research area of graph drawing. It encompasses basic research
such as graph theory, complexity theory, data structures, and graph algorithms as well as …

Given a planar digraph $ G $ and a positive even integer $ k $, an embedding of $ G $ in the
plane is k-modal, if every vertex of $ G $ is incident to at most $ k $ pairs of consecutive …

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 …

A mixed graph has both directed and undirected edges. We study how to compute a
crossing-free drawing of an embedded planar mixed graph, such that it is upward 'as much …

In a planar L-drawing of a directed graph (digraph) each edge e is represented as a polyline
composed of a vertical segment starting at the tail of e and a horizontal segment ending at …

A has a set of vertices, a set of undirected edges, and a set of directed arcs. A of a mixed
graph G is a function c that assigns to each vertex in G a positive integer such that, for each …

Overloaded orthogonal drawing (OOD) is a recent graph visualization style specifically
conceived for directed graphs. It merges the advantages of some popular drawing …

A directed acyclic graph is upward planar if it allows a drawing without edge crossings
where all edges are drawn as curves with monotonously increasing y-coordinates. The …