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

The crossing number is a popular tool in graph drawing and visualization, but there is not
really just one crossing number; there is a large family of crossing number notions of which …

In this work we investigate the complexity of some combinatorial problems related to the
Simultaneous Embedding with Fixed Edges (SEFE) and the Partitioned T-Coherent k-Page …

Many real-world networks exhibit an inherent clustering structure, which may arise from the
presence of communities inside the network or from semantic affinities among nodes …

NodeTrix representations are a popular way to visualize clustered graphs; they represent
clusters as adjacency matrices and inter-cluster edges as curves connecting the matrix …

A graph is k-planar (k ≥ 1)(k≥ 1) if it can be drawn in the plane such that no edge is
crossed k+ 1 k+ 1 times or more. A graph is k-quasi-planar (k ≥ 2)(k≥ 2) if it can be drawn …

The C-Planarity problem asks for a drawing of a clustered graph, ie, a graph whose vertices
belong to properly nested clusters, in which each cluster is represented by a simple closed …

Given a planar graph G and a partition of the neighbors of each vertex v in four sets v↗, v↖,
v↙, and v↘, the problem Windrose Planarity asks to decide whether G admits a windrose …

We study Clustered Planarity with Linear Saturators, which is the problem of augmenting an
$ n $-vertex planar graph whose vertices are partitioned into independent sets (called …

LNCS 8871 - Advances on Testing C-Planarity of Embedded Flat Clustered Graphs Page 1
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs ⋆ Markus Chimani 1 …