20 citations · 31 across the 10 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CG2013★ 4 cited
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
Marcus Schaefer
Given a graph and a subset of its edges, is there a drawing of in which all edges of are free of crossings? We show that this question can be solved…
cs.CG2013★ 20 cited
Multi-Sided Boundary Labeling
Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter +3
In the Boundary Labeling problem, we are given a set of points, referred to as sites, inside an axis-parallel rectangle , and a set of pairwise disjoint rectangular labe…