20 citations · 134 across the 54 of their papers we have counts for
75 papers
Perfect Rectangular Tilings with Two Colors
Oswin Aichholzer, Robert Ganian, Phillip Keldenich +5
We study a finite tiling problem, where tiles are unit squares whose four edges are colored with one of two colors. We ask whether a given rectangle admits a perfect rectangular ti…
Theoretical analysis of beaconless geocast protocols in 1D
Joachim Gudmundsson, Irina Kostitsyna, Maarten Löffler +3
Beaconless geocast protocols are routing protocols used to send messages in mobile ad-hoc wireless networks, in which the only information available to each node is its own locatio…
One-Sided Local Crossing Minimization
Panos Giannopoulos, Miriam Goetze, Grzegorz Gutowski +6
Drawing graphs with the minimum number of crossings is a classical problem that has been studied extensively. Many restricted versions of the problem have been considered. For exam…
Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4
Maarten Löffler, Tamara Mchedlidze, David Orden +2
A pseudo-triangle is a simple polygon with exactly three convex vertices, and all other vertices (if any) are distributed on three concave chains. A pseudo-triangulation~$\mathcal{…
Shortest Paths in Portalgons
Maarten Löffler, Tim Ophelders, Frank Staals +1
Any surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragmen…
Blocking Delaunay Triangulations from the Exterior
Oswin Aichholzer, Thomas Hackl, Maarten Löffler +4
Given two distinct point sets and in the plane, we say that \emph{blocks} if no two points of are adjacent in any Delaunay triangulation of . Aichholze…