On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems. - Alberto Marchetti-Spaccamela; Nicole Megow; Jens Schlöter; Martin Skutella; Leen Stougie (IPDPS, 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)

Untrusted Predictions Improve Trustable Query Policies. - Thomas Erlebach; Michael Hoffmann 002; Murilo S. de Lima; Nicole Megow; Jens Schlöter (CoRR, 2020)

Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. - Evripidis Bampis; Christoph Dürr; Thomas Erlebach; Murilo Santos de Lima; Nicole Megow; Jens Schlöter (ESA, 2021)

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

Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. - Thomas Erlebach; Murilo Santos de Lima; Nicole Megow; Jens Schlöter (ESA, 2022)

Throughput scheduling with equal additive laxity. - Martin Böhm 001; Nicole Megow; Jens Schlöter (Oper. Res. Lett., 2022)

Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints. - Alexandra Anna Lassota; Alexander Lindermayr; Nicole Megow; Jens Schlöter (ICML, 2023)

Sorting and Hypergraph Orientation under Uncertainty with Predictions. - Thomas Erlebach; Murilo S. de Lima; Nicole Megow; Jens Schlöter (IJCAI, 2023)

Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques. - Nicole Megow; Jens Schlöter (IPCO, 2023)

Optimierung unter Erforschbarer Unsicherheit: Jenseits des Worst-Case. - Jens Schlöter (Ausgezeichnete Informatikdissertationen, 2023)

Scheduling (Dagstuhl Seminar 23061). - Nicole Megow; Benjamin Moseley; David B. Shmoys; Ola Svensson; Sergei Vassilvitskii; Jens Schlöter (Dagstuhl Reports, 2023)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. - Evripidis Bampis; Konstantinos Dogeas; Thomas Erlebach; Nicole Megow; Jens Schlöter; Amitabh Trehan (APPROX/RANDOM, 2024)

Accelerating Matroid Optimization through Fast Imprecise Oracles. - Franziska Eberle; Felix Hommelsheim; Alexander Lindermayr; Zhenwei Liu; Nicole Megow; Jens Schlöter (NeurIPS, 2024)

Santa Claus meets Makespan and Matroids: Algorithms and Reductions. - Étienne Bamas; Alexander Lindermayr; Nicole Megow; Lars Rohwedder; Jens Schlöter (SODA, 2024)

On the Complexity of Knapsack under Explorable Uncertainty: Hardness and Algorithms. - Jens Schlöter (CoRR, 2025)