We introduce and study the 1-planar packing problem: Given k graphs with...
A measure for the visual complexity of a straight-line crossing-free dra...
Let G be a simple topological graph and let Γ be a polyline drawing
of G...
We present a number of breakthroughs for coordinated motion planning, in...
share