default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJesús Leaños
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]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): 2 (2024)- [j36]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: 168-173 (2024) - [j35]Omar de Avila-Martínez, Jesús Leaños, Carolina Medina:
The 3-symmetric pseudolinear crossing number of K36. Discret. Math. 347(3): 113804 (2024) - 2022
- [j34]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): 701-728 (2022) - [j33]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: 101863 (2022) - [j32]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: 82-89 (2022) - [j31]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) - [j30]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) - 2021
- [j29]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: 101730 (2021) - [j28]Jesús Leaños, Christophe Ndjatchi:
The Edge-Connectivity of Token Graphs. Graphs Comb. 37(3): 1013-1023 (2021) - [j27]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): 1050 (2021) - 2020
- [j26]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: 387-403 (2020) - [j25]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) - [j24]Ludwin A. Basilio, Jair Simon, Jesús Leaños, Omar Rosario Cayetano:
The Differential on Graph Operator Q(G). Symmetry 12(5): 751 (2020)
2010 – 2019
- 2019
- [c3]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: 14:1-14:15 - [i4]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 abs/1903.05363 (2019) - 2018
- [j23]Drago Bokal, Jesús Leaños:
Characterizing all graphs with 2-exceptional edges. Ars Math. Contemp. 15(2): 383-406 (2018) - [j22]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): 2 (2018) - [j21]José Manuel 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: 327-340 (2018) - [j20]Jesús Leaños, Ana Laura Trujillo-Negrete:
The Connectivity of Token Graphs. Graphs Comb. 34(4): 777-790 (2018) - [i3]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 abs/1811.02455 (2018) - 2017
- [j19]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): 573-586 (2017) - [j18]César Hernández-Vélez, Jesús Leaños, Gelasio Salazar:
On the Pseudolinear Crossing Number. J. Graph Theory 84(3): 297-310 (2017) - [j17]Ludwin A. Basilio, Sergio Bermudo, Jesús Leaños, José María Sigarreta:
β-Differential of a Graph. Symmetry 9(10): 205 (2017) - 2015
- [j16]József Balogh, Jesús Leaños, Gelasio Salazar:
On the Decay of Crossing Numbers of Sparse Graphs. J. Graph Theory 80(3): 226-251 (2015) - 2013
- [j15]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): 93-100 (2013) - [j14]Drago Bokal, Markus Chimani, Jesús Leaños:
Crossing number additivity over edge cuts. Eur. J. Comb. 34(6): 1010-1018 (2013) - 2012
- [j13]Jesús Leaños, Rutilo Moreno, Luis Manuel Rivera-Martínez:
On the number of mth roots of permutations. Australas. J Comb. 52: 41-54 (2012) - [j12]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): 192-215 (2012) - [j11]Bernardo M. Ábrego, Mario Cetina, Jesús Leaños, Gelasio Salazar:
Visibility-preserving convexifications using single-vertex moves. Inf. Process. Lett. 112(5): 161-163 (2012) - 2011
- [j10]Mario Cetina, César Hernández-Vélez, Jesús Leaños, C. Villalobos:
Point sets that minimize (≤k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K30. Discret. Math. 311(16): 1646-1657 (2011) - [j9]Oswin Aichholzer, Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
There is a unique crossing-minimal rectilinear drawing of K18. Electron. Notes Discret. Math. 38: 547-552 (2011) - [c2]Oswin Aichholzer, Mario Cetina, Ruy Fabila Monroy, Jesús Leaños, Gelasio Salazar, Jorge Urrutia:
Convexifying Monotone Polygons while Maintaining Internal Visibility. EGC 2011: 98-108 - [i2]Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
On $(\le k)$-edges, crossings, and halving lines of geometric drawings of Kn. CoRR abs/1102.5065 (2011) - [i1]Bernardo M. Ábrego, Mario Cetina, Jesús Leaños, Gelasio Salazar:
Visibility-preserving convexifications using single-vertex moves. CoRR abs/1105.3435 (2011) - 2010
- [j8]Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
3-symmetric and 3-decomposable geometric drawings of Kn. Discret. Appl. Math. 158(12): 1240-1258 (2010)
2000 – 2009
- 2008
- [j7]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) - [j6]Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
The maximum number of halving lines and the rectilinear crossing number of Kn for n. Electron. Notes Discret. Math. 30: 261-266 (2008) - [j5]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: 273-278 (2008) - [j4]Bernardo M. Ábrego, József Balogh, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar:
An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn. J. Comb. Theory A 115(7): 1257-1264 (2008) - 2007
- [j3]József Balogh, Jesús Leaños, Shengjun Pan, R. Bruce Richter, Gelasio Salazar:
The convex hull of every optimal pseudolinear drawing of Kn is a triangle. Australas. J Comb. 38: 155-162 (2007) - [j2]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): 595-603 (2007) - [j1]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: 219-223 (2007) - 2003
- [c1]Jesús Leaños, Criel Merino, Gelasio Salazar, Jorge Urrutia:
Spanning Trees of Multicoloured Point Sets with Few Intersections. IJCCGGT 2003: 113-122
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
