|
99
|
On sets of distances of n points
– P Erdős
- 1970
|
|
24
|
On the dierent distances determined by n points
– L Moser
- 1952
|
|
16
|
The number of different distances determined by a set of points in the Euclidean plane, Discrete
– F Chung, E Szemerédi, W T Trotter
- 1992
|
|
138
|
Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput
– K L Clarkson, H Edelsbrunner, L J Guibas, M Sharir, E Welzl
- 1990
|
|
92
|
Crossing numbers and hard Erdős problems in discrete geometry
– László A. Székely
- 1997
|
|
147
|
Combinatorial Geometry
– P. K. Agarwal
- 1995
|
|
32
|
On the lattice property of the plane and some problems of Dirac
– J Beck
- 1983
|
|
23
|
A new entropy inequality for the Erdös distance problem Contemp. Math. 342, Towards a theory of geometric graphs
– N Katz, G Tardos
- 2004
|
|
88
|
Complexity Issues in VLSI
– F T Leighton
- 1983
|
|
12
|
Distinct Distances in the Plane
– J. Solymosi, Cs. D. Toth
- 2001
|
|
55
|
Extremal problems in discrete geometry, Combinatorica 3
– E Szemerédi, W Trotter
- 1983
|
|
4
|
Crossing free subgraphs
– M Ajtai, V Chvátal, M Newborn, E Szemerédi
- 1982
|
|
5
|
Graphs drawn with few crossings
– J Pach, G Toth
- 1997
|
|
3
|
On distinct distances and distinct distances
– G Tardos
- 2003
|
|
34
|
Extremal problems in discrete geometry
– Endre Szemerédi, William T Trotter
- 1983
|
|
14
|
Distinct distances in the plane, Discrete Comput
– D Tóth
|
|
9
|
On Distinct Sums and Distinct Distances
– Gábor Tardos
- 2001
|
|
8
|
Distinct distances in three and higher dimensions
– Boris Aronov, János Pach, Micha Sharir, Gábor Tardos
- 2003
|
|
10
|
An upper bound for the cardinality of an s-distance subset in real Euclidean space
– E Bannai, E Bannai, D Stanton
- 1983
|
