7 citations · 19 across the 9 of their papers we have counts for
4 papers · 1 filter
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…
Cops and Robber -- When Capturing is not Surrounding
Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt
We consider "surrounding" versions of the classic Cops and Robber game. The game is played on a connected graph in which two players, one controlling a number of cops and the other…
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 -…
Primal-Dual Cops and Robber
Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt +1
Cops and Robber is a family of two-player games played on graphs in which one player controls a number of cops and the other player controls a robber. In alternating turns, each pl…