Jesús Leaños

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 24

Top Topics

Bounded Treewidth

Top Venues

Discret. Appl. Math.

Discret. Math. Theor. Comput. Sci.

Publications

Bernardo M. Ábrego, Silvia Fernández-Merchant, Oswin Aichholzer, Jesús Leaños, Gelasio Salazar
There is a unique crossing-minimal rectilinear drawing of K_18. Ars Math. Contemp. 24 (2) (2024)
Omar de Avila-Martínez, Jesús Leaños, Carolina Medina
. Discret. Math. 347 (3) (2024)
Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro
Disjointness graphs of segments in R2 are almost all hamiltonian. Discret. Appl. Math. 342 (2024)
Ruy Fabila Monroy, Jesús Leaños, Ana Laura Trujillo-Negrete
On the Connectivity of Token Graphs of Trees. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Mario Huicochea, Jesús Leaños, Luis Manuel Rivera
A note on the minimum number of red lines needed to pierce the intersections of blue lines. Comput. Geom. 104 (2022)
Ludwin A. Basilio, Sergio Bermudo, Jesús Leaños, José María Sigarreta
The differential of the line graph L(G). Discret. Appl. Math. 321 (2022)
Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro
On the connectivity of the disjointness graph of segments of point sets in general position in the plane. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12. Comb. 42 (5) (2022)
Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Amanda Montejano
On the number of order types in integer grids of small size. Comput. Geom. 95 (2021)
Jesús Leaños, Christophe Ndjatchi
The Edge-Connectivity of Token Graphs. Graphs Comb. 37 (3) (2021)
Aurora Espinoza-Valdez, Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro
An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane. Symmetry 13 (6) (2021)
Hernán de Alba, Walter Carballosa, Jesús Leaños, Luis Manuel Rivera
Independence and matching numbers of some token graphs. Australas. J Comb. 76 (2020)
Ludwin A. Basilio, Jair Simon, Jesús Leaños, Omar Rosario Cayetano
The Differential on Graph Operator Q(G). Symmetry 12 (5) (2020)
Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Mario Lomelí-Haro
The Chromatic Number of the Disjointness Graph of the Double Chain. Discret. Math. Theor. Comput. Sci. 22 (1) (2020)
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. SoCG (2019)
Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera
Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12. CoRR (2019)
Jesús Leaños, Ana Laura Trujillo-Negrete
The Connectivity of Token Graphs. Graphs Comb. 34 (4) (2018)
Frank Duque, Hernán González-Aguilar, César Hernández-Vélez, Jesús Leaños, Carolina Medina
The Complexity of Computing the Cylindrical and the t-Circle Crossing Number of a Graph. Electron. J. Comb. 25 (2) (2018)
Drago Bokal, Jesús Leaños
Characterizing all graphs with 2-exceptional edges. Ars Math. Contemp. 15 (2) (2018)
Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Amanda Montejano
On the Number of Order Types in Integer Grids of Small Size. CoRR (2018)
J. M. Gómez Soto, Jesús Leaños, Luis Manuel Ríos-Castro, Luis Manuel Rivera
The packing number of the double vertex graph of the path graph. Discret. Appl. Math. 247 (2018)
Walter Carballosa, Ruy Fabila Monroy, Jesús Leaños, Luis Manuel Rivera-Martínez
Regularity and planarity of token graphs. Discuss. Math. Graph Theory 37 (3) (2017)
Ludwin A. Basilio, Sergio Bermudo, Jesús Leaños, José María Sigarreta
-Differential of a Graph. Symmetry 9 (10) (2017)
César Hernández-Vélez, Jesús Leaños, Gelasio Salazar
On the Pseudolinear Crossing Number. J. Graph Theory 84 (3) (2017)
József Balogh, Jesús Leaños, Gelasio Salazar
On the Decay of Crossing Numbers of Sparse Graphs. J. Graph Theory 80 (3) (2015)
Drago Bokal, Markus Chimani, Jesús Leaños
Crossing number additivity over edge cuts. Eur. J. Comb. 34 (6) (2013)
Ruy Fabila Monroy, Luis Felipe Barba Flores, Dolores Lara, Jesús Leaños, Cynthia A. Rodríguez Villalobos, Gelasio Salazar, Francisco Zaragoza
The Erdős-Sós Conjecture for Geometric Graphs. Discret. Math. Theor. Comput. Sci. 15 (1) (2013)
Jesús Leaños, Rutilo Moreno, Luis Manuel Rivera-Martínez
th roots of permutations. Australas. J Comb. 52 (2012)
Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n. Discret. Comput. Geom. 48 (1) (2012)
Bernardo M. Ábrego, Mario Cetina, Jesús Leaños, Gelasio Salazar
Visibility-preserving convexifications using single-vertex moves. Inf. Process. Lett. 112 (5) (2012)
Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
CoRR (2011)
Oswin Aichholzer, Mario Cetina, Ruy Fabila Monroy, Jesús Leaños, Gelasio Salazar, Jorge Urrutia
Convexifying Monotone Polygons while Maintaining Internal Visibility. EGC (2011)
Bernardo M. Ábrego, Mario Cetina, Jesús Leaños, Gelasio Salazar
Visibility-preserving convexifications using single-vertex moves CoRR (2011)
Mario Cetina, César Hernández-Vélez, Jesús Leaños, C. Villalobos
. Discret. Math. 311 (16) (2011)
Oswin Aichholzer, Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
. Electron. Notes Discret. Math. 38 (2011)
Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
. Discret. Appl. Math. 158 (12) (2010)
Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
A central approach to bound the number of crossings in a generalized configuration. Electron. Notes Discret. Math. 30 (2008)
Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
for n. Electron. Notes Discret. Math. 30 (2008)
Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar
The Crossing Number of a Projective Graph is Quadratic in the Face-Width. Electron. J. Comb. 15 (1) (2008)
Bernardo M. Ábrego, József Balogh, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
. J. Comb. Theory, Ser. A 115 (7) (2008)
Jesús Leaños, Mario Lomelí-Haro, Criel Merino, Gelasio Salazar, Jorge Urrutia
Simple Euclidean Arrangements with No (>= 5)-Gons. Discret. Comput. Geom. 38 (3) (2007)
Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar
The crossing number of a projective graph is quadratic in the face-width. Electron. Notes Discret. Math. 29 (2007)
József Balogh, Jesús Leaños, Shengjun Pan, R. Bruce Richter, Gelasio Salazar
is a triangle. Australas. J Comb. 38 (2007)
Jesús Leaños, Criel Merino, Gelasio Salazar, Jorge Urrutia
Spanning Trees of Multicoloured Point Sets with Few Intersections. IJCCGGT (2003)