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
10 2020 Online node-and edge-deletion problems with advice LH Chen, LJ Hung, H Lotze, P Rossmanith
Algorithmica 83 (9), 2719-2753, 2021
4 2021 The Secretary Problem with Reservation Costs E Burjons, M Gehnen, H Lotze, D Mock, P Rossmanith
International Computing and Combinatorics Conference, 553-564, 2021
3 2021 Automated Optimization in Production Planning H Lotze
Masterarbeit, RWTH Aachen, 2018
2 2018 Hard Problems on Random Graphs J Dreier, H Lotze, P Rossmanith
47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020
1 2020 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
1 2020 Delaying Decisions and Reservation Costs E Burjons, F Frei, M Gehnen, H Lotze, D Mock, P Rossmanith
arXiv preprint arXiv:2307.07284, 2023
2023 Advice Complexity Bounds for Online Delayed H -Node- and H -Edge-Deletion Problems N Berndt, H Lotze
International Workshop on Combinatorial Algorithms, 62-73, 2023
2023 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
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
2022 Online Simple Knapsack with Reservation Costs E Burjons, H Lotze, P Rossmanith
2021 