On≤ k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n BM Ábrego, M Cetina, S Fernández-Merchant, J Leaños, G Salazar Discrete & Computational Geometry 48 (1), 192-215, 2012 | 40 | 2012 |

3-symmetric and 3-decomposable geometric drawings of Kn BM Ábrego, M Cetina, S Fernández-Merchant, J Leaños, G Salazar Discrete Applied Mathematics 158 (12), 1240-1258, 2010 | 33 | 2010 |

Regularity and planarity of token graphs W Carballosa, R Fabila-Monroy, J Leaños, LM Rivera arXiv preprint arXiv:1510.00424, 2015 | 31 | 2015 |

A central approach to bound the number of crossings in a generalized configuration BM Ábrego, S Fernández–Merchant, J Leanos, G Salazar Electronic Notes in Discrete Mathematics 30, 273-278, 2008 | 29 | 2008 |

The connectivity of token graphs J Leaños, AL Trujillo-Negrete Graphs and combinatorics 34 (4), 777-790, 2018 | 23 | 2018 |

An extended lower bound on the number of (⩽ k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn BM Ábrego, J Balogh, S Fernández-Merchant, J Leaños, G Salazar Journal of Combinatorial Theory, Series A 115 (7), 1257-1264, 2008 | 20 | 2008 |

The packing number of the double vertex graph of the path graph JMG Soto, J Leaños, LM Ríos-Castro, LM Rivera Discrete Applied Mathematics 247, 327-340, 2018 | 18 | 2018 |

The maximum number of halving lines and the rectilinear crossing number of Kn for n⩽ 27 BM Abrego, S Fernández–Merchant, J Leanos, G Salazar Electronic Notes in Discrete Mathematics 30, 261-266, 2008 | 18 | 2008 |

The crossing number of a projective graph is quadratic in the face–width I Gitler, P Hliněný, J Leanos, G Salazar Electronic Notes in Discrete Mathematics 29, 219-223, 2007 | 16 | 2007 |

The convex hull of every optimal pseudolinear drawing of K~ n is a triangle J Balogh, J Leanos, S Pan, RB Richter, G Salazar Australasian Journal of Combinatorics 38, 155, 2007 | 15 | 2007 |

Point sets that minimize (≤ k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K30 M Cetina, C Hernández-Vélez, J Leaños, C Villalobos Discrete mathematics 311 (16), 1646-1657, 2011 | 13 | 2011 |

On the additivity of crossing numbers of graphs J Leaños, G Salazar Journal of Knot Theory and its Ramifications 17 (09), 1043-1050, 2008 | 13 | 2008 |

The crossing number of a projective graph is quadratic in the face–width I Gitler, P Hliněný, J Leaños, G Salazar the electronic journal of combinatorics, R46-R46, 2008 | 12 | 2008 |

On the pseudolinear crossing number C Hernández‐Vélez, J Leaños, G Salazar Journal of Graph Theory 84 (3), 297-310, 2017 | 11 | 2017 |

Simple Euclidean arrangements with no (≥ 5)-gons J Leanos, M Lomeli, C Merino, G Salazar, J Urrutia Discrete & Computational Geometry 38 (3), 595-603, 2007 | 10 | 2007 |

Bounded degree conjecture holds precisely for c-crossing-critical graphs with c≤ 12 D Bokal, Z Dvořák, P Hlinĕný, J Leaños, B Mohar, T Wiedera Combinatorica, 1-28, 2022 | 8 | 2022 |

*β*-Differential of a GraphLA Basilio, S Bermudo, J Leaños, JM Sigarreta Symmetry 9 (10), 205, 2017 | 8 | 2017 |

The edge-connectivity of token graphs J Leaños, C Ndjatchi Graphs and Combinatorics 37 (3), 1013-1023, 2021 | 7 | 2021 |

The complexity of computing the cylindrical and the -circle crossing number of a graph F Duque, H González-Aguilar, C Hernández-Vélez, J Leaños, C Medina arXiv preprint arXiv:1708.01942, 2017 | 7 | 2017 |

On the number of mth roots of permutations. J Leanos, R Moreno, LM Rivera-Martínez Australas. J Comb. 52, 41-54, 2012 | 7 | 2012 |