1 | -- | 10 | Helmut Alt, Mark de Berg, Christian Knauer. Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons |
11 | -- | 31 | Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid. Towards plane spanners of degree 3 |
32 | -- | 46 | Jean-Lou De Carufel, Matthew J. Katz, Matias Korman, André van Renssen, Marcel Roeloffzen, Shakhar Smorodinsky. On interference among moving sensors and related problems |
47 | -- | 77 | Manuel Wettstein. Counting and enumerating crossing-free geometric graphs |
78 | -- | 104 | Stephane Durocher, Alexandre Leblanc, Matthew Skala. The projection median as a weighted average |
105 | -- | 124 | Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen. Time-space trade-offs for triangulating a simple polygon |
125 | -- | 152 | Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot. Competitive local routing with constraints |
153 | -- | 173 | Arnaud Bannier, Nicolas Bodin. A new drawing for simple Venn diagrams based on algebraic construction |
174 | -- | 205 | Boris Bukh, Po-Shen Loh, Gabriel Nivasch. Classifying unavoidable Tverberg partitions |
206 | -- | 281 | Herman Haverkort. How many three-dimensional Hilbert curves are there? |
282 | -- | 315 | Olivier Devillers, Menelaos Karavelas, Monique Teillaud. Qualitative symbolic perturbation: two applications of a new geometry-based perturbation framework |
316 | -- | 339 | David Eppstein. Maximizing the sum of radii of disjoint balls or disks |
340 | -- | 365 | Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann 0001, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt 0001, Julian Troegel. Computing nonsimple polygons of minimum perimeter |
366 | -- | 386 | Marc J. van Kreveld, Maarten Löffler, Frank Staals. Central trajectories |