12 citations · 38 across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017★ 12 cited
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 $…
cs.CG2017★ 10 cited
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…