Nadja Seiferth

According to our database, Nadja Seiferth authored at least 6 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Framework for ∃ ℝ-Completeness of Two-Dimensional Packing Problems.

Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth

TheoretiCS, 2024

2022

Algorithmic Aspects of Packing Problems

Nadja Seiferth

PhD thesis, 2022

2020

Plane Spanning Trees in Edge-Colored Simple Drawings of K_n.

Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber, Alexandra Weinberger

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Framework for ER-Completeness of Two-Dimensional Packing Problems.

Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Packing 2D Disks into a 3D Container.

Helmut Alt, Otfried Cheong, Ji-won Park, Nadja Scharf

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

2018

Approximating Smallest Containers for Packing Three-Dimensional Convex Objects.

Helmut Alt, Nadja Scharf

Int. J. Comput. Geom. Appl., 2018