An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
Information visualisation systems which generate diagrams representing discrete relational information must consider potential users if they are to be effective. Many algorithms w...
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Two and a half dimensional graph visualisation is the stacking of a set of related graphs into the third dimension to support visual comparison. A new aesthetic criterion is intro...