- Sang Won Bae. Computing a minimum-width square or rectangular annulus with outliers. Comput. Geom., 76:33-45, 2019.
- Eunjin Oh 0001, Sang Won Bae, Hee-Kap Ahn. Computing a geodesic two-center of points in a simple polygon. Comput. Geom., 82:45-59, 2019.
- Mark de Berg, Aleksandar Markovic 0001. Dynamic conflict-free colorings in the plane. Comput. Geom., 78:61-73, 2019.
- Davood Bakhshesh, Mohammad Farshi. (Weakly) Self-approaching geometric graphs and spanners. Comput. Geom., 78:20-36, 2019.
- Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy. Covering segments with unit squares. Comput. Geom., 79:1-13, 2019.
- Eunjin Oh 0001, Hee-Kap Ahn. Assigning weights to minimize the covering radius in the plane. Comput. Geom., 81:22-32, 2019.
- Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, André van Renssen, Marcel Roeloffzen, Günter Rote, Birgit Vogtenhuber. Packing plane spanning graphs with short edges in complete geometric graphs. Comput. Geom., 82:1-15, 2019.
- Hee-Kap Ahn, Judit Abardia, Sang Won Bae, Otfried Cheong, Susanna Dann, Dongwoo Park, Chan-Su Shin. The minimum convex container of two convex polytopes under translations. Comput. Geom., 77:40-50, 2019.
- Paz Carmi, Lilach Chaitman-Yerushalmi, Bat-Chen Ozeri. Minimizing the sum of distances to a server in a constraint network. Comput. Geom., 80:1-12, 2019.
- Sang Won Bae, Chan-Su Shin, Antoine Vigneron. Tight bounds for beacon-based coverage in simple rectilinear polygons. Comput. Geom., 80:40-52, 2019.