Jesús Leaños

VLDB 2026 Research / reviewers in the wild / expert

dblp:08/3111 · DBLP profile ↗

← Back

12ranked-venue papers

2as first author

6since 2021 · last 2026

0000-0002-3441-8136ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 8 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1

Year	Publication	Venue	Position
2026	Distribution of the null coefficients of the differential polynomial of the tree graphs J. J. García-Dávila, Jesús Leaños, J. M. Pacheco-Torres	Discret. Appl. Math.	2
2026	On the differential of the graph operator S k ( G ) J. J. García-Dávila, Jesús Leaños, J. M. Pacheco-Torres, Mario Lomelí-Haro	Discret. Appl. Math.	2
2024	Disjointness graphs of segments in R2 are almost all hamiltonian Jesús Leaños, Mbe Koua Christophe Ndjatchi, Luis Manuel Ríos-Castro	Discret. Appl. Math.	1
2022	A note on the minimum number of red lines needed to pierce the intersections of blue lines Mario Huicochea, Jesús Leaños, Luis Manuel Rivera-Martínez	Comput. Geom.	2
2022	The differential of the line graph L(G) Ludwin A. Basilio, Sergio Bermudo, Jesús Leaños, José María Sigarreta	Discret. Appl. Math.	3
2021	On the number of order types in integer grids of small size Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Jesús Leaños, Amanda Montejano	Comput. Geom.	5
2019	Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12 abstract We study $c$-crossing-critical graphs, which are the minimal graphs that require at least $c$ edge-crossings when drawn in the plane. For every fixed pair of integers with $c\ge 13$ and $d\ge 1$, we give first explicit constructions of $c$-crossing-critical graphs containing a vertex of degree greater than $d$. We also show that such unbounded degree constructions do not exist for $c\le 12$, precisely, that there exists a constant $D$ such that every $c$-crossing-critical graph with $c\le 12$ has maximum degree at most $D$. Hence, the bounded maximum degree conjecture of $c$-crossing-critical graphs, which was generally disproved in 2010 by Dvořák and Mohar (without an explicit construction), holds true, surprisingly, exactly for the values $c\le 12.$ Drago Bokal, Zdenek Dvorák 0001, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera	SoCG	4
2018	The packing number of the double vertex graph of the path graph José Manuel Gómez Soto, Jesús Leaños, Luis Manuel Ríos-Castro, Luis Manuel Rivera-Martínez	Discret. Appl. Math.	2
2012	On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar	Discret. Comput. Geom.	4
2012	Visibility-preserving convexifications using single-vertex moves Bernardo M. Ábrego, Mario Cetina, Jesús Leaños, Gelasio Salazar	Inf. Process. Lett.	3
2010	3-symmetric and 3-decomposable geometric drawings of Kn Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar	Discret. Appl. Math.	4
2007	Simple Euclidean Arrangements with No (>= 5)-Gons Jesús Leaños, Mario Lomelí-Haro, Criel Merino, Gelasio Salazar, Jorge Urrutia	Discret. Comput. Geom.	1