27

On the different distances determined by n points
– L Moser
 1952

130

On sets of distances of n points
– Paul Erdős
 1946

20

Trotter: The number of different distances determined by a set of points in the Euclidean plane, Discrete Comput. Geom. 7
– F R K Chung, E Szemerédi, W T
 1992

113

Crossing numbers and hard Erdős problems in discrete geometry
– László A. Székely
 1997

149

Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput
– K Clarkson, H Edelsbrunner, L Gubias, M Sharir, E Welzl
 1990

164

Combinatorial Geometry
– P. K. Agarwal
 1995

36

On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry, Combinatorica 3
– J Beck
 1983

30

A new entropy inequality for the Erdős distance problem, in: Towards a Theory of Geometric Graphs
– N H Katz, G Tardos

13

On Distinct Sums and Distinct Distances
– Gábor Tardos
 2001

68

Extremal problems in discrete geometry, Combinatorica 3
– E Szemerédi, W T Trotter
 1983

97

Complexity Issues in VLSI
– F T Leighton
 1983

16

Distinct Distances in the Plane
– J. Solymosi, Cs. D. Toth
 2001

11

An upper bound for the cardinality of an sdistance subset
– E BANNAI, E BANNAI, D STANTON
 1983

27

Unit distances in the Euclidean plane
– J Spencer, E Szemerédi, W Trotter
 1984

28

Reconstructing sets from interpoint distances
– S S Skiena, W D Smith, P Lemke
 1990

15

LowDimensional Lattices I: Quadratic Forms of Small Determinant
– J. H. Conway, N. J. A. Sloane
 1988

14

Distinct distances in the plane, Discrete Comput. Geometry 25
– Tóth
 2001

11

Distinct distances in three and higher dimensions
– Boris Aronov, János Pach, Micha Sharir, Gábor Tardos
 2003

15

On twodistance sets in Euclidean space
– D G LARMAN, G A ROGERS, J J SEIDEL
 1977
