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

Hybrid visualizations combine different metaphors into a single network layout, in order to
help humans in finding the “right way” of displaying the different portions of the network …

We study the complexity of testing whether a biconnected graph G=(V, E) is planar with the
constraint that some cyclic orders of the edges incident to its vertices are allowed while …

We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum
size of each cluster is bounded by a constant k. We consider both the case when the sides of …

Motivated by hybrid graph representations, we introduce and study the following beyond-
planarity problem, which we call h-Clique2Path Planarity: Given a graph G, whose vertices …

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 …

We present a new model for hybrid planarity that relaxes existing hybrid representations. A
graph G=(V, E) is (k, p)-planar if V can be partitioned into clusters of size at most k such that …

The complexity of deciding whether a clustered graph admits a clustered planar drawing is a
long-standing open problem in the graph drawing research area. Several research efforts …

Abstract Recently, Fulek et al.[1–3] have presented Hanani-Tutte results for (radial) level
planarity, ie, a graph is (radial) level planar if it admits a (radial) level drawing where any two …

Drawing digraphs presents unique challenges that do not occur when drawing undirected
graphs. Many digraphs tend to represent transitive relationships; that is they have a flow …