182 citations · 549 across the 43 of their papers we have counts for
Showing 2015 · cs.CGShow all
3 papers · 2 filters
cs.CG2015★ 8 cited
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +4
Given a planar graph and a partition of the neighbors of each vertex in four sets , , , and , the problem Windrose Planarity asks to decide whet…
cs.CG2015★ 1 cited
Saturated simple and 2-simple topological graphs with few edges
Péter Hajnal, Alexander Igamberdiev, Günter Rote +1
A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally,…
cs.CG2015★ 5 cited
Point sets with many non-crossing matchings
Andrei Asinowski, Günter Rote
The maximum number of non-crossing straight-line perfect matchings that a set of points in the plane can have is known to be and . The lower bound, due…