On the Complexity of Anchored Rectangle Packing. - Antonios Antoniadis 001; Felix Biermeier; Andrés Cristi; Christoph Damerius; Ruben Hoeksma; Dominik Kaaser; Peter Kling; Lukas Nölke (ESA, 2019)

Online Minimum Cost Matching with Recourse on the Line. - Nicole Megow; Lukas Nölke (APPROX-RANDOM, 2020)

Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics. - Martin Böhm 001; Ruben Hoeksma; Nicole Megow; Lukas Nölke; Bertrand Simon 001 (MFCS, 2020)

Online Minimum Cost Matching on the Line with Recourse. - Nicole Megow; Lukas Nölke (CoRR, 2020)

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. - Martin Böhm 001; Franziska Eberle; Nicole Megow; Lukas Nölke; Jens Schlöter; Bertrand Simon 001; Andreas Wiese (CoRR, 2020)

Speed-Robust Scheduling. - Franziska Eberle; Ruben Hoeksma; Nicole Megow; Lukas Nölke; Kevin Schewior; Bertrand Simon 001 (CoRR, 2020)

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. - Franziska Eberle; Nicole Megow; Lukas Nölke; Bertrand Simon 001; Andreas Wiese (FSTTCS, 2021)

On Minimum Generalized Manhattan Connections. - Antonios Antoniadis 001; Margarita Capretto; Parinya Chalermsook; Christoph Damerius; Peter Kling; Lukas Nölke; Nidia Obscura Acosta; Joachim Spoerhase (WADS, 2021)

Robustification of Online Graph Exploration Methods. - Franziska Eberle; Alexander Lindermayr; Nicole Megow; Lukas Nölke; Jens Schlöter (AAAI, 2022)

On Hop-Constrained Steiner Trees in Tree-Like Metrics. - Martin Böhm 001; Ruben Hoeksma; Nicole Megow; Lukas Nölke; Bertrand Simon 001 (SIAM J. Discret. Math., 2022)

Matching and packing problems - optimization under uncertainty in theory and practice - Lukas Nölke (2023)

Speed-robust scheduling: sand, bricks, and rocks. - Franziska Eberle; Ruben Hoeksma; Nicole Megow; Lukas Nölke; Kevin Schewior; Bertrand Simon 001 (Math. Program., 2023)

Online Metric Matching on the Line with Recourse. - Nicole Megow; Lukas Nölke (Algorithmica, 2025)