A pair ⟨ G_0, G_1 ⟩ of graphs admits a mutual witness proximity
drawing ...
Let Γ be a straight-line drawing of a graph and let u and v be two
verti...
Motivated by dynamic graph visualization, we study the problem of
repres...
We present a new model for hybrid planarity that relaxes existing hybrid...
A graph G is (k,p)-planar if its vertices can be partitioned into
cluste...