H. González-Aguilar

activity

20122019

most citedOn

k

-Gons and

k

-Holes in Point Sets

3 citations · 5 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

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…

math.CO2012

On the Connectedness and Diameter of a Geometric Johnson Graph

Crevel Bautista-Santiago, Javier Cano, Ruy Fabila-Monroy +5

Let $P$ be a set of $n$ points in general position in the plane. A subset $I$ of $P$ is called an \emph{island} if there exists a convex set $C$ such that $I = P \cap C$ . In this p…

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

On the Connectedness and Diameter of a Geometric Johnson Graph

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