Social networks provide a rich source of graph drawing problems, because they appear in
an incredibly wide variety of forms and contexts. After sketching the scope of social network …

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 …

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 …

We prove NP-hardness of a wide class of pushing-block puzzles similar to the classic
Sokoban, generalizing several previous results [ED Demaine et al., in: Proc. 12th Canad …

Consider a planar drawing Γ of a planar graph G such that the vertices are drawn as small
circles and the edges are drawn as thin stripes. Consider a non-simple cycle c of G. Is it …

We present the first characterization of c-planarity for c-connected clustered graphs. The
characterization is based on the interplay between the hierarchy of the clusters and the …

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 …

In this paper we study the clustered graphs whose underlying graph is a cycle. This is a
simple family of clustered graphs that are “highly non connected”. We start by studying 3 …

A cluster of a graph is a non empty subset of vertices. A clustered graph C (G, T) is a graph G
plus a rooted tree T such that the leaves of T are the vertices of G (see Fig. 1 for an …

A 2-page book embedding of a graph is to place the vertices linearly on a spine (a line
segment) and the edges on the two pages (two half planes sharing the spine) so that each …