Franziska Eberle

Orcid: 0000-0001-8636-9711

Affiliations:
  • Technische Universität Berlin, Germany
  • London School of Economics and Political Science, UK (former)
  • Bremen University, Germany (former)


According to our database1, Franziska Eberle authored at least 19 papers between 2019 and 2025.

Collaborative distances:

Timeline

2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
6
1
2
1
3
1
1
3
1
2
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A Tight (3/2 + <i>∈</i> )-Approximation Algorithm for Demand Strip Packing.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024
A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing.
CoRR, 2024

O(1/ε) Is the Answer in Online Weighted Throughput Maximization.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Accelerating Matroid Optimization through Fast Imprecise Oracles.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Scheduling on a Stochastic Number of Machines.
Proceedings of the Approximation, 2024

2023
Speed-robust scheduling: sand, bricks, and rocks.
Math. Program., February, 2023

Online Throughput Maximization on Unrelated Machines: Commitment is No Burden.
ACM Trans. Algorithms, January, 2023

Configuration Balancing for Stochastic Requests.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022
Online load balancing with general reassignment cost.
Oper. Res. Lett., 2022

Optimally handling commitment issues in online throughput maximization.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

Robustification of Online Graph Exploration Methods.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Scheduling and Packing Under Uncertainty.
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.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020
Scheduling and Packing Under Uncertainty
PhD thesis, 2020

A general framework for handling commitment in online throughput maximization.
Math. Program., 2020

Speed-Robust Scheduling.
CoRR, 2020

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
CoRR, 2020

Optimally Handling Commitment Issues in Online Throughput Maximization.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
On index policies for stochastic minsum scheduling.
Oper. Res. Lett., 2019


  Loading...