We study crossing-free grid morphs for planar tree drawings using 3D. A ...
We study whether a given graph can be realized as an adjacency graph of ...
We study upward planar straight-line embeddings (UPSE) of directed trees...
We give a complete description of all convex polyhedra whose surface can...
A data structure is presented that explicitly maintains the graph of a
V...
Let P and Q be finite point sets of the same cardinality in
ℝ^2, each la...
Which convex 3D polyhedra can be obtained by gluing several regular hexa...
We study the question whether a crossing-free 3D morph between two
strai...