7 citations · 19 across the 9 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2023★ 1 cited
On the Complexity of Lombardi Graph Drawing
Paul Jungeblut
In a Lombardi drawing of a graph the vertices are drawn as points and the edges are drawn as circular arcs connecting their respective endpoints. Additionally, all vertices have pe…
cs.CG2023★ 1 cited
Recognizing Unit Disk Graphs in Hyperbolic Geometry is -Complete
Nicholas Bieker, Thomas Bläsius, Emil Dohse +1
A graph G is a (Euclidean) unit disk graph if it is the intersection graph of unit disks in the Euclidean plane . Recognizing them is known to be -…
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…