On the crossing number of cm × cn. - Gelasio Salazar (J. Graph Theory, 1998)

Drawings of Cm×Cn with One Disjoint Family. - Gelasio Salazar (J. Comb. Theory B, 1999)

On the Intersections of Systems of Curves. - Gelasio Salazar (J. Comb. Theory B, 1999)

On a Crossing Number Result of Richter and Thomassen. - Gelasio Salazar (J. Comb. Theory B, 2000)

A lower bound for the crossing number of Cm × Cn. - Gelasio Salazar (J. Graph Theory, 2000)

The crossing number of C6 × Cn. - R. Bruce Richter; Gelasio Salazar (Australas. J Comb., 2001)

Drawings of Cm?Cn with One Disjoint Family II. - Hector A. Juarez; Gelasio Salazar (J. Comb. Theory B, 2001)

Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree. - Enrique García-Moreno; Gelasio Salazar (J. Graph Theory, 2001)

The Crossing Number of P(N, 3). - R. Bruce Richter; Gelasio Salazar (Graphs Comb., 2002)

Spanning Trees of Multicoloured Point Sets with Few Intersections. - Jesús Leaños; Criel Merino; Gelasio Salazar; Jorge Urrutia (IJCCGGT, 2003)

Infinite families of crossing-critical graphs with given average degree. - Gelasio Salazar (Discret. Math., 2003)

Small meshes of curves and their role in the analysis of optimal meshes. - Gelasio Salazar (Discret. Math., 2003)

Optimal meshes of curves in the Klein bottle. - Hector A. Juarez; Gelasio Salazar (J. Comb. Theory B, 2003)

Improved Bounds for the Number of (<=k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn. - József Balogh; Gelasio Salazar (GD, 2004)

Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks. - Paul Boone; Edgar Chávez; Lev Gleitzky; Evangelos Kranakis; Jaroslav Opatrny; Gelasio Salazar; Jorge Urrutia (SIROCCO, 2004)

Embedding grids in surfaces. - James F. Geelen; R. Bruce Richter; Gelasio Salazar (Eur. J. Comb., 2004)

An Improved Bound for the Crossing Number of C mC n: a Self-Contained Proof Using Mostly Combinatorial Arguments. - Gelasio Salazar; Edgardo Ugalde (Graphs Comb., 2004)

The crossing number of Cm × Cn is as conjectured for n >= m(m + 1). - Lev Yu. Glebsky; Gelasio Salazar (J. Graph Theory, 2004)

On the crossing numbers of loop networks and generalized Petersen graphs. - Gelasio Salazar (Discret. Math., 2005)

On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets. - Criel Merino; Gelasio Salazar; Jorge Urrutia (Graphs Comb., 2005)

Two maps with large representativity on one surface. - R. Bruce Richter; Gelasio Salazar (J. Graph Theory, 2005)

On the Crossing Number of Almost Planar Graphs. - Petr Hlinený; Gelasio Salazar (GD, 2006)

k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn. - József Balogh; Gelasio Salazar (Discret. Comput. Geom., 2006)

On the length of longest alternating paths for multicoloured point sets in convex position. - Criel Merino; Gelasio Salazar; Jorge Urrutia (Discret. Math., 2006)

Nearly light cycles in embedded graphs and crossing-critical graphs. - Mario Lomelí-Haro; Gelasio Salazar (J. Graph Theory, 2006)

Improved Bounds for the Crossing Numbers of Km, n and Kn. - Etienne de Klerk; John Maharry; Dmitrii V. Pasechnik; R. Bruce Richter; Gelasio Salazar (SIAM J. Discret. Math., 2006)

Approximating the Crossing Number of Toroidal Graphs. - Petr Hlinený; Gelasio Salazar (ISAAC, 2007)

The convex hull of every optimal pseudolinear drawing of Kn is a triangle. - József Balogh; Jesús Leaños; Shengjun Pan; R. Bruce Richter; Gelasio Salazar (Australas. J Comb., 2007)

Simple Euclidean Arrangements with No (>= 5)-Gons. - Jesús Leaños; Mario Lomelí-Haro; Criel Merino; Gelasio Salazar; Jorge Urrutia (Discret. Comput. Geom., 2007)

The crossing number of a projective graph is quadratic in the face-width. - Isidoro Gitler; Petr Hlinený; Jesús Leaños; Gelasio Salazar (Electron. Notes Discret. Math., 2007)

Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position. - József Balogh; Boris G. Pittel; Gelasio Salazar (Random Struct. Algorithms, 2007)

The maximum number of halving lines and the rectilinear crossing number of Kn for n. - Bernardo M. Ábrego; Silvia Fernández-Merchant; Jesús Leaños; Gelasio Salazar (Electron. Notes Discret. Math., 2008)

A central approach to bound the number of crossings in a generalized configuration. - Bernardo M. Ábrego; Silvia Fernández-Merchant; Jesús Leaños; Gelasio Salazar (Electron. Notes Discret. Math., 2008)

A note on harmonic subgraphs in labelled geometric graphs. - Gabriela Araujo; József Balogh; Ruy Fabila Monroy; Gelasio Salazar; Jorge Urrutia (Inf. Process. Lett., 2008)

An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn. - Bernardo M. Ábrego; József Balogh; Silvia Fernández-Merchant; Jesús Leaños; Gelasio Salazar (J. Comb. Theory A, 2008)

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., 2010)

The Number of Generalized Balanced Lines. - David Orden; Pedro Ramos 001; Gelasio Salazar (Discret. Comput. Geom., 2010)

Stars and bonds in crossing-critical graphs. - Petr Hlinený; Gelasio Salazar (J. Graph Theory, 2010)

Convexifying Monotone Polygons while Maintaining Internal Visibility. - Oswin Aichholzer; Mario Cetina; Ruy Fabila Monroy; Jesús Leaños; Gelasio Salazar; Jorge Urrutia (EGC, 2011)

On $( le k)$-edges, crossings, and halving lines of geometric drawings of Kn - Bernardo M. Ábrego; Mario Cetina; Silvia Fernández-Merchant; Jesús Leaños; Gelasio Salazar (CoRR, 2011)

There is a unique crossing-minimal rectilinear drawing of K18. - Oswin Aichholzer; Bernardo M. Ábrego; Silvia Fernández-Merchant; Jesús Leaños; Gelasio Salazar (Electron. Notes Discret. Math., 2011)

Asymptotically settling Zarankiewicz's Conjecture in finite time, for each m. - Robin Christian; R. Bruce Richter; Gelasio Salazar (Electron. Notes Discret. Math., 2011)

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., 2012)

Visibility-preserving convexifications using single-vertex moves. - Bernardo M. Ábrego; Mario Cetina; Jesús Leaños; Gelasio Salazar (Inf. Process. Lett., 2012)

Nested cycles in large triangulations and crossing-critical graphs. - César Hernández-Vélez; Gelasio Salazar; Robin Thomas 001 (J. Comb. Theory B, 2012)

Making a Graph Crossing-Critical by Multiplying its Edges. - Laurent Beaudou; César Hernández-Vélez; Gelasio Salazar (Electron. J. Comb., 2013)

Large convex holes in random point sets. - József Balogh; Hernán González-Aguilar; Gelasio Salazar (Comput. Geom., 2013)

Shellable drawings and the cylindrical crossing number of $K_n$. - Bernardo M. Ábrego; Oswin Aichholzer; Silvia Fernández-Merchant; Pedro Ramos 001; Gelasio Salazar (CoRR, 2013)

The 2-Page Crossing Number of Kn. - Bernardo M. Ábrego; Oswin Aichholzer; Silvia Fernández-Merchant; Pedro Ramos 001; Gelasio Salazar (Discret. Comput. Geom., 2013)

The Erdős-Sós Conjecture for Geometric Graphs. - Ruy Fabila Monroy; Luis Felipe Barba Flores; Dolores Lara; Jesús Leaños; Cynthia A. Rodríguez Villalobos; Gelasio Salazar; Francisco Zaragoza (Discret. Math. Theor. Comput. Sci., 2013)

More on the crossing number of Kn: Monotone drawings. - Bernardo M. Ábrego; Oswin Aichholzer; Silvia Fernández-Merchant; Pedro Ramos 001; Gelasio Salazar (Electron. Notes Discret. Math., 2013)

Preface. - Jesús A. De Loera; Thomas M. Liebling; Miguel A. Pizaña; Gelasio Salazar (Electron. Notes Discret. Math., 2013)

Zarankiewicz's Conjecture is finite for each fixed m. - Robin Christian; R. Bruce Richter; Gelasio Salazar (J. Comb. Theory B, 2013)

Improved Lower Bounds on Book Crossing Numbers of Complete Graphs. - Etienne de Klerk; Dmitrii V. Pasechnik; Gelasio Salazar (SIAM J. Discret. Math., 2013)

The Optimal Drawings of $K_{5, n}$. - César Hernández-Vélez; Carolina Medina; Gelasio Salazar (Electron. J. Comb., 2014)

Book drawings of complete bipartite graphs. - Etienne de Klerk; Dmitrii V. Pasechnik; Gelasio Salazar (Discret. Appl. Math., 2014)

Shellable Drawings and the Cylindrical Crossing Number of Kn. - Bernardo M. Ábrego; Oswin Aichholzer; Silvia Fernández-Merchant; Pedro Ramos 001; Gelasio Salazar (Discret. Comput. Geom., 2014)

On Hardness of the Joint Crossing Number. - Petr Hlinený; Gelasio Salazar (ISAAC, 2015)

On the Decay of Crossing Numbers of Sparse Graphs. - József Balogh; Jesús Leaños; Gelasio Salazar (J. Graph Theory, 2015)

Embedding a Graph-Like Continuum in Some Surface. - Robin Christian; R. Bruce Richter; Gelasio Salazar (J. Graph Theory, 2015)

Book Embeddings of Regular Graphs. - József Balogh; Gelasio Salazar (SIAM J. Discret. Math., 2015)

Characterizing 2-crossing-critical graphs. - Drago Bokal; Bogdan Oporowski; R. Bruce Richter; Gelasio Salazar (Adv. Appl. Math., 2016)

Preface: LAGOS'13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, México - 2013. - José Correa 001; Guillermo Durán; Luérbio Faria; Miguel A. Pizaña; Gelasio Salazar (Discret. Appl. Math., 2016)

Large Area Convex Holes in Random Point Sets. - Octavio Arizmendi; Gelasio Salazar (SIAM J. Discret. Math., 2016)

Drawings of Kn with the same rotation scheme are the same up to Reidemeister moves (Gioan's Theorem). - Alan Arroyo; Dan McQuillan; R. Bruce Richter; Gelasio Salazar (Australas. J Comb., 2017)

Arrangements of pseudocircles on surfaces. - Carolina Medina; Edgardo Roldán-Pensado; Gelasio Salazar (CoRR, 2017)

On the Pseudolinear Crossing Number. - César Hernández-Vélez; Jesús Leaños; Gelasio Salazar (J. Graph Theory, 2017)

Levi's Lemma, pseudolinear drawings of Kn, and empty triangles. - Alan Arroyo; Dan McQuillan; R. Bruce Richter; Gelasio Salazar (J. Graph Theory, 2018)

Closing in on Hill's Conjecture. - József Balogh; Bernard Lidický; Gelasio Salazar (SIAM J. Discret. Math., 2019)

On the Number of Unknot Diagrams. - Carolina Medina; Jorge L. Ramírez Alfonsín; Gelasio Salazar (SIAM J. Discret. Math., 2019)

Embeddability of Arrangements of Pseudocircles and Graphs on Surfaces. - Éric Colin de Verdière; Carolina Medina; Edgardo Roldán-Pensado; Gelasio Salazar (Discret. Comput. Geom., 2020)

Toroidal grid minors and stretch in embedded graphs. - Markus Chimani; Petr Hlinený; Gelasio Salazar (J. Comb. Theory, Ser. B, 2020)

Drawings of complete graphs in the projective plane. - Alan Arroyo; Dan McQuillan; R. Bruce Richter; Gelasio Salazar; Matthew Sullivan (J. Graph Theory, 2021)

Convex drawings of the complete graph: topology meets geometry. - Alan Arroyo; Dan McQuillan; R. Bruce Richter; Gelasio Salazar (Ars Math. Contemp., 2022)

Crossing numbers of complete bipartite graphs. - József Balogh; Bernard Lidický; Sergey Norin; Florian Pfender; Gelasio Salazar; Sam Spiro (LAGOS, 2023)

There is a unique crossing-minimal rectilinear drawing of K_18. - Bernardo M. Ábrego; Silvia Fernández-Merchant; Oswin Aichholzer; Jesús Leaños; Gelasio Salazar (Ars Math. Contemp., 2024)

Rotation Systems and Simple Drawings in Surfaces. - Rosna Paul; Gelasio Salazar; Alexandra Weinberger (Electron. J. Comb., 2024)