Penny-packing and two-dimensional codes R. L. GrahamN. J. A. Sloane OriginalPaper 01 January 1990 Pages: 1 - 11
Geometry of the Gass-Saaty parametric cost LP algorithm Victor KleePeter Kleinschmidt OriginalPaper 01 January 1990 Pages: 13 - 26
Upper bounds on geometric permutations for convex sets Rephael Wenger OriginalPaper 01 January 1990 Pages: 27 - 33
The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2 Herbert EdelsbrunnerMicha Sharir OriginalPaper 01 January 1990 Pages: 35 - 42
An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space K. KedemM. Sharir OriginalPaper 01 January 1990 Pages: 43 - 75
On a problem about covering lines by squares Walter KernAlfred Wanka OriginalPaper 01 January 1990 Pages: 77 - 82
Combinatorial geometries representable over GF(3) and GF(q). I. The number of points Joseph P. S. Kung OriginalPaper 01 January 1990 Pages: 83 - 95