
Arrangements of orthogonal circles with many intersections
An arrangement of circles in which circles intersect only in angles of π...
read it

Adjacency Graphs of Polyhedral Surfaces
We study whether a given graph can be realized as an adjacency graph of ...
read it

Augmenting Geometric Graphs with Matchings
We study noncrossing geometric graphs and their disjoint compatible geom...
read it

The Partition Spanning Forest Problem
Given a set of colored points in the plane, we ask if there exists a cro...
read it

Drawing Subcubic 1Planar Graphs with Few Bends, Few Slopes, and Large Angles
We show that the 1planar slope number of 3connected cubic 1planar gra...
read it

Lombardi Drawings of Knots and Links
Knot and link diagrams are projections of one or more 3dimensional simp...
read it

Experimental analysis of the accessibility of drawings with few segments
The visual complexity of a graph drawing is defined as the number of geo...
read it
André Schulz
is this you? claim profile