| 1 | -- | 20 | Michael A. Bekos, Chrysanthi N. Raftopoulou. On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs |
| 21 | -- | 74 | Menelaos I. Karavelas, Christos Konaxis, Eleni Tzanaki. The maximum number of faces of the Minkowski sum of three convex polytopes |
| 75 | -- | 98 | Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Bettina Speckmann, Frank Staals. Trajectory grouping structure |
| 99 | -- | 107 | Pedro Martín, Horst Martini. Algorithms for ball hulls and ball intersections in normed planes |
| 108 | -- | 141 | William Evans, Noushin Saeedi. On characterizing terrain visibility graphs |
| 142 | -- | 164 | Luc Devroye, James King 0001. Random hyperplane search trees in high dimensions |
| 165 | -- | 184 | Magnus Lie Hetland. Ptolemaic indexing |
| 185 | -- | 219 | Andrei Asinowski, Tillmann Miltzow, Günter Rote. Quasi-parallel segments and characterization of unique bichromatic matchings |
| 220 | -- | 234 | Santanu Bhowmick, Kasturi R. Varadarajan, Shi-Ke Xue. A constant-factor approximation for multi-covering with disks |
| 235 | -- | 248 | Ronald Ortner. Forcing subarrangements in complete arrangements of pseudocircles |
| 249 | -- | 287 | Christian Scheffer, Jan Vahrenhold. Subquadratic medial-axis approximation in $\mathbb{R}^3$ |
| 288 | -- | 299 | John C. Baez, Karine Bagdasaryan, Philip Gibbs. The Lebesgue universal covering problem |
| 300 | -- | 315 | Balázs Keszegh, Dömötör Pálvölgyi. More on decomposing coverings by octants |
| 316 | -- | 345 | Danny Z. Chen, Haitao Wang. A new algorithm for computing visibility graphs of polygonal obstacles in the plane |