A QPTAS for the General Scheduling Problem with Identical Release Dates. - Antonios Antoniadis 001; Ruben Hoeksma; Julie Meißner; José Verschae; Andreas Wiese (ICALP, 2017)

Randomization Helps Computing a Minimum Spanning Tree under Uncertainty. - Nicole Megow; Julie Meißner; Martin Skutella (SIAM J. Comput., 2017)

Scheduling with Explorable Uncertainty. - Christoph Dürr; Thomas Erlebach; Nicole Megow; Julie Meißner (ITCS, 2018)

Uncertainty exploration (algorithms, competitive analysis, and computational experiments) (Explorierbare Unsicherheit) (Algorithmen, kompetitive Analyse und Computerexperimente) - Julie Meißner (2018)

Scheduling maintenance jobs in networks. - Fidaa Abed; Lin Chen 009; Yann Disser; Martin Groß 001; Nicole Megow; Julie Meißner; Alexander T. Richter; Roman Rischke (Theor. Comput. Sci., 2019)

An Adversarial Model for Scheduling with Testing. - Christoph Dürr; Thomas Erlebach; Nicole Megow; Julie Meißner (Algorithmica, 2020)

Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments. - Jacob Focke; Nicole Megow; Julie Meißner (ACM J. Exp. Algorithmics, 2020)

Tight Bounds for Online TSP on the Line. - Antje Bjelde; Jan Hackfeld; Yann Disser; Christoph Hansknecht; Maarten Lipmann; Julie Meißner; Miriam Schlöter; Kevin Schewior; Leen Stougie (ACM Trans. Algorithms, 2021)