A pair ⟨ G_0, G_1 ⟩ of graphs admits a mutual witness proximity
drawing ...
Upward planarity testing and Rectilinear planarity testing are central
p...
Computing planar orthogonal drawings with the minimum number of bends is...
The study of nonplanar drawings of graphs with restricted crossing
confi...
We study the following problem: Given a set S of n points in the plane,
...
Orienting the edges of an undirected graph such that the resulting digra...
This paper studies a packing problem in the so-called beyond-planar
sett...
Orthogonal graph drawings are used in applications such as UML diagrams,...
Let Γ be a straight-line drawing of a graph and let u and v be two
verti...
Motivated by dynamic graph visualization, we study the problem of
repres...
A graph is rectilinear planar if it admits a planar orthogonal drawing
w...
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph ...
We study the long-standing open problem of efficiently testing rectiline...
This paper studies optimal-area visibility representations of n-vertex
o...
This paper studies the problem of computing quasi-upward planar drawings...
The planar slope number psn(G) of a planar graph G is the
minimum number...
The LR-drawing-method is a method of drawing an ordered rooted binary tr...
In social networks, individuals' decisions are strongly influenced by
re...
Storyline visualizations depict the temporal dynamics of social interact...
A plane graph is rectilinear planar if it admits an embedding-preserving...
We introduce and study the 1-planar packing problem: Given k graphs with...
A planar orthogonal drawing Γ of a planar graph G is a geometric
represe...
We study the interplay between embedding constrained planarity and hybri...
We study planar straight-line drawings of graphs that minimize the ratio...
A simple topological graph is k-quasiplanar (k≥ 2) if it contains no
k p...
We initiate the study of Simultaneous Graph Embedding with Fixed Edges i...
Given a planar graph G and an integer b, OrthogonalPlanarity is the
prob...
Hierarchical embedding constraints define a set of allowed cyclic orders...
Let G be a simple topological graph and let Γ be a polyline drawing
of G...
Motivated by hybrid graph representations, we introduce and study the
fo...
An ortho-polygon visibility representation Γ of a 1-plane graph G
(OPVR ...
We present a new model for hybrid planarity that relaxes existing hybrid...
A graph G is (k,p)-planar if its vertices can be partitioned into
cluste...
Graph Drawing Beyond Planarity is a rapidly growing research area that
c...
Let G be a planar 3-graph (i.e., a planar graph with vertex degree at
mo...
We prove that every set S of Δ slopes containing the
horizontal slope i...
We show that any outerplanar graph admits a planar straightline drawing ...
We show that any planar drawing of a forest of three stars whose vertice...
We study straight-line drawings of graphs where the vertices are placed ...