The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Gelasio Salazar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  23. Approximating the Crossing Number of Toroidal Graphs. [Citation Graph (, )][DBLP]


  24. 3-symmetric and 3-decomposable geometric drawings of Kn. [Citation Graph (, )][DBLP]


  25. Simple Euclidean Arrangements with No (>= 5)-Gons. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002