A vertex of a plane digraph is bimodal if all its incoming edges (and he...
Computing planar orthogonal drawings with the minimum number of bends is...
The study of nonplanar drawings of graphs with restricted crossing
confi...
Orthogonal graph drawings are used in applications such as UML diagrams,...
In a graph story the vertices enter a graph one at a time and each verte...
A graph is rectilinear planar if it admits a planar orthogonal drawing
w...
The problem of orienting the edges of an undirected graph such that the
...
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph ...
We study the long-standing open problem of efficiently testing rectiline...
Hybrid visualizations mix different metaphors in a single layout of a
ne...
An interesting class of orthogonal representations consists of the so-ca...
In social networks, individuals' decisions are strongly influenced by
re...
Storyline visualizations depict the temporal dynamics of social interact...
A plane graph is rectilinear planar if it admits an embedding-preserving...
The definition of 1-planar graphs naturally extends graph planarity, nam...
A planar orthogonal drawing Γ of a planar graph G is a geometric
represe...
A simple topological graph is k-quasiplanar (k≥ 2) if it contains no
k p...
Many real-world networks are globally sparse but locally dense. Typical
...
We study k-page upward book embeddings (kUBEs) of st-graphs, that is,
bo...
A drawing of a graph is greedy if for each ordered pair of vertices u an...
Graph Drawing Beyond Planarity is a rapidly growing research area that
c...
Let G be a planar 3-graph (i.e., a planar graph with vertex degree at
mo...
We prove that every set S of Δ slopes containing the
horizontal slope i...
A fixed-mobile bigraph G is a bipartite graph such that the vertices of ...