Data Structures and Efficient Algorithms
Chair: Prof. Dr. Matthias Müller-Hannemann
Our group works in the field of algorithm engineering: For complex problems from different application areas, we try to develop and improve efficient algorithms, to implement them carefully on modern hardware, and to evaluate them by experiments.
The main focus is on graph algorithms and combinatorial optimization, applications come from the areas of network analysis, optimization problems in public transport (timetable information, delay management, passenger flows) as well as from bio- and cheminformatics.
News
- new BMBF funded project (2024-2028): DiP: SMART-Agroforst
- Jördis-Ann Schüler, Annemarie E. Kramell, Antonia Schmidt, Pauline D. Walesch, René Csuk. Prediction of Fragmentation Pathway of Natural Products, Antibiotics, and Pesticides by ChemFrag . J Mass Spectrom. 2025 May;60(5):e5129. doi: 10.1002/jms.5129 .
- Julia Meusel, Matthias Müller-Hannemann, Klaus Reinhardt . Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases. Full paper: http://arxiv.org/abs/2504.07920 . Short version appears as a Brief Announcement in SAND 2025.
- Frederik L. Jatzkowski, Antonia Schmidt, Robert Mank, Steffen Schüler, and Matthias Müller-Hannemann
Barcode Selection and Layout Optimization in Spatial Transcriptomics. In 22nd International Symposium on Experimental Algorithms (SEA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 301, pp. 17:1-17:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.SEA.2024.17 (best paper)
- Julian Patzner and Matthias Müller-Hannemann
Dynamic Traffic Assignment for Public Transport with Vehicle Capacities. In 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024). Open Access Series in Informatics (OASIcs), Volume 123, pp. 18:1-18:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/OASIcs.ATMOS.2024.18 Full version http://arxiv.org/abs/2408.06308 .
}