Split Packing: An Algorithm for Packing Circles with Optimal Worst-Case Density. - Sebastian Morr (SODA, 2017)

Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density. - Sándor P. Fekete; Sebastian Morr; Christian Scheffer (WADS, 2017)

Exact Minkowski sums of polygons with holes. - Alon Baram; Efi Fogel; Dan Halperin; Michael Hemmer; Sebastian Morr (Comput. Geom., 2018)

Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition). - Aaron T. Becker; Sándor P. Fekete; Phillip Keldenich; Sebastian Morr; Christian Scheffer (SoCG, 2019)

Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density. - Sándor P. Fekete; Sebastian Morr; Christian Scheffer (Discret. Comput. Geom., 2019)

Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition). - Aaron T. Becker; Sándor P. Fekete; Matthias Konitzny; Sebastian Morr; Arne Schmidt 001 (SoCG, 2021)