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

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

Documents Related by Co-Citation

149 Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput – K Clarkson, H Edelsbrunner, L Gubias, M Sharir, E Welzl - 1990
74 Crossing-free subgraphs – M Ajtai, V Chvátal, M M Newborn, E Szemerédi - 1983
30 On the Number of Incidences Between Points and Curves – János Pach, Micha Sharir
164 Combinatorial Geometry – P. K. Agarwal - 1995
40 Extremal problems in discrete geometry – E Szemerdi, W Trotter - 1983
694 Algorithms in Combinatorial Geometry – H Edelsbrunner - 1987
130 On sets of distances of n points – Paul Erdős - 1946
425 Davenport-Schinzel Sequences and Their Geometric Applications – Pankaj K. Agarwal , Micha Sharir - 1998
64 Crossing number problems – P Erdös, R K Guy - 1973
68 Extremal problems in discrete geometry, Combinatorica 3 – E Szemerédi, W T Trotter - 1983
24 Extremal Problems for Geometric Hypergraphs – Tamal K. Dey, János Pach - 1998
397 A Separator Theorem for Planar Graphs f – Richard J. Lipton, Robert E. Tarjan - 1977
396 Applications of Random Sampling in Computational Geometry, II – Kenneth L. Clarkson, Peter W. Shor - 1995
97 Complexity Issues in VLSI – F T Leighton - 1983
212 Crossing number is NP-complete – M R Garey, D S Johnson - 1983
20 On the number of halving planes – Imre Bárány, Zoltán Füredi, László Lovász - 1990
50 On the number of halving lines – L Lovász - 1971
25 An upper bound on the number of planar k-sets – J Pach, W Steiger, E Szemer6di - 1992
19 Complexity Issues in VLSI. Foundations of Computing Series – T Leighton - 1983