Computing planar orthogonal drawings with the minimum number of bends is...
This paper studies a packing problem in the so-called beyond-planar
sett...
Motivated by dynamic graph visualization, we study the problem of
repres...
We present an O(n^2)-time algorithm to test whether an n-vertex directed...
We obtain new parameterized algorithms for the classical problem of
dete...
This paper studies the problem of computing quasi-upward planar drawings...
Hybrid visualizations mix different metaphors in a single layout of a
ne...
The planar slope number psn(G) of a planar graph G is the
minimum number...
Storyline visualizations depict the temporal dynamics of social interact...
We introduce and study the 1-planar packing problem: Given k graphs with...
Given a planar graph G and an integer b, OrthogonalPlanarity is the
prob...
We study k-page upward book embeddings (kUBEs) of st-graphs, that is,
bo...
Let G be a simple topological graph and let Γ be a polyline drawing
of G...
We present a new model for hybrid planarity that relaxes existing hybrid...
A graph G is (k,p)-planar if its vertices can be partitioned into
cluste...
We prove that every set S of Δ slopes containing the
horizontal slope i...
We show that any planar drawing of a forest of three stars whose vertice...