Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Salazar, Gelasio"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Zarankiewicz's conjecture is finite for each fixed
m
Robin Christian
,
R. Bruce Richter
,
Gelasio Salazar
Journal of Combinatorial Theory Series B
103
(2), 2013, pp. 237-247
The 2-page crossing number of
K_n
Bernardo M. Ábrego
,
Oswin Aichholzer
,
Silvia Fernández-Merchant
,
Pedro Ramos
,
Gelasio Salazar
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 397-403
Nested cycles in large triangulations and crossing-critical graphs
César Hernández-Vélez
,
Gelasio Salazar
,
Robin Thomas
Journal of Combinatorial Theory Series B
102
(1), 2012, pp. 86-92
Stars and bonds in crossing-critical graphs
Petr Hlinȇný
,
Gelasio Salazar
Journal of Graph Theory
65
(3), 2010, pp. 198-215
On the crossing number of almost planar graphs
Petr Hlinȇný
,
Gelasio Salazar
Lecture Notes in Computer Science
4372
, 2007, pp. 162-173
Approximating the crossing number of toroidal graphs
Petr Hlinȇný
,
Gelasio Salazar
Lecture Notes in Computer Science
4835
, 2007, pp. 148-159
Nearly light cycles in embedded graphs and crossing-critical graphs
Mario Lomelí
,
Gelasio Salazar
Journal of Graph Theory
53
(2), 2006, pp. 151-156
On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
Criel Merino
,
Gelasio Salazar
,
Jorge Urrutia
Graphs and Combinatorics
21
(3), 2005, pp. 333-341
Two maps with large representativity on one surface
R. Bruce Richter
,
Gelasio Salazar
Journal of Graph Theory
50
(3), 2005, pp. 234-245
Improved bounds for the number of
(\le k)
-sets, convex quadrilaterals, and the rectilinear crossing number of
K_n
József Balogh
,
Gelasio Salazar
Lecture Notes in Computer Science
3383
, 2004, pp. 25-35
The crossing number of
C_m \times C_n
is as conjectured for
n \le m(m+1)
Lev Yu. Glebsky
,
Gelasio Salazar
Journal of Graph Theory
47
(1), 2004, pp. 53-72
An improved bound for the crossing number of
C_m \times C_n
: A self-contained proof using mostly combinatorial arguments
Gelasio Salazar
,
Edgardo Ugalde
Graphs and Combinatorics
20
(2), 2004, pp. 247-253
Optimal meshes of curves in the Klein bottle
Hector A. Juarez
,
Gelasio Salazar
Journal of Combinatorial Theory Series B
88
(1), 2003, pp. 185-188
The crossing number of
P(N, 3)
R. Bruce Richter
,
Gelasio Salazar
Graphs and Combinatorics
18
(2), 2002, pp. 381-394
Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree
Enrique Garcia-Moreno
,
Gelasio Salazar
Journal of Graph Theory
36
(3), 2001, pp. 168-173
Drawings of
C_m \times C_n
with one disjoint family II
Hector A. Juarez
,
Gelasio Salazar
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 161-165
On a crossing number result of Richter and Thomassen
Gelasio Salazar
Journal of Combinatorial Theory Series B
79
(1), 2000, pp. 98-99
A lower bound for the crossing number of
C_m \times C_n
Gelasio Salazar
Journal of Graph Theory
35
(3), 2000, pp. 222-226
On the intersections of systems of curves
Gelasio Salazar
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 56-60
Drawing of
C_m \times C_n
with one disjoint family
Gelasio Salazar
Journal of Combinatorial Theory Series B
76
(2), 1999, pp. 129-135
On the crossing number of
C_m \times C_n
Gelasio Salazar
Journal of Graph Theory
28
(3), 1998, pp. 163-170