Crossing numbers and hard Erdős problems in discrete geometry (1997)

by László A. Székely
Venue:COMBINATORICS, PROBABILITY AND COMPUTING
Citations:116 - 1 self

Documents Related by Co-Citation

143 Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput – K Clarkson, H Edelsbrunner, L Guibas, M Sharir, E Welzl - 1990
73 Crossing-free subgraphs – M Ajtai, V Chvátal, M Newborn, E Szemerédi - 1982
711 Algorithms in Combinatorial Geometry – H Edelsbrunner - 1987
420 Davenport-Schinzel Sequences and Their Geometric Applications – Pankaj K. Agarwal , Micha Sharir - 1998
167 Combinatorial Geometry – P. K. Agarwal - 1995
396 Applications of Random Sampling in Computational Geometry, II – Kenneth L. Clarkson, Peter W. Shor - 1995
976 On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications – Vladimir Vapnik, Alexey Chervonenkis - 1971
40 Extremal problems in discrete geometry – E Szeremédi, W Trotter - 1983
1857 Computational Geometry: An Introduction – F Preparata, M Shamos - 1985