7 citations · 19 across the 9 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.CG2021
The Complexity of the Hausdorff Distance
Paul Jungeblut, Linda Kleist, Tillmann Miltzow
We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algeb…
math.CO2021★ 6 cited
A Sublinear Bound on the Page Number of Upward Planar Graphs
Paul Jungeblut, Laura Merker, Torsten Ueckerdt
The page number of a directed acyclic graph is the minimum for which there is a topological ordering of and a -coloring of the edges such that no two edges of the sa…