1 citations · 1 across the 8 of their papers we have counts for
7 papers · 1 filter
On the -Bend Slope Number of -Planar Graphs
Michael A. Bekos, Eleni Katsanou, Philipp Kindermann +3
While drawing planar graphs with few slopes and few bends is a well-studied problem, corresponding extensions to beyond-planar graphs still remain mostly unexplored. Motivated by t…
On Solving Simple Curved Nonograms
Maarten Löffler, Günter Rote, Soeren Terziadis +1
Nonograms are a popular type of puzzle, where an arrangement of curves in the plane (in the classic version, a rectangular grid) is given together with a series of hints, indicatin…
Saturated Drawings of Geometric Thickness k
Patricia Bachmann, Anna Brötzner, Miriam Goetze +3
We investigate saturated geometric drawings of graphs with geometric thickness , where no edge can be added without increasing . We establish lower and upper bounds on the nu…
Boundary Labeling in a Circular Orbit
Annika Bonerath, Martin Nöllenburg, Soeren Terziadis +2
Boundary labeling is a well-known method for displaying short textual labels for a set of point features in a figure alongside the boundary of that figure. Labels and their corresp…
Constrained Boundary Labeling
Thomas Depian, Martin Nöllenburg, Soeren Terziadis +1
Boundary labeling is a technique in computational geometry used to label sets of features in an illustration. It involves placing labels along an axis-parallel bounding box and con…
Geometric Thickness of Multigraphs is -complete
Henry Förster, Philipp Kindermann, Tillmann Miltzow +3
We say that a (multi)graph has geometric thickness if there exists a straight-line drawing and a -coloring of its edges where no…
Minimum Link Fencing
Sujoy Bhore, Fabian Klute, Maarten Löffler +3
We study a variant of the geometric multicut problem, where we are given a set of colored and pairwise interior-disjoint polygons in the plane. The objective is to co…