| Online simple knapsack with reservation costs HJ Böckenhauer, E Burjons, F Frei, J Hromkovic, H Lotze, P Rossmanith arXiv preprint arXiv:2009.14043, 2020 | 18 | 2020 |
| Online node-and edge-deletion problems with advice LH Chen, LJ Hung, H Lotze, P Rossmanith Algorithmica 83 (9), 2719-2753, 2021 | 10 | 2021 |
| Advice Complexity Bounds for Online Delayed -Node-, H-Node- and H-Edge-Deletion Problems N Berndt, H Lotze International Workshop on Combinatorial Algorithms, 62-73, 2023 | 6 | 2023 |
| The secretary problem with reservation costs E Burjons, M Gehnen, H Lotze, D Mock, P Rossmanith International Computing and Combinatorics Conference, 553-564, 2021 | 6 | 2021 |
| Hard problems on random graphs J Dreier, H Lotze, P Rossmanith 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020 | 3 | 2020 |
| Automated Optimization in Production Planning H Lotze Masterarbeit, RWTH Aachen, 2018 | 3 | 2018 |
| Further results on online node-and edge-deletion problems with advice LH Chen, LJ Hung, H Lotze, P Rossmanith Combinatorial Algorithms: 31st International Workshop, IWOCA 2020, Bordeaux …, 2020 | 2 | 2020 |
| Online Simple Knapsack with Bounded Predictions M Gehnen, H Lotze, P Rossmanith 41st International Symposium on Theoretical Aspects of Computer Science …, 2024 | 1 | 2024 |
| The online simple knapsack problem with reservation and removability E Burjons, M Gehnen, H Lotze, D Mock, P Rossmanith 48th International Symposium on Mathematical Foundations of Computer Science …, 2023 | 1 | 2023 |
| The slotted online one-sided crossing minimization problem on 2-regular graphs E Burjons, J Fuchs, H Lotze International Workshop on Combinatorial Algorithms, 243-256, 2022 | 1 | 2022 |
| Online Unbounded Knapsack HJ Böckenhauer, M Gehnen, J Hromkovič, R Klasing, D Komm, H Lotze, ... arXiv preprint arXiv:2407.02045, 2024 | | 2024 |
| Delaying Decisions and Reservation Costs E Burjons, F Frei, M Gehnen, H Lotze, D Mock, P Rossmanith International Computing and Combinatorics Conference, 371-383, 2023 | | 2023 |
| The online simple knapsack problem with reservation and removability E Burjons Pujol, M Gehnen, H Lotze, D Mock, P Rossmanith 48th International Symposium on Mathematical Foundations of Computer Science …, 2023 | | 2023 |
| 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) M Bonamy, J Boyar, A Czumaj, L Kovács, N Klobas, GB Mertzios, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2023 | | 2023 |
| Going offline-delays, reservations and predictions in online computation H Lotze Dissertation, RWTH Aachen University, 2023, 2023 | | 2023 |
| 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) M Bläser, B Monmege Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2021 | | 2021 |
| Online Simple Knapsack with Reservation Costs E Burjons, H Lotze, P Rossmanith | | 2021 |
| The Advice Complexity of Delayed F-Node-Deletion Problems and of Disconnected Delayed H-Edge-Deletion Problems N Berndt, H Lotze Available at SSRN 4821443, 0 | | |
