Point sets that minimize (≤k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K30. - Mario Cetina; César Hernández-Vélez; Jesús Leaños; C. Villalobos (Discret. Math., 2011)

Nested cycles in large triangulations and crossing-critical graphs. - César Hernández-Vélez; Gelasio Salazar; Robin Thomas 001 (J. Comb. Theory B, 2012)

Making a Graph Crossing-Critical by Multiplying its Edges. - Laurent Beaudou; César Hernández-Vélez; Gelasio Salazar (Electron. J. Comb., 2013)

The Optimal Drawings of $K_{5, n}$. - César Hernández-Vélez; Carolina Medina; Gelasio Salazar (Electron. J. Comb., 2014)

Spanning trees with nonseparating paths. - Cristina G. Fernandes; César Hernández-Vélez; Orlando Lee; José Coelho de Pina (Discret. Math., 2016)

On the Pseudolinear Crossing Number. - César Hernández-Vélez; Jesús Leaños; Gelasio Salazar (J. Graph Theory, 2017)

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; Jesús Leaños; Carolina Medina (Electron. J. Comb., 2018)

Counting Hamiltonian Cycles in the Matroid Basis Graph. - Cristina G. Fernandes; César Hernández-Vélez; José Coelho de Pina; Jorge Luis Ramírez Alfonsín (Graphs Comb., 2019)

Counting the number of crossings in geometric graphs. - Frank Duque; Ruy Fabila Monroy; César Hernández-Vélez; Carlos Hidalgo-Toscano (Inf. Process. Lett., 2021)