| On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of Kn BM Ábrego, M Cetina, S Fernández-Merchant, J Leaños, G Salazar Discrete & Computational Geometry 48 (1), 192-215, 2012 | 47 | 2012 |
| Regularity and planarity of token graphs W Carballosa, R Fabila-Monroy, J Leaños, LM Rivera Discussiones Mathematicae Graph Theory 37 (3), 573-586, 2017 | 39 | 2017 |
| 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 | 37 | 2010 |
| 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 | 31 | 2008 |
| The connectivity of token graphs J Leaños, AL Trujillo-Negrete Graphs and combinatorics 34, 777-790, 2018 | 29 | 2018 |
| 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 | 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 Abrego, J Balogh, S Fernández-Merchant, J Leaños, G Salazar Journal of Combinatorial Theory, Series A 115 (7), 1257-1264, 2008 | 21 | 2008 |
| The maximum number of halving lines and the rectilinear crossing number of Kn for n⩽ 27 BM Ábrego, S Fernández–Merchant, J Leanos, G Salazar Electronic Notes in Discrete Mathematics 30, 261-266, 2008 | 20 | 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 |
| 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 | 15 | 2011 |
| 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 |
| 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 | 14 | 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 | 13 | 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 | 12 | 2017 |
| 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 42 (5), 701-728, 2022 | 10 | 2022 |
| The edge-connectivity of token graphs J Leaños, C Ndjatchi Graphs and Combinatorics 37, 1013-1023, 2021 | 10 | 2021 |
| Independence and matching number for some token graphs H de Alba, W Carballosa, J Leaños, LM Rivera Martínez https://ajc. maths. uq. edu. au/, 2020 | 10 | 2020 |
| On the connectivity of token graphs of trees R Fabila-Monroy, J Leaños, AL Trujillo-Negrete Discrete Mathematics & Theoretical Computer Science 24 (Graph Theory), 2022 | 9 | 2022 |
| On the number of mth roots of permutations J Leanos, R Moreno, LM Rivera-Martínez arXiv preprint arXiv:1005.1531, 2010 | 9 | 2010 |
| Simple Euclidean arrangements with no (≥ 5)-gons J Leanos, M Lomeli, C Merino, G Salazar, J Urrutia Discrete & Computational Geometry 38, 595-603, 2007 | 9 | 2007 |
