Gelasio Salazar

2008
31	EE	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. Electronic Notes in Discrete Mathematics 30: 261-266 (2008)
30	EE	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. Electronic Notes in Discrete Mathematics 30: 273-278 (2008)
29	EE	Petr Hlinený, Gelasio Salazar: Stars and Bonds in Crossing-Critical Graphs. Electronic Notes in Discrete Mathematics 31: 271-275 (2008)
28	EE	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): 98-102 (2008)
27	EE	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, Ser. A 115(7): 1257-1264 (2008)
2007
26	EE	Petr Hlinený, Gelasio Salazar: Approximating the Crossing Number of Toroidal Graphs. ISAAC 2007: 148-159
25	EE	Jesús Leaños, Mario Lomelí, Criel Merino, Gelasio Salazar, Jorge Urrutia: Simple Euclidean Arrangements with No (>= 5)-Gons. Discrete & Computational Geometry 38(3): 595-603 (2007)
24	EE	Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar: The crossing number of a projective graph is quadratic in the face-width. Electronic Notes in Discrete Mathematics 29: 219-223 (2007)
23	EE	József Balogh, Boris 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)
2006
22	EE	Petr Hlinený, Gelasio Salazar: On the Crossing Number of Almost Planar Graphs. Graph Drawing 2006: 162-173
21	EE	József Balogh, Gelasio Salazar: k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn. Discrete & Computational Geometry 35(4): 671-690 (2006)
20	EE	Criel Merino, Gelasio Salazar, Jorge Urrutia: On the length of longest alternating paths for multicoloured point sets in convex position. Discrete Mathematics 306(15): 1791-1797 (2006)
19	EE	Mario Lomelí, Gelasio Salazar: Nearly light cycles in embedded graphs and crossing-critical graphs. Journal of Graph Theory 53(2): 151-156 (2006)
18	EE	Etienne de Klerk, John Maharry, Dmitrii V. Pasechnik, R. Bruce Richter, Gelasio Salazar: Improved Bounds for the Crossing Numbers of Km, n and Kn. SIAM J. Discrete Math. 20(1): 189-202 (2006)
2005
17	EE	Gelasio Salazar: On the crossing numbers of loop networks and generalized Petersen graphs. Discrete Mathematics 302(1-3): 243-253 (2005)
16	EE	Criel Merino, Gelasio Salazar, Jorge Urrutia: On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets. Graphs and Combinatorics 21(3): 333-341 (2005)
15	EE	R. Bruce Richter, Gelasio Salazar: Two maps with large representativity on one surface. Journal of Graph Theory 50(3): 234-245 (2005)
2004
14	EE	József Balogh, Gelasio Salazar: Improved Bounds for the Number of (<=k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn. Graph Drawing 2004: 25-35
13	EE	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
12	EE	James F. Geelen, R. Bruce Richter, Gelasio Salazar: Embedding grids in surfaces. Eur. J. Comb. 25(6): 785-792 (2004)
11	EE	Gelasio Salazar, Edgardo Ugalde: An Improved Bound for the Crossing Number of C mC n: a Self-Contained Proof Using Mostly Combinatorial Arguments. Graphs and Combinatorics 20(2): 247-253 (2004)
10	EE	Lev Yu. Glebsky, Gelasio Salazar: The crossing number of Cm × Cn is as conjectured for n >= m(m + 1). Journal of Graph Theory 47(1): 53-72 (2004)
2003
9	EE	Jesús Leaños, Criel Merino, Gelasio Salazar, Jorge Urrutia: Spanning Trees of Multicoloured Point Sets with Few Intersections. IJCCGGT 2003: 113-122
8	EE	Gelasio Salazar: Small meshes of curves and their role in the analysis of optimal meshes. Discrete Mathematics 263(1-3): 233-246 (2003)
7	EE	Gelasio Salazar: Infinite families of crossing-critical graphs with given average degree. Discrete Mathematics 271(1-3): 343-350 (2003)
6	EE	Hector A. Juarez, Gelasio Salazar: Optimal meshes of curves in the Klein bottle. J. Comb. Theory, Ser. B 88(1): 185-188 (2003)
2002
5	EE	R. Bruce Richter, Gelasio Salazar: The Crossing Number of P(N, 3). Graphs and Combinatorics 18(2): 381-394 (2002)
2001
4	EE	Hector A. Juarez, Gelasio Salazar: Drawings of Cm?Cn with One Disjoint Family II. J. Comb. Theory, Ser. B 82(1): 161-165 (2001)
2000
3	EE	Gelasio Salazar: On a Crossing Number Result of Richter and Thomassen. J. Comb. Theory, Ser. B 79(1): 98-99 (2000)
1999
2	EE	Gelasio Salazar: On the Intersections of Systems of Curves. J. Comb. Theory, Ser. B 75(1): 56-60 (1999)
1	EE	Gelasio Salazar: Drawings of Cm×Cn with One Disjoint Family. J. Comb. Theory, Ser. B 76(2): 129-135 (1999)

Coauthor Index

1	Bernardo M. Ábrego	[27] [30] [31]
2	Gabriela Araujo	[28]
3	József Balogh	[14] [21] [23] [27] [28]
4	Paul Boone	[13]
5	Edgar Chávez	[13]
6	Silvia Fernández-Merchant	[27] [30] [31]
7	James F. Geelen	[12]
8	Isidoro Gitler	[24]
9	Lev Yu. Glebsky	[10]
10	Lev Gleitzky	[13]
11	Petr Hlinený	[22] [24] [26] [29]
12	Hector A. Juarez	[4] [6]
13	Etienne de Klerk	[18]
14	Evangelos Kranakis	[13]
15	Jesús Leaños	[9] [24] [25] [27] [30] [31]
16	Mario Lomelí	[19] [25]
17	John Maharry	[18]
18	Criel Merino	[9] [16] [20] [25]
19	Ruy Fabila Monroy	[28]
20	Jaroslav Opatrny	[13]
21	Dmitrii V. Pasechnik	[18]
22	Boris Pittel	[23]
23	R. Bruce Richter	[5] [12] [15] [18]
24	Edgardo Ugalde	[11]
25	Jorge Urrutia	[9] [13] [16] [20] [25] [28]

Colors in the list of coauthors