16 citations · 106 across the 45 of their papers we have counts for
3 papers · 1 filter
The Complexity of Finding Tangles
Oksana Firman, Philipp Kindermann, Boris Klemz +3
We study the following combinatorial problem. Given a set of y-monotone curves, which we call wires, a tangle determines the order of the wires on a number of horizontal layers…
Computing Height-Optimal Tangles Faster
Oksana Firman, Philipp Kindermann, Alexander Ravsky +2
We study the following combinatorial problem. Given a set of y-monotone wires, a tangle determines the order of the wires on a number of horizontal layers such that the orders…
Untangling planar graphs from a specified vertex position - Hard cases
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky +2
Given a planar graph , we consider drawings of in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by…