Approximating Smallest Containers for Packing Three-Dimensional Convex Objects. - Helmut Alt; Nadja Scharf (Int. J. Comput. Geom. Appl., 2018)

Packing 2D Disks into a 3D Container. - Helmut Alt; Otfried Cheong; Ji-won Park; Nadja Scharf (WALCOM, 2019)

Framework for ER-Completeness of Two-Dimensional Packing Problems. - Mikkel Abrahamsen; Tillmann Miltzow; Nadja Seiferth (FOCS, 2020)

Plane Spanning Trees in Edge-Colored Simple Drawings of Kn. - Oswin Aichholzer; Michael Hoffmann 001; Johannes Obenaus; Rosna Paul; Daniel Perz; Nadja Seiferth; Birgit Vogtenhuber; Alexandra Weinberger (GD, 2020)

Algorithmic Aspects of Packing Problems - Nadja Seiferth (2022)

Framework for ∃ ℝ-Completeness of Two-Dimensional Packing Problems. - Mikkel Abrahamsen; Tillmann Miltzow; Nadja Seiferth (TheoretiCS, 2024)