On index policies for stochastic minsum scheduling. - Franziska Eberle; Felix A. Fischer; Jannik Matuschke; Nicole Megow (Oper. Res. Lett., 2019)

Optimally Handling Commitment Issues in Online Throughput Maximization. - Franziska Eberle; Nicole Megow; Kevin Schewior (ESA, 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)

A general framework for handling commitment in online throughput maximization. - Lin Chen 009; Franziska Eberle; Nicole Megow; Kevin Schewior; Clifford Stein 001 (Math. Program., 2020)

Scheduling and Packing Under Uncertainty - Franziska Eberle (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)

Scheduling and Packing Under Uncertainty. - Franziska Eberle (OR, 2021)

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

Optimally handling commitment issues in online throughput maximization. - Franziska Eberle (ISAIM, 2022)

Online load balancing with general reassignment cost. - Sebastian Berndt 001; Franziska Eberle; Nicole Megow (Oper. Res. Lett., 2022)

Online Throughput Maximization on Unrelated Machines: Commitment is No Burden. - Franziska Eberle; Nicole Megow; Kevin Schewior (ACM Trans. Algorithms, 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)

Scheduling on a Stochastic Number of Machines. - Moritz Buchem; Franziska Eberle; Hugo Kooki Kasuya Rosado; Kevin Schewior; Andreas Wiese (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)

O(1/ε) Is the Answer in Online Weighted Throughput Maximization. - Franziska Eberle (STACS, 2024)

A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing. - Franziska Eberle; Felix Hommelsheim; Malin Rau; Stefan Walzer (CoRR, 2024)

A Tight (3/2 + ∈ )-Approximation Algorithm for Demand Strip Packing. - Franziska Eberle; Felix Hommelsheim; Malin Rau; Stefan Walzer (SODA, 2025)

Configuration balancing for stochastic requests. - Franziska Eberle; Anupam Gupta 001; Nicole Megow; Benjamin Moseley; Rudy Zhou (Math. Program., 2025)