| 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 | 26 | 2022 |
| Online minimum cost matching with recourse on the line N Megow, L Nölke Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020 | 18 | 2020 |
| 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 | 11 | 2023 |
| 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 | 7 | 2020 |
| On the complexity of anchored rectangle packing A Antoniadis, F Biermeier, A Cristi, C Damerius, R Hoeksma, D Kaaser, ... 27th Annual European Symposium on Algorithms (ESA 2019), 8: 1-8: 14, 2019 | 6 | 2019 |
| Computing a minimum-cost k-hop steiner tree in tree-like metrics M Böhm, R Hoeksma, N Megow, L Nölke, B Simon | 2 | 2020 |
| Speed robust scheduling supplemental material F Eberle, R Hoeksma, N Megow, L Nölke, K Schewior, B Simon | 1 | 2021 |
| Online minimum cost matching on the line with recourse N Megow, L Nölke arXiv preprint arXiv:2001.03107, 2020 | 1 | 2020 |
| 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) D Král, N Bertrand, S Cabello, M Wootters, D Ağaoğlu, P Hliněný, J Ahn, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | 1 | 2020 |
| Matching and packing problems–optimization under uncertainty in theory and practice L Nölke Universität Bremen, 2023 | | 2023 |
| On Minimum Generalized Manhattan Connections A Antoniadis, M Capretto, P Chalermsook, C Damerius, P Kling, L Nölke, ... Algorithms and Data Structures: 17th International Symposium, WADS 2021 …, 2021 | | 2021 |
| Speed-Robust Scheduling F Eberle, R Hoeksma, N Megow, L Nölke, K Schewior, B Simon | | 2020 |
