Gelasio Salazar

893 total citations
62 papers, 327 citations indexed

About

Gelasio Salazar is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Gelasio Salazar has authored 62 papers receiving a total of 327 indexed citations (citations by other indexed papers that have themselves been cited), including 52 papers in Computer Graphics and Computer-Aided Design, 38 papers in Computational Theory and Mathematics and 15 papers in Computer Vision and Pattern Recognition. Recurrent topics in Gelasio Salazar's work include Computational Geometry and Mesh Generation (52 papers), Advanced Graph Theory Research (28 papers) and Digital Image Processing Techniques (13 papers). Gelasio Salazar is often cited by papers focused on Computational Geometry and Mesh Generation (52 papers), Advanced Graph Theory Research (28 papers) and Digital Image Processing Techniques (13 papers). Gelasio Salazar collaborates with scholars based in Mexico, United States and Canada. Gelasio Salazar's co-authors include R. Bruce Richter, Bernardo M. Ábrego, Silvia Fernández‐Merchant, Edgardo Ugalde, József Balogh, Etienne de Klerk, Dmitrii V. Ṗasechnik, Pedro Ramos, Oswin Aichholzer and Jim Geelen and has published in prestigious journals such as Chaos An Interdisciplinary Journal of Nonlinear Science, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Gelasio Salazar

57 papers receiving 302 citations

Peers

Gelasio Salazar

CGCD

CTM

CVPR

EEE

Rom Pinchasi Israel

Clemens Huemer Spain

Pierre Rosenstiehl France

Avner Magen Canada

J. Matoušek Czechia

Richard D. Ringeisen United States

Eyal Ackerman Israel

Heiko Harborth Germany

Torsten Ueckerdt Germany

Ruy Fabila‐Monroy Mexico

Rom Pinchasi Israel

Gelasio Salazar

197 ×0.8

CGCD

155 ×0.7

CTM

80 ×0.6

CVPR

27 ×0.4

EEE

20 ×0.5

Citations per year, relative to Gelasio Salazar Gelasio Salazar (= 1×) peers Rom Pinchasi

Countries citing papers authored by Gelasio Salazar

Since Specialization

Citations

This map shows the geographic impact of Gelasio Salazar's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Gelasio Salazar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gelasio Salazar more than expected).

Fields of papers citing papers by Gelasio Salazar

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Gelasio Salazar. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Gelasio Salazar. The network helps show where Gelasio Salazar may publish in the future.

Co-authorship network of co-authors of Gelasio Salazar

This figure shows the co-authorship network connecting the top 25 collaborators of Gelasio Salazar. A scholar is included among the top collaborators of Gelasio Salazar based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Gelasio Salazar. Gelasio Salazar is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Chimani, Markus, Petr Hliněný, & Gelasio Salazar. (2019). Toroidal grid minors and stretch in embedded graphs. Journal of Combinatorial Theory Series B. 140. 323–371. 1 indexed citations

Richter, R. Bruce, et al.. (2017). Drawings of K n with the same rotation scheme are the same up to Reidemeister moves (Gioan's Theorem).. Australas. J Comb.. 67. 131–144. 1 indexed citations

Ábrego, Bernardo M., Oswin Aichholzer, Silvia Fernández‐Merchant, et al.. (2015). All Good Drawings of Small Complete Graphs. 57–60. 2 indexed citations

Bokal, Drago, Bogdan Oporowski, R. Bruce Richter, & Gelasio Salazar. (2015). Characterizing 2-crossing-critical graphs. Advances in Applied Mathematics. 74. 23–208. 7 indexed citations

Balogh, József, et al.. (2012). Large convex holes in random point sets. Computational Geometry. 46(6). 725–733. 2 indexed citations

Richter, R. Bruce, et al.. (2012). Zarankiewiczʼs Conjecture is finite for each fixed m. Journal of Combinatorial Theory Series B. 103(2). 237–247. 7 indexed citations

Salazar, Gelasio, et al.. (2011). Nested cycles in large triangulations and crossing-critical graphs. Journal of Combinatorial Theory Series B. 102(1). 86–92. 1 indexed citations

Pan, Shilie, et al.. (2007). The convex hull of every optimal pseudolinear drawing of kn is a triangle. The Australasian Journal of Combinatorics. 38. 155–162. 4 indexed citations

Merino, Criel, Gelasio Salazar, & Jorge Urrutia. (2006). On the length of longest alternating paths for multicoloured point sets in convex position. Discrete Mathematics. 306(15). 1791–1797. 6 indexed citations

10.

Balogh, József, Boris Pittel, & Gelasio Salazar. (2006). Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position. Random Structures and Algorithms. 30(1-2). 105–130. 1 indexed citations

11.

Salazar, Gelasio. (2005). On the crossing numbers of loop networks and generalized Petersen graphs. Discrete Mathematics. 302(1-3). 243–253. 12 indexed citations

12.

Balogh, József, Boris Pittel, & Gelasio Salazar. (2005). Near―perfect non-crossing harmonic matchings in randomly labeled points on a circle. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AD,...(Proceedings). 1 indexed citations

13.

Geelen, Jim, R. Bruce Richter, & Gelasio Salazar. (2004). Embedding grids in surfaces. European Journal of Combinatorics. 25(6). 785–792. 15 indexed citations

14.

Salazar, Gelasio, et al.. (2004). The crossing number of C_m × C_n is as conjectured for n ≥ m(m + 1). Journal of Graph Theory. 47(1). 53–72. 23 indexed citations

15.

Salazar, Gelasio. (2003). Infinite families of crossing-critical graphs with given average degree. Discrete Mathematics. 271(1-3). 343–350. 9 indexed citations

16.

Salazar, Gelasio, et al.. (2001). Drawings of Cm×Cn with One Disjoint Family II. Journal of Combinatorial Theory Series B. 82(1). 161–165. 4 indexed citations

17.

Salazar, Gelasio. (2000). On a Crossing Number Result of Richter and Thomassen. Journal of Combinatorial Theory Series B. 79(1). 98–99. 4 indexed citations

18.

Salazar, Gelasio. (1999). Drawings of Cm×Cn with One Disjoint Family. Journal of Combinatorial Theory Series B. 76(2). 129–135. 7 indexed citations

19.

Salazar, Gelasio. (1999). On the Intersections of Systems of Curves. Journal of Combinatorial Theory Series B. 75(1). 56–60. 3 indexed citations

20.

Salazar, Gelasio. (1998). On the crossing number of cm × cn. Journal of Graph Theory. 28(3). 163–170. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact