Partial edge drawings (PED) of graphs avoid edge crossings by subdividin...
The study of nonplanar drawings of graphs with restricted crossing
confi...
This paper studies a packing problem in the so-called beyond-planar
sett...
In a graph story the vertices enter a graph one at a time and each verte...
A map graph is a graph admitting a representation in which vertices are
...
We study the parameterized complexity of the s-Club Cluster Edge Deletio...
This paper studies the problem of computing quasi-upward planar drawings...
Hybrid visualizations mix different metaphors in a single layout of a
ne...
Storyline visualizations depict the temporal dynamics of social interact...
In this work, we continue the study of vertex colorings of graphs, in wh...
We introduce and study the 1-planar packing problem: Given k graphs with...
We study the interplay between embedding constrained planarity and hybri...
Many real-world networks are globally sparse but locally dense. Typical
...
Hierarchical embedding constraints define a set of allowed cyclic orders...
We study the question whether a crossing-free 3D morph between two
strai...
A drawing of a graph is greedy if for each ordered pair of vertices u an...
Motivated by hybrid graph representations, we introduce and study the
fo...
An ortho-polygon visibility representation Γ of a 1-plane graph G
(OPVR ...
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...
The assignment of weights to attacks in a classical Argumentation Framew...