10 citations · 18 across the 12 of their papers we have counts for
6 papers · 1 filter
On the 2-colored crossing number
Oswin Aichholzer, Ruy Fabila-Monroy, Adrian Fuchs +4
Let be a straight-line drawing of a graph. The rectilinear 2-colored crossing number of is the minimum number of crossings between edges of the same color, taken over all p…
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The Musketeers
Hugo A. Akitaya, Esther M. Arkin, Mirela Damian +8
We present the first universal reconfiguration algorithm for transforming a modular robot between any two facet-connected square-grid configurations using pivot moves. More precise…
Inserting one edge into a simple drawing is hard
Alan Arroyo, Fabian Klute, Irene Parada +3
A {\em simple drawing} of a graph is one where each pair of edges share at most one point: either a common endpoint or a proper crossing. An edge in the complement o…
Extending Simple Drawings
Alan Arroyo, Martin Derka, Irene Parada
Simple drawings of graphs are those in which each pair of edges share at most one point, either a common endpoint or a proper crossing. In this paper we study the problem of extend…
Graphs with large total angular resolution
Oswin Aichholzer, Matias Korman, Yoshio Okamoto +4
The total angular resolution of a straight-line drawing is the minimum angle between two edges of the drawing. It combines two properties contributing to the readability of a drawi…
Minimal Representations of Order Types by Geometric Graphs
Oswin Aichholzer, Martin Balko, Michael Hoffmann +8
In order to have a compact visualization of the order type of a given point set S, we are interested in geometric graphs on S with few edges that unambiguously display the order ty…