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 …

Simultaneous embedding is concerned with simultaneously representing a series of graphs
sharing some or all vertices. This forms the basis for the visualization of dynamic graphs and …

In this article, we define and study the new problem of Simultaneous PQ-Ordering. Its input
consists of a set of PQ-trees, which represent sets of circular orders of their leaves, together …

We study the following problem: given a planar graph G and a planar drawing (embedding)
of a subgraph of G, can such a drawing be extended to a planar drawing of the entire graph …

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

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 …

A drawing concerns the process of generating geometric representations of relational
information, usually for visualization purposes. A good drawing provides an understanding …

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 …

In this paper we study the time complexity of the problem Simultaneous Embedding with
Fixed Edges (Sefe), that takes two planar graphs G1=(V, E1) and G2=(V, E2) as input and …

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 …