182 citations · 549 across the 43 of their papers we have counts for
5 papers · 1 filter
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs
Boris Klemz, Günter Rote
A bipartite graph is convex if the vertices in can be linearly ordered such that for each vertex , the neighbors of are consecutive in the ordering of $…
Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity
Boris Klemz, Günter Rote
We introduce and study the problem Ordered Level Planarity which asks for a planar drawing of a graph such that vertices are placed at prescribed positions in the plane and such th…
Area difference bounds for dissections of a square into an odd number of triangles
Jean-Philippe Labbé, Günter Rote, Günter M. Ziegler
Monsky's theorem from 1970 states that a square cannot be dissected into an odd number of triangles of the same area, but it does not give a lower bound for the area differences th…
Convex equipartitions of colored point sets
Pavle V. M. Blagojević, Günter Rote, Johanna K. Steinmeyer +1
We show that any -colored set of points in general position in can be partitioned into subsets with disjoint convex hulls such that the set of points and all…
Packing Short Plane Spanning Graphs in Complete Geometric Graphs
Oswin Aichholzer, Thomas Hackl, Matias Korman +5
Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want t…