Minimum Polygons for Fixed Visibility VC-Dimension. - Moritz Beck 001; Sabine Storandt (IWOCA, 2018)

Planar Steiner Orientation is NP-complete. - Moritz Beck 001; Johannes Blum 001; Myroslav Kryven; Andre Löffler; Johannes Zink 001 (CoRR, 2018)

Concatenated k-Path Covers. - Moritz Beck 001; Kam-yiu Lam; Joseph Kee-Yin Ng; Sabine Storandt; Chun Jiang Zhu (ALENEX, 2019)

Puzzling Grid Embeddings. - Moritz Beck 001; Sabine Storandt (ALENEX, 2020)

Remotely Useful Greedy Algorithms. - Moritz Beck 001 (COCOA, 2020)

Emptiness problems for integer circuits. - Dominik Barth; Moritz Beck 001; Titus Dose; Christian Glaßer; Larissa Michler; Marc Technau (Theor. Comput. Sci., 2020)

Mind the Gap: Edge Facility Location Problems in Theory and Practice. - Moritz Beck 001; Joachim Spoerhase; Sabine Storandt (CALDAM, 2023)

Concatenated k-path covers. - Moritz Beck 001; Kam-Yiu Lam; Joseph Kee-Yin Ng; Sabine Storandt; Chun Jiang Zhu (Int. J. Comput. Math. Comput. Syst. Theory, 2023)