H. González-Aguilar

collaborators

2 papers

cs.CG2019

Maximum rectilinear convex subsets

Hernán González-Aguilar, David Orden, Pablo Pérez-Lantero +4

Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erdős-Szekeres problem, presenting efficient algorithms with $O (n^{3})$ running time and $O(n^2)…

math.CO2017

The complexity of computing the cylindrical and the $t$ -circle crossing number of a graph

Frank Duque, Hernán González-Aguilar, César Hernández-Vélez +2

A plane drawing of a graph is {\em cylindrical} if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoint…

Maximum rectilinear convex subsets

The complexity of computing the cylindrical and the t-circle crossing number of a graph

The complexity of computing the cylindrical and the $t$ -circle crossing number of a graph