Permutation Predictions for Non-Clairvoyant Scheduling A Lindermayr, N Megow Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022 | 24 | 2022 |
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 | 21 | 2022 |
Elimination distance to bounded degree on planar graphs A Lindermayr, S Siebertz, A Vigny arXiv preprint arXiv:2007.02413, 2020 | 18 | 2020 |
Double coverage with machine-learned advice A Lindermayr, N Megow, B Simon arXiv preprint arXiv:2103.01640, 2021 | 15 | 2021 |
Algorithms with predictions A Lindermayr, N Megow URL https://algorithms-with-predictions. github. io, 2022 | 9 | 2022 |
A universal error measure for input predictions applied to online graph problems G Bernardini, A Lindermayr, A Marchetti-Spaccamela, N Megow, ... Advances in Neural Information Processing Systems 35, 3178-3190, 2022 | 8 | 2022 |
Non-Clairvoyant Scheduling with Predictions Revisited A Lindermayr, N Megow arXiv preprint arXiv:2202.10199, 2022 | 4 | 2022 |
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary A Lindermayr, N Megow, M Rapp arXiv preprint arXiv:2302.00985, 2023 | 2 | 2023 |
Minimalistic predictions to schedule jobs with online precedence constraints AA Lassota, A Lindermayr, N Megow, J Schlöter International Conference on Machine Learning, 18563-18583, 2023 | 1 | 2023 |
Invasive Computing N Anantharajaiah, T Asfour, M Bader, L Bauer, J Becker, S Bischof, ... FAU University Press, 2022 | 1 | 2022 |
Learning-augmented online algorithms for the 2-server problem on the line and generalizations A Lindermayr Master’s thesis, University of Bremen, Germany, 2020 | 1 | 2020 |
Santa Claus meets Makespan and Matroids: Algorithms and Reductions É Bamas, A Lindermayr, N Megow, L Rohwedder, J Schlöter arXiv preprint arXiv:2307.08453, 2023 | | 2023 |
4 Scheduling Invasive Multicore Programs Under Uncertainty N Megow, A Lindermayr, B Simon Teich/Henkel/Herkersdorf (Eds.), 123, 0 | | |