Contact
Algorithms and Complexity
Computer Science 1
RWTH Aachen University
Ahornstrasse 55
D-52074 Aachen
Secretary Office:
Erika Schlebusch
Informatikzentrum, E1
Room 4023
Tel.: +49 (0) 241 80-21101
Two Papers at MFCS 2025 27 Jun 2025
Two papers of our group were accepted at the 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025).
- Online Knapsack Problems with Estimates
(by Jakub Balaban, Matthias Gehnen, Henri Lotze, Finn Seesemann, Moritz Stocker) - On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
(by Christoph Grüne, Lasse Wulf)
Dissertation Defense 15 May 2025
Marco Schmalhofer successfully defended his thesis entitled Algorithmic Aspects of Fair Division. Congratulations to Dr. Schmalhofer!
New Paper at EC 2025 14 May 2025
Our paper "Welfare and Beyond in Multi-Agent Contracts" (by Gil Aharoni, Martin Hoefer, Inbal Talgam-Cohen) was accepted at the 26th Conference on Economics and Computation (EC 2025), the international top conference at the intersection of economics and computer science.
New Paper at SAND 2025 28 Mar 2025
Our paper "Dynamic Debt Swapping in Financial Networks" (by Henri Froese, Martin Hoefer, Lisa Wilhelmi) was accepted at the 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025).
New Paper in Operations Research, Data Analytics and Logistics 14 Mar 2025
In events of distress, an available naval rescue vessel from a home station with the lowest response time is dispatched. But how should rescue vessels be allocated to home stations when their operational availability changes over time due to low tides? In our paper "Rescue Vessel Allocation in Tidal Waters of the North and Baltic Sea" (by Tom Mucke, Alexander Renneke, Finn Seesemann, Felix Engelhardt) we build a mathematical model for this problem. We show that optimizing expected response times to distress calls is NP-hard. However, we provide an Integer Programming formulation and propose two methods of simplifying the model. We then compare the effectiveness of the models in a case study based on real-world data. Results show that the simplified models can be solved to de facto optimality, outperforming the results attained by the full model. The paper has been accepted for publication in Operations Research, Data Analytics and Logistics (formerly known as Operations Research for Health Care).