Gelasio Salazar

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 16

Top Topics

Bipartite Graph

Engineering Drawings

Graph Theoretic

Top Venues

J. Graph Theory

SIAM J. Discret. Math.

Discret. Comput. Geom.

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)
Rosna Paul, Gelasio Salazar, Alexandra Weinberger
Rotation Systems and Simple Drawings in Surfaces. Electron. J. Comb. 31 (2) (2024)
József Balogh, Bernard Lidický, Sergey Norin, Florian Pfender, Gelasio Salazar, Sam Spiro
Crossing numbers of complete bipartite graphs. LAGOS (2023)
Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar
Convex drawings of the complete graph: topology meets geometry. Ars Math. Contemp. 22 (3) (2022)
Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar, Matthew Sullivan
Drawings of complete graphs in the projective plane. J. Graph Theory 97 (3) (2021)
Éric Colin de Verdière, Carolina Medina, Edgardo Roldán-Pensado, Gelasio Salazar
Embeddability of Arrangements of Pseudocircles and Graphs on Surfaces. Discret. Comput. Geom. 64 (2) (2020)
Markus Chimani, Petr Hlinený, Gelasio Salazar
Toroidal grid minors and stretch in embedded graphs. J. Comb. Theory, Ser. B 140 (2020)
József Balogh, Bernard Lidický, Gelasio Salazar
Closing in on Hill's Conjecture. SIAM J. Discret. Math. 33 (3) (2019)
Carolina Medina, Jorge L. Ramírez Alfonsín, Gelasio Salazar
On the Number of Unknot Diagrams. SIAM J. Discret. Math. 33 (1) (2019)
Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar
Levi's Lemma, pseudolinear drawings of Kn, and empty triangles. J. Graph Theory 87 (4) (2018)
Carolina Medina, Edgardo Roldán-Pensado, Gelasio Salazar
Arrangements of pseudocircles on surfaces. CoRR (2017)
César Hernández-Vélez, Jesús Leaños, Gelasio Salazar
On the Pseudolinear Crossing Number. J. Graph Theory 84 (3) (2017)
Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar
with the same rotation scheme are the same up to Reidemeister moves (Gioan's Theorem). Australas. J Comb. 67 (2017)
Drago Bokal, Bogdan Oporowski, R. Bruce Richter, Gelasio Salazar
Characterizing 2-crossing-critical graphs. Adv. Appl. Math. 74 (2016)
José R. Correa, Guillermo Durán, Luérbio Faria, Miguel A. Pizaña, Gelasio Salazar
Preface: LAGOS'13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, México - 2013. Discret. Appl. Math. 210 (2016)
Octavio Arizmendi, Gelasio Salazar
Large Area Convex Holes in Random Point Sets. SIAM J. Discret. Math. 30 (3) (2016)
Petr Hlinený, Gelasio Salazar
On Hardness of the Joint Crossing Number. ISAAC (2015)
József Balogh, Gelasio Salazar
Book Embeddings of Regular Graphs. SIAM J. Discret. Math. 29 (2) (2015)
Robin Christian, R. Bruce Richter, Gelasio Salazar
Embedding a Graph-Like Continuum in Some Surface. J. Graph Theory 79 (2) (2015)
József Balogh, Jesús Leaños, Gelasio Salazar
On the Decay of Crossing Numbers of Sparse Graphs. J. Graph Theory 80 (3) (2015)
Petr Hlinený, Gelasio Salazar
On Hardness of the Joint Crossing Number. CoRR (2015)
César Hernández-Vélez, Carolina Medina, Gelasio Salazar
The Optimal Drawings of $K_{5, n}$. Electron. J. Comb. 21 (4) (2014)
Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar
. Discret. Comput. Geom. 52 (4) (2014)
Etienne de Klerk, Dmitrii V. Pasechnik, Gelasio Salazar
Book drawings of complete bipartite graphs. Discret. Appl. Math. 167 (2014)
József Balogh, Hernán González-Aguilar, Gelasio Salazar
Large convex holes in random point sets. Comput. Geom. 46 (6) (2013)
Robin Christian, R. Bruce Richter, Gelasio Salazar
Zarankiewicz's Conjecture is finite for each fixed m. J. Comb. Theory, Ser. B 103 (2) (2013)
Laurent Beaudou, César Hernández-Vélez, Gelasio Salazar
Making a Graph Crossing-Critical by Multiplying its Edges. Electron. J. Comb. 20 (1) (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 A. De Loera, Thomas M. Liebling, Miguel A. Pizaña, Gelasio Salazar
Preface. Electron. Notes Discret. Math. 44 (2013)
Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar
Shellable drawings and the cylindrical crossing number of $K_n$. CoRR (2013)
Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar
. Discret. Comput. Geom. 49 (4) (2013)
Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar
: Monotone drawings. Electron. Notes Discret. Math. 44 (2013)
Etienne de Klerk, Dmitrii V. Pasechnik, Gelasio Salazar
Improved Lower Bounds on Book Crossing Numbers of Complete Graphs. SIAM J. Discret. Math. 27 (2) (2013)
Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar
CoRR (2012)
Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar
. SCG (2012)
César Hernández-Vélez, Carolina Medina, Gelasio Salazar
The optimal drawings of K_{5,n} CoRR (2012)
César Hernández-Vélez, Gelasio Salazar, Robin Thomas
Nested cycles in large triangulations and crossing-critical graphs. J. Comb. Theory, Ser. B 102 (1) (2012)
József Balogh, Hernán González-Aguilar, Gelasio Salazar
Large convex holes in random point sets CoRR (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)
Robin Christian, R. Bruce Richter, Gelasio Salazar
Asymptotically settling Zarankiewicz's Conjecture in finite time, for each m. Electron. Notes Discret. Math. 38 (2011)
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)
Oswin Aichholzer, Bernardo M. Ábrego, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
. Electron. Notes Discret. Math. 38 (2011)
Petr Hlinený, Gelasio Salazar
Stars and bonds in crossing-critical graphs. J. Graph Theory 65 (3) (2010)
Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar
. Discret. Appl. Math. 158 (12) (2010)
David Orden, Pedro Ramos, Gelasio Salazar
The Number of Generalized Balanced Lines. Discret. Comput. Geom. 44 (4) (2010)
David Orden, Pedro Ramos, Gelasio Salazar
The number of generalized balanced lines. CoRR (2009)
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)
Gabriela Araujo, József Balogh, Ruy Fabila Monroy, Gelasio Salazar, Jorge Urrutia
A note on harmonic subgraphs in labelled geometric graphs. Inf. Process. Lett. 105 (3) (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)
Petr Hlinený, Gelasio Salazar
Stars and Bonds in Crossing-Critical Graphs. Electron. Notes Discret. Math. 31 (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)
Petr Hlinený, Gelasio Salazar
Approximating the Crossing Number of Toroidal Graphs. ISAAC (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, Boris G. Pittel, Gelasio Salazar
Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position. Random Struct. Algorithms 30 (1-2) (2007)
József Balogh, Jesús Leaños, Shengjun Pan, R. Bruce Richter, Gelasio Salazar
is a triangle. Australas. J Comb. 38 (2007)
Etienne de Klerk, John Maharry, Dmitrii V. Pasechnik, R. Bruce Richter, Gelasio Salazar
. SIAM J. Discret. Math. 20 (1) (2006)
József Balogh, Gelasio Salazar
. Discret. Comput. Geom. 35 (4) (2006)
Mario Lomelí-Haro, Gelasio Salazar
Nearly light cycles in embedded graphs and crossing-critical graphs. J. Graph Theory 53 (2) (2006)
Criel Merino, Gelasio Salazar, Jorge Urrutia
On the length of longest alternating paths for multicoloured point sets in convex position. Discret. Math. 306 (15) (2006)
Petr Hlinený, Gelasio Salazar
On the Crossing Number of Almost Planar Graphs. Graph Drawing (2006)
Criel Merino, Gelasio Salazar, Jorge Urrutia
On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets. Graphs Comb. 21 (3) (2005)
R. Bruce Richter, Gelasio Salazar
Two maps with large representativity on one surface. J. Graph Theory 50 (3) (2005)
Gelasio Salazar
On the crossing numbers of loop networks and generalized Petersen graphs. Discret. Math. 302 (1-3) (2005)
Lev Yu. Glebsky, Gelasio Salazar
+ 1). J. Graph Theory 47 (1) (2004)
James F. Geelen, R. Bruce Richter, Gelasio Salazar
Embedding grids in surfaces. Eur. J. Comb. 25 (6) (2004)
Paul Boone, Edgar Chávez, Lev Gleitzky, Evangelos Kranakis, Jaroslav Opatrny, Gelasio Salazar, Jorge Urrutia
Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks. SIROCCO (2004)
József Balogh, Gelasio Salazar
. Graph Drawing (2004)
Gelasio Salazar, Edgardo Ugalde
: a Self-Contained Proof Using Mostly Combinatorial Arguments. Graphs Comb. 20 (2) (2004)
Gelasio Salazar
Small meshes of curves and their role in the analysis of optimal meshes. Discret. Math. 263 (1-3) (2003)
Gelasio Salazar
Infinite families of crossing-critical graphs with given average degree. Discret. Math. 271 (1-3) (2003)
Jesús Leaños, Criel Merino, Gelasio Salazar, Jorge Urrutia
Spanning Trees of Multicoloured Point Sets with Few Intersections. IJCCGGT (2003)
Hector A. Juarez, Gelasio Salazar
Optimal meshes of curves in the Klein bottle. J. Comb. Theory, Ser. B 88 (1) (2003)
R. Bruce Richter, Gelasio Salazar
The Crossing Number of P(N, 3). Graphs Comb. 18 (2) (2002)
Hector A. Juarez, Gelasio Salazar
with One Disjoint Family II. J. Comb. Theory, Ser. B 82 (1) (2001)
Enrique García-Moreno, Gelasio Salazar
Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree. J. Graph Theory 36 (3) (2001)
R. Bruce Richter, Gelasio Salazar
. Australas. J Comb. 23 (2001)
Gelasio Salazar
. J. Graph Theory 35 (3) (2000)
Gelasio Salazar
On a Crossing Number Result of Richter and Thomassen. J. Comb. Theory, Ser. B 79 (1) (2000)
Gelasio Salazar
with One Disjoint Family. J. Comb. Theory, Ser. B 76 (2) (1999)
Gelasio Salazar
On the Intersections of Systems of Curves. J. Comb. Theory, Ser. B 75 (1) (1999)
Gelasio Salazar
. J. Graph Theory 28 (3) (1998)