Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

We study the atomic embeddability testing problem, which is a common generalization of
clustered planarity (c-planarity, for short) and thickenability testing, and present a polynomial …

We introduce the problem Synchronized Planarity. Roughly speaking, its input is a loop-free
multi-graph together with synchronization constraints that, eg, match pairs of vertices of …

We consider drawings of graphs that contain dense subgraphs. We introduce intersection-
link representations for such graphs, in which each vertex u is represented by a geometric …

Testing the planarity of a graph and possibly drawing it without intersections is one of the
most fascinating and intriguing algorithmic problems of the graph drawing and graph theory …

In the constrained planarity setting, we ask whether a graph admits a planar drawing that
additionally satisfies a given set of constraints. These constraints are often derived from very …

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 …

The clustered planarity problem (c-planarity) asks whether a hierarchically clustered graph
admits a planar drawing such that the clusters can be nicely represented by regions. We …

The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that
characterizes planar graphs as graphs that admit a drawing in the plane in which every pair …

Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small
Area | SpringerLink Skip to main content Advertisement Springer Nature Link Account Menu …