Connected rectilinear graphs on point sets...1–15 Approximate Euclidean Ramsey theorems...16–29 Delaunay triangulation of imprecise points, preprocess and actually get a fast query time...30–45 Constant-work-space algorithms for geometric problems...46–68 Good quality virtual realization of unit disk graphs...69–91 Recursive tilings and space-filling curves with little fragmentation...92–127 Points with large quadrant depth...128–143 Optimally fast incremental Manhattan plane embedding and planar tight span construction...144–182 $d$-representability of simplicial complexes of fixed dimension...183–188 A fixed-parameter algorithm for the minimum Manhattan network problem...189–204