Jesús Leaños
Orcid: 0000-0002-3441-8136
According to our database1,
Jesús Leaños
authored at least 40 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2005
2010
2015
2020
0
1
2
3
4
5
6
3
5
3
3
1
4
3
1
2
3
3
1
3
3
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Discret. Math., March, 2024
Discret. Appl. Math., January, 2024
Ars Math. Contemp., 2024
2022
Discret. Math. Theor. Comput. Sci., 2022
On the connectivity of the disjointness graph of segments of point sets in general position in the plane.
Discret. Math. Theor. Comput. Sci., 2022
A note on the minimum number of red lines needed to pierce the intersections of blue lines.
Comput. Geom., 2022
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12.
Comb., 2022
2021
An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane.
Symmetry, 2021
2020
Discret. Math. Theor. Comput. Sci., 2020
2019
Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12.
CoRR, 2019
2018
Discret. Appl. Math., 2018
The Complexity of Computing the Cylindrical and the t-Circle Crossing Number of a Graph.
Electron. J. Comb., 2018
2017
2015
2013
Discret. Math. Theor. Comput. Sci., 2013
2012
Inf. Process. Lett., 2012
Discret. Comput. Geom., 2012
2011
Electron. Notes Discret. Math., 2011
Point sets that minimize (≤k)-edges, 3-decomposable drawings, and the rectilinear crossing number of K<sub>30</sub>.
Discret. Math., 2011
On $(\le k)$-edges, crossings, and halving lines of geometric drawings of K<sub>n</sub>
CoRR, 2011
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011
2010
Discret. Appl. Math., 2010
2008
An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of K<sub>n</sub>.
J. Comb. Theory A, 2008
Electron. Notes Discret. Math., 2008
The maximum number of halving lines and the rectilinear crossing number of K<sub>n</sub> for n.
Electron. Notes Discret. Math., 2008
2007
Electron. Notes Discret. Math., 2007
The convex hull of every optimal pseudolinear drawing of K<sub>n</sub> is a triangle.
Australas. J Comb., 2007
2003
Proceedings of the Combinatorial Geometry and Graph Theory, 2003