
On CrossingFamilies in Planar Point Sets
A kcrossing family in a point set S in general position is a set of k s...
read it

Hardness of Token Swapping on Trees
Given a graph where every vertex has exactly one labeled token, how can ...
read it

On Compatible Matchings
A matching is compatible to two or more labeled point sets of size n wit...
read it

Plane Spanning Trees in EdgeColored Simple Drawings of K_n
Károlyi, Pach, and Tóth proved that every 2edgecolored straightline d...
read it

Drawing Graphs as Spanners
We study the problem of embedding graphs in the plane as good geometric ...
read it

Folding Polyominoes with Holes into a Cube
When can a polyomino piece of paper be folded into a unit cube? Prior wo...
read it

Graphs with large total angular resolution
The total angular resolution of a straightline drawing is the minimum a...
read it

On the 2colored crossing number
Let D be a straightline drawing of a graph. The rectilinear 2colored c...
read it

Minimal Representations of Order Types by Geometric Graphs
In order to have a compact visualization of the order type of a given po...
read it

An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants
A drawing of a graph in the plane is pseudolinear if the edges of the d...
read it

Flip distances between graph orientations
Flip graphs are a ubiquitous class of graphs, which encode relations ind...
read it

Folding Polyominoes into (Poly)Cubes
We study the problem of folding a polyomino P into a polycube Q, allowin...
read it

Geodesic Order Types
The geodesic between two points a and b in the interior of a simple poly...
read it

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs
We consider the following question: How many edgedisjoint plane spannin...
read it
Oswin Aichholzer
is this you? claim profile