We show an O(n)-time reduction from the problem of testing whether a
mul...
In this paper, we investigate crossing-free 3D morphs between planar
str...
A rectangular drawing of a planar graph G is a planar drawing of G in
wh...
The page-number of a directed acyclic graph (a DAG, for short) is the mi...
We present an O(n^2)-time algorithm to test whether an n-vertex directed...
We obtain new parameterized algorithms for the classical problem of
dete...
We study a classic problem introduced thirty years ago by Eades and Worm...
The algorithm of Tutte for constructing convex planar straight-line draw...
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...
We introduce and study the problem of constructing geometric graphs that...
We show how to test in linear time whether an outerplanar graph admits a...
In this paper we study the area requirements of planar greedy drawings o...
We study the problem of embedding graphs in the plane as good geometric
...
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...
The edge-length ratio of a straight-line drawing of a graph is the ratio...
In this paper, we study the area requirements of planar straight-line
or...
In this paper we study the computational complexity of the Upward Planar...
We prove that, given two topologically-equivalent upward planar straight...
We study the question whether a crossing-free 3D morph between two
strai...
This is the arXiv index for the electronic proceedings of the 25th
Inter...