9 citations · 20 across the 5 of their papers we have counts for
3 papers · 1 filter
The Complexity of Drawing Graphs on Few Lines and Few Planes
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp +3
It is well known that any graph admits a crossing-free straight-line drawing in and that any planar graph admits the same even in . For a graph and…
Minimum Rectilinear Polygons for Given Angle Sequences
William S. Evans, Krzysztof Fleszar, Philipp Kindermann +3
A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The num…
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
We study the classical NP-hard problems of finding maximum-size subsets from given sets of terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint p…