| Robustification of online graph exploration methods F Eberle, A Lindermayr, N Megow, L Nölke, J Schlöter Proceedings of the AAAI Conference on Artificial Intelligence 36 (9), 9732-9740, 2022 | 20 | 2022 |
| A general framework for handling commitment in online throughput maximization L Chen, F Eberle, N Megow, K Schewior, C Stein Mathematical programming 183 (1), 215-247, 2020 | 16 | 2020 |
| On index policies for stochastic minsum scheduling F Eberle, F Fischer, J Matuschke, N Megow Operations Research Letters 47 (3), 213-218, 2019 | 7 | 2019 |
| Fully dynamic algorithms for knapsack problems with polylogarithmic update time F Eberle, N Megow, L Nölke, B Simon, A Wiese arXiv preprint arXiv:2007.08415, 2020 | 6 | 2020 |
| Optimally handling commitment issues in online throughput maximization F Eberle, N Megow, K Schewior 28th Annual European Symposium on Algorithms (ESA 2020), 2020 | 6 | 2020 |
| Online throughput maximization on unrelated machines: Commitment is no burden F Eberle, N Megow, K Schewior ACM Transactions on Algorithms 19 (1), 1-25, 2023 | 4 | 2023 |
| Speed-Robust Scheduling: Sand, Bricks, and Rocks F Eberle, R Hoeksma, N Megow, L Nölke, K Schewior, B Simon Integer Programming and Combinatorial Optimization: 22nd International …, 2021 | 3 | 2021 |
| Configuration balancing for stochastic requests F Eberle, A Gupta, N Megow, B Moseley, R Zhou International Conference on Integer Programming and Combinatorial …, 2023 | 2 | 2023 |
| Online load balancing with general reassignment cost S Berndt, F Eberle, N Megow Operations Research Letters 50 (3), 322-328, 2022 | 2 | 2022 |
| Speed robust scheduling supplemental material F Eberle, R Hoeksma, N Megow, L Nölke, K Schewior, B Simon | 2 | 2021 |
| Speed-robust scheduling: sand, bricks, and rocks F Eberle, R Hoeksma, N Megow, L Nölke, K Schewior, B Simon Mathematical Programming 197 (2), 1009-1048, 2023 | 1 | 2023 |
| Scheduling and packing under uncertainty F Eberle International Conference on Operations Research, 9-14, 2021 | 1 | 2021 |
| Accelerating Matroid Optimization through Fast Imprecise Oracles F Eberle, F Hommelsheim, A Lindermayr, Z Liu, N Megow, J Schlöter arXiv preprint arXiv:2402.02774, 2024 | | 2024 |
| O (1/ε) Is the Answer in Online Weighted Throughput Maximization F Eberle 41st International Symposium on Theoretical Aspects of Computer Science …, 2024 | | 2024 |
| is the answer in online weighted throughput maximization F Eberle arXiv preprint arXiv:2310.16697, 2023 | | 2023 |
| A general framework for handling commitment in online admission control L Chen, F Eberle, N Megow, K Schewior, C Stein Conference on Integer Programming and Combinatorial Optimization (IPCO), 141-154, 2019 | | 2019 |
