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 accumulation of physical errors,–prevents the execution of large-scale algorithms in
current quantum computers. Quantum error correction promises a solution by encoding k …

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 …

Given two planar graphs G_1 G 1 and G_2 G 2 that share some vertices and edges, a
simultaneous embedding with fixed edges (Sefe) is a pair of planar topological …

Abstract We study Hanani-Tutte style theorems for various notions of planarity, including
partially embedded planarity, and simultaneous planarity. This approach brings together the …

A\emphk-stack layout (respectively,\emphk-queuelayout) of a graph consists of a total order
of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges …

Abstract Let G=(V, E) be a graph with n vertices and let P be a set of n points in the plane.
We show that deciding whether there is a planar straight-line embedding of G such that the …

Consider a drawing of a graph G in the plane such that crossing edges are coloured
differently. The minimum number of colours, taken over all drawings of G, is the classical …

We present an O (n) time algorithm for simultaneous embedding of pairs of planar graphs on
the O (n 2)× O (n 2) grid, with at most three bends per edge, where n is the number of …

A\emph (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total
order of each vertex colour class, and a (non-proper) edge k-colouring such that between …