On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs...1–20 The maximum number of faces of the Minkowski sum of three convex polytopes...21–74 Trajectory grouping structure...75–98 Algorithms for ball hulls and ball intersections in normed planes...99–107 On characterizing terrain visibility graphs...108–141 Random hyperplane search trees in high dimensions...142–164 Ptolemaic indexing...165–184 Quasi-parallel segments and characterization of unique bichromatic matchings...185–219 A constant-factor approximation for multi-covering with disks...220–234 Forcing subarrangements in complete arrangements of pseudocircles...235–248 Subquadratic medial-axis approximation in $\mathbb{R}^3$...249–287 The Lebesgue universal covering problem...288–299 More on decomposing coverings by octants...300–315 A new algorithm for computing visibility graphs of polygonal obstacles in the plane...316–345