Given a collection of planar graphs $ G_1,\dots, G_k $ on the same set $ V $ of $ n $
vertices, the simultaneous geometric embedding (with mapping) problem, or simply $ k …

A simultaneous geometric embedding (SGE) of two planar graphs and with the same vertex
set is a pair of straight-line planar drawings of and of such that each vertex is drawn at the …

A subset $ S $ of vertices in a planar graph $ G $ is a free set if, for every set $ P $ of $| S| $
points in the plane, there exists a straight-line crossing-free drawing of $ G $ in which …

In this note we show how techniques developed for untangling planar graphs by Bose et
al.[Discrete & Computational Geometry 42 (4): 570-585 (2009)] and Goaoc et al.[Discrete & …

In this paper we show how techniques developed for untangling planar graphs by Bose et
al.[Discrete & Computational Geometry 42 (4): 570–585 (2009)] and Goaoc et al.[Discrete & …

Given a planar graph G, what is the maximum number of collinear vertices in a planar
straight-line drawing of G? This problem resides at the core of several graph drawing …

Given a graph G=(V, E), a set R⊆ V is column planar in G if we can assign x-coordinates to
the vertices in R such that every assignment of y-coordinates to R gives a partial embedding …

We show that, if an n-vertex triangulation G of maximum degree Δ has a dual that contains a
cycle of length ℓ, then G has a non-crossing straight-line drawing in which some set, called a …

A simultaneous geometric embedding (SGE) of two planar graphs G 1 and G 2 with the
same vertex set is a pair of straight-line planar drawings Γ 1 of G 1 and Γ 2 of G 2 such that …

We introduce the notion of column planarity of a subset R of the vertices of a graph G.
Informally, we say that R is column planar in G if we can assign x-coordinates to the vertices …