Vertex splitting replaces a vertex by two copies and partitions its inci...
The page-number of a directed acyclic graph (a DAG, for short) is the mi...
Strictly-convex straight-line drawings of 3-connected planar graphs in
s...
A map graph is a graph admitting a representation in which vertices are
...
We continue the study of the area requirement of convex straight-line gr...
A linear layout of a graph typically consists of a total vertex order, a...
A k-queue layout is a special type of a linear layout, in which the line...
We investigate the queue number of posets in terms of their width, that ...
An interesting class of orthogonal representations consists of the so-ca...
Motivated by the fact that in a space where shortest paths are unique, n...
We study the algorithmic problem of computing drawings of graphs in whic...
An embedding of a graph in a book, called book embedding, consists of a
...
A queue layout of a graph consists of a linear order of its vertices and...
A queue layout of a graph G consists of a linear order of the vertices o...
In the classical Steiner tree problem, one is given an undirected, conne...
In a dispersable book embedding, the vertices of a given graph G must be...