default search action
Gelasio Salazar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j68]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) - [j67]Rosna Paul
Rotation Systems and Simple Drawings in Surfaces. Electron. J. Comb. 31(2) (2024) - 2023
- [c9]József Balogh, Bernard Lidický
Crossing numbers of complete bipartite graphs. LAGOS 2023: 78-87 - 2022
- [j66]Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar:
Convex drawings of the complete graph: topology meets geometry. Ars Math. Contemp. 22(3): 3 (2022) - 2021
- [j65]Alan Arroyo, Dan McQuillan, R. Bruce Richter
Drawings of complete graphs in the projective plane. J. Graph Theory 97(3): 426-440 (2021) - 2020
- [j64]Éric Colin de Verdière, Carolina Medina, Edgardo Roldán-Pensado
Embeddability of Arrangements of Pseudocircles and Graphs on Surfaces. Discret. Comput. Geom. 64(2): 386-395 (2020) - [j63]Markus Chimani, Petr Hlinený
Toroidal grid minors and stretch in embedded graphs. J. Comb. Theory, Ser. B 140: 323-371 (2020)
2010 – 2019
- 2019
- [j62]Carolina Medina, Jorge L. Ramírez Alfonsín, Gelasio Salazar:
On the Number of Unknot Diagrams. SIAM J. Discret. Math. 33(1): 306-326 (2019) - [j61]József Balogh, Bernard Lidický
Closing in on Hill's Conjecture. SIAM J. Discret. Math. 33(3): 1261-1276 (2019) - 2018
- [j60]Alan Arroyo, Dan McQuillan, R. Bruce Richter
Levi's Lemma, pseudolinear drawings of Kn, and empty triangles. J. Graph Theory 87(4): 443-459 (2018) - 2017
- [j59]Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar:
Drawings of Kn with the same rotation scheme are the same up to Reidemeister moves (Gioan's Theorem). Australas. J Comb. 67: 131-144 (2017) - [j58]César Hernández-Vélez
On the Pseudolinear Crossing Number. J. Graph Theory 84(3): 297-310 (2017) - [i9]Carolina Medina, Edgardo Roldán-Pensado, Gelasio Salazar:
Arrangements of pseudocircles on surfaces. CoRR abs/1704.07688 (2017) - 2016
- [j57]Drago Bokal, Bogdan Oporowski, R. Bruce Richter, Gelasio Salazar:
Characterizing 2-crossing-critical graphs. Adv. Appl. Math. 74: 23-208 (2016) - [j56]José 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: 1-3 (2016) - [j55]Octavio Arizmendi
Large Area Convex Holes in Random Point Sets. SIAM J. Discret. Math. 30(3): 1866-1875 (2016) - 2015
- [j54]Robin Christian, R. Bruce Richter, Gelasio Salazar:
Embedding a Graph-Like Continuum in Some Surface. J. Graph Theory 79(2): 159-165 (2015) - [j53]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) - [j52]József Balogh, Gelasio Salazar:
Book Embeddings of Regular Graphs. SIAM J. Discret. Math. 29(2): 811-822 (2015) - [c8]Petr Hlinený
On Hardness of the Joint Crossing Number. ISAAC 2015: 603-613 - [i8]Petr Hlinený, Gelasio Salazar:
On Hardness of the Joint Crossing Number. CoRR abs/1509.01787 (2015) - 2014
- [j51]César Hernández-Vélez, Carolina Medina, Gelasio Salazar:
The Optimal Drawings of $K_{5, n}$. Electron. J. Comb. 21(4): 4 (2014) - [j50]Etienne de Klerk
Book drawings of complete bipartite graphs. Discret. Appl. Math. 167: 80-93 (2014) - [j49]Bernardo M. Ábrego, Oswin Aichholzer
Shellable Drawings and the Cylindrical Crossing Number of Kn. Discret. Comput. Geom. 52(4): 743-753 (2014) - 2013
- [j48]Laurent Beaudou, César Hernández-Vélez, Gelasio Salazar:
Making a Graph Crossing-Critical by Multiplying its Edges. Electron. J. Comb. 20(1): 61 (2013) - [j47]József Balogh, Hernán González-Aguilar, Gelasio Salazar:
Large convex holes in random point sets. Comput. Geom. 46(6): 725-733 (2013) - [j46]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant
The 2-Page Crossing Number of Kn. Discret. Comput. Geom. 49(4): 747-777 (2013) - [j45]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) - [j44]Jesús A. De Loera, Thomas M. Liebling, Miguel A. Pizaña, Gelasio Salazar:
Preface. Electron. Notes Discret. Math. 44: 1-2 (2013) - [j43]Bernardo M. Ábrego, Oswin Aichholzer
More on the crossing number of Kn: Monotone drawings. Electron. Notes Discret. Math. 44: 411-414 (2013) - [j42]Robin Christian, R. Bruce Richter, Gelasio Salazar:
Zarankiewicz's Conjecture is finite for each fixed m. J. Comb. Theory B 103(2): 237-247 (2013) - [j41]Etienne de Klerk, Dmitrii V. Pasechnik
Improved Lower Bounds on Book Crossing Numbers of Complete Graphs. SIAM J. Discret. Math. 27(2): 619-633 (2013) - [i7]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar:
Shellable drawings and the cylindrical crossing number of $K_n$. CoRR abs/1309.3665 (2013) - 2012
- [j40]Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant
On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n. Discret. Comput. Geom. 48(1): 192-215 (2012) - [j39]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) - [j38]César Hernández-Vélez
Nested cycles in large triangulations and crossing-critical graphs. J. Comb. Theory B 102(1): 86-92 (2012) - [c7]Bernardo M. Ábrego, Oswin Aichholzer
The 2-page crossing number of Kn. SCG 2012: 397-404 - [i6]József Balogh, Hernán González-Aguilar, Gelasio Salazar:
Large convex holes in random point sets. CoRR abs/1206.0805 (2012) - [i5]Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar:
The 2-page crossing number of Kn. CoRR abs/1206.5669 (2012) - [i4]César Hernández-Vélez, Carolina Medina, Gelasio Salazar:
The optimal drawings of K_{5,n}. CoRR abs/1210.1988 (2012) - 2011
- [j37]Robin Christian, R. Bruce Richter, Gelasio Salazar:
Asymptotically settling Zarankiewicz's Conjecture in finite time, for each m. Electron. Notes Discret. Math. 38: 279-284 (2011) - [j36]Oswin Aichholzer, Bernardo M. Ábrego, Silvia Fernández-Merchant
There is a unique crossing-minimal rectilinear drawing of K18. Electron. Notes Discret. Math. 38: 547-552 (2011) - [c6]Oswin Aichholzer
Convexifying Monotone Polygons while Maintaining Internal Visibility. EGC 2011: 98-108 - [i3]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) - [i2]Bernardo M. Ábrego, Mario Cetina, Jesús Leaños, Gelasio Salazar:
Visibility-preserving convexifications using single-vertex moves. CoRR abs/1105.3435 (2011) - 2010
- [j35]Bernardo M. Ábrego, Mario Cetina, Silvia Fernández-Merchant
3-symmetric and 3-decomposable geometric drawings of Kn. Discret. Appl. Math. 158(12): 1240-1258 (2010) - [j34]David Orden
The Number of Generalized Balanced Lines. Discret. Comput. Geom. 44(4): 805-811 (2010) - [j33]Petr Hlinený
Stars and bonds in crossing-critical graphs. J. Graph Theory 65(3): 198-215 (2010)
2000 – 2009
- 2009
- [i1]David Orden, Pedro Ramos, Gelasio Salazar:
The number of generalized balanced lines. CoRR abs/0904.4429 (2009) - 2008
- [j32]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) - [j31]Bernardo M. Ábrego, Silvia Fernández-Merchant
The maximum number of halving lines and the rectilinear crossing number of Kn for n. Electron. Notes Discret. Math. 30: 261-266 (2008) - [j30]Bernardo M. Ábrego, Silvia Fernández-Merchant
A central approach to bound the number of crossings in a generalized configuration. Electron. Notes Discret. Math. 30: 273-278 (2008) - [j29]Petr Hlinený
Stars and Bonds in Crossing-Critical Graphs. Electron. Notes Discret. Math. 31: 271-275 (2008) - [j28]Gabriela Araujo
A note on harmonic subgraphs in labelled geometric graphs. Inf. Process. Lett. 105(3): 98-102 (2008) - [j27]Bernardo M. Ábrego, József Balogh, Silvia Fernández-Merchant
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
- [j26]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) - [j25]Jesús Leaños, Mario Lomelí-Haro, Criel Merino
Simple Euclidean Arrangements with No (>= 5)-Gons. Discret. Comput. Geom. 38(3): 595-603 (2007) - [j24]Isidoro Gitler, Petr Hlinený
The crossing number of a projective graph is quadratic in the face-width. Electron. Notes Discret. Math. 29: 219-223 (2007) - [j23]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): 105-130 (2007) - [c5]Petr Hlinený, Gelasio Salazar:
Approximating the Crossing Number of Toroidal Graphs. ISAAC 2007: 148-159 - 2006
- [j22]József Balogh, Gelasio Salazar:
k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn. Discret. Comput. Geom. 35(4): 671-690 (2006) - [j21]Criel Merino
On the length of longest alternating paths for multicoloured point sets in convex position. Discret. Math. 306(15): 1791-1797 (2006) - [j20]Mario Lomelí-Haro, Gelasio Salazar:
Nearly light cycles in embedded graphs and crossing-critical graphs. J. Graph Theory 53(2): 151-156 (2006) - [j19]Etienne de Klerk, John Maharry, Dmitrii V. Pasechnik
Improved Bounds for the Crossing Numbers of Km, n and Kn. SIAM J. Discret. Math. 20(1): 189-202 (2006) - [c4]Petr Hlinený, Gelasio Salazar:
On the Crossing Number of Almost Planar Graphs. GD 2006: 162-173 - 2005
- [j18]Gelasio Salazar:
On the crossing numbers of loop networks and generalized Petersen graphs. Discret. Math. 302(1-3): 243-253 (2005) - [j17]Criel Merino
On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets. Graphs Comb. 21(3): 333-341 (2005) - [j16]R. Bruce Richter, Gelasio Salazar:
Two maps with large representativity on one surface. J. Graph Theory 50(3): 234-245 (2005) - 2004
- [j15]James F. Geelen, R. Bruce Richter, Gelasio Salazar:
Embedding grids in surfaces. Eur. J. Comb. 25(6): 785-792 (2004) - [j14]Gelasio Salazar, Edgardo Ugalde
An Improved Bound for the Crossing Number of C mC n: a Self-Contained Proof Using Mostly Combinatorial Arguments. Graphs Comb. 20(2): 247-253 (2004) - [j13]Lev Yu. Glebsky
The crossing number of Cm × Cn is as conjectured for n >= m(m + 1). J. Graph Theory 47(1): 53-72 (2004) - [c3]József Balogh, Gelasio Salazar:
Improved Bounds for the Number of (<=k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn. GD 2004: 25-35 - [c2]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: 23-34 - 2003
- [j12]Gelasio Salazar:
Small meshes of curves and their role in the analysis of optimal meshes. Discret. Math. 263(1-3): 233-246 (2003) - [j11]Gelasio Salazar:
Infinite families of crossing-critical graphs with given average degree. Discret. Math. 271(1-3): 343-350 (2003) - [j10]Hector A. Juarez, Gelasio Salazar:
Optimal meshes of curves in the Klein bottle. J. Comb. Theory B 88(1): 185-188 (2003) - [c1]Jesús Leaños, Criel Merino
Spanning Trees of Multicoloured Point Sets with Few Intersections. IJCCGGT 2003: 113-122 - 2002
- [j9]R. Bruce Richter, Gelasio Salazar:
The Crossing Number of P(N, 3). Graphs Comb. 18(2): 381-394 (2002) - 2001
- [j8]R. Bruce Richter, Gelasio Salazar:
The crossing number of C6 × Cn. Australas. J Comb. 23: 135-144 (2001) - [j7]Hector A. Juarez, Gelasio Salazar:
Drawings of Cm?Cn with One Disjoint Family II. J. Comb. Theory B 82(1): 161-165 (2001) - [j6]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): 168-173 (2001) - 2000
- [j5]Gelasio Salazar:
On a Crossing Number Result of Richter and Thomassen. J. Comb. Theory B 79(1): 98-99 (2000) - [j4]Gelasio Salazar:
A lower bound for the crossing number of Cm × Cn. J. Graph Theory 35(3): 222-226 (2000)
1990 – 1999
- 1999
- [j3]Gelasio Salazar:
On the Intersections of Systems of Curves. J. Comb. Theory B 75(1): 56-60 (1999) - [j2]Gelasio Salazar:
Drawings of Cm×Cn with One Disjoint Family. J. Comb. Theory B 76(2): 129-135 (1999) - 1998
- [j1]Gelasio Salazar:
On the crossing number of cm × cn. J. Graph Theory 28(3): 163-170 (1998)
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 21:24 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: