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

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

Documents Related by Co-Citation

143 Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput – K L Clarkson, H Edelsbrunner, L J Guibas, M Sharir, E Welzl - 1990
71 Crossing-free subgraphs – M Ajtai, V Chvátal, M M Newborn, E Szemerédi - 1982
28 On the Number of Incidences Between Points and Curves – János Pach, Micha Sharir
163 Combinatorial Geometry – P. K. Agarwal - 1995
39 Extremal problems in discrete geometry – Endre Szemerédi, William T Trotter - 1983
688 Algorithms in Combinatorial Geometry – H Edelsbrunner - 1987
124 On sets of distances of n points – Paul Erdős - 1946
416 Davenport-Schinzel Sequences and Their Geometric Applications – Pankaj K. Agarwal , Micha Sharir - 1998
62 Crossing number problems – P Erdős, R K Guy - 1973
67 Extremal problems in discrete geometry, Combinatorica 3 – E Szemeredi, W Trotter - 1983
23 Extremal Problems for Geometric Hypergraphs – Tamal K. Dey, János Pach - 1998
96 Complexity issues in VLSI – F T Leighton - 1983
390 A Separator Theorem for Planar Graphs – Richard J. Lipton, Robert E. Tarjan - 1977
387 Applications of Random Sampling in Computational Geometry, II – Kenneth L. Clarkson, Peter W. Shor - 1995
20 On the number of halving planes – Imre Bárány, Zoltán Füredi, László Lovász - 1990
48 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
17 Complexity Issues in VLSI, Foundations of Computing Series – F T Leighton - 1983
24 Graphs drawn with few crossings per edge, Combinatorica 17:3 – J Pach, G Tóth - 1997