23 citations · 158 across the 42 of their papers we have counts for
7 papers · 1 filter
Angle Covers: Algorithms and Complexity
William Evans, Ellen Gethner, Jack Spalding-Jamieson +1
Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of cons…
Variants of the Segment Number of a Graph
Yoshio Okamoto, Alexander Ravsky, Alexander Wolff
The \emph{segment number} of a planar graph is the smallest number of line segments whose union represents a crossing-free straight-line drawing of the given graph in the plane. Th…
On Arrangements of Orthogonal Circles
Steven Chaplick, Henry Förster, Myroslav Kryven +1
In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where every pair of circles must either be disjoint or intersect at a right angle. Usin…
Line and Plane Cover Numbers Revisited
Therese Biedl, Stefan Felsner, Henk Meijer +1
A measure for the visual complexity of a straight-line crossing-free drawing of a graph is the minimum number of lines needed to cover all vertices. For a given graph , the mini…
Representing Graphs and Hypergraphs by Touching Polygons in 3D
William Evans, Paweł Rzążewski, Noushin Saeedi +2
Contact representations of graphs have a long history. Most research has focused on problems in 2D, but 3D contact representations have also been investigated, mostly concerning fu…
Recognizing Stick Graphs with and without Length Constraints
Steven Chaplick, Philipp Kindermann, Andre Löffler +4
Stick graphs are intersection graphs of horizontal and vertical line segments that all touch a line of slope -1 and lie above this line. De Luca et al. [GD'18] considered the recog…