
Towards a characterization of stretchable aligned graphs
We consider the problem of stretching pseudolines in a planar straightl...
read it

Geometric CrossingMinimization – A Scalable Randomized Approach
We consider the minimization of edgecrossings in geometric drawings of ...
read it

Drawing Clustered Graphs on Disk Arrangements
Let G=(V, E) be a planar graph and let C be a partition of V. We refer t...
read it

Multilevel Planarity
In this paper, we introduce and study the multilevelplanarity testing p...
read it

Inserting an Edge into a Geometric Embedding
The algorithm of Gutwenger et al. to insert an edge e in linear time int...
read it

A Greedy Heuristic for Crossing Angle Maximization
The crossing angle of a straightline drawing Γ of a graph G=(V, E) is t...
read it

Aligned Drawings of Planar Graphs
Let G be a graph topological embedded in the plane and let A be an arra...
read it
Marcel Radermacher
is this you? claim profile