Franziska Eberle

According to our database, Franziska Eberle authored at least 16 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Accelerating Matroid Optimization through Fast Imprecise Oracles.

Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter

CoRR, 2024

O(1/ε) Is the Answer in Online Weighted Throughput Maximization.

Franziska Eberle

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

Speed-robust scheduling: sand, bricks, and rocks.

Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon

Math. Program., February, 2023

Online Throughput Maximization on Unrelated Machines: Commitment is No Burden.

Franziska Eberle, Nicole Megow, Kevin Schewior

ACM Trans. Algorithms, January, 2023

Configuration Balancing for Stochastic Requests.

Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022

Online load balancing with general reassignment cost.

Sebastian Berndt, Franziska Eberle, Nicole Megow

Oper. Res. Lett., 2022

Optimally handling commitment issues in online throughput maximization.

Franziska Eberle

Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

Robustification of Online Graph Exploration Methods.

Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Scheduling and Packing Under Uncertainty.

Franziska Eberle

Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.

Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Scheduling and Packing Under Uncertainty

Franziska Eberle

PhD thesis, 2020

A general framework for handling commitment in online throughput maximization.

Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Clifford Stein

Math. Program., 2020

Speed-Robust Scheduling.

Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon

CoRR, 2020

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.

Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese

CoRR, 2020

Optimally Handling Commitment Issues in Online Throughput Maximization.

Franziska Eberle, Nicole Megow, Kevin Schewior

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

On index policies for stochastic minsum scheduling.

Franziska Eberle, Felix A. Fischer, Jannik Matuschke, Nicole Megow

Oper. Res. Lett., 2019