Many data sets, crucial for today's applications, consist essentially of...
A rectangular drawing of a planar graph G is a planar drawing of G in
wh...
In a graph story the vertices enter a graph one at a time and each verte...
The problem of orienting the edges of an undirected graph such that the
...
We study a classic problem introduced thirty years ago by Eades and Worm...
Given a bipartite graph G=(V_b,V_r,E), the 2-Level Quasi-Planarity
probl...
Suppose that a biconnected graph is given, consisting of a large compone...
This paper presents an empirical study of the relationship between the
d...
An interesting class of orthogonal representations consists of the so-ca...
A planar orthogonal drawing Γ of a planar graph G is a geometric
represe...
In this paper we study planar morphs between straight-line planar grid
d...
We study the problem of drawing a dynamic graph, where each vertex appea...
We initiate the study of Simultaneous Graph Embedding with Fixed Edges i...
We study k-page upward book embeddings (kUBEs) of st-graphs, that is,
bo...
In this paper, we study the area requirements of planar straight-line
or...
We prove that, given two topologically-equivalent upward planar straight...
The complexity of deciding whether a clustered graph admits a clustered
...
Let G be a planar 3-graph (i.e., a planar graph with vertex degree at
mo...
We introduce a hybrid metaphor for the visualization of the reconciliati...
We study planar drawings of directed graphs in the L-drawing standard. W...