Forschungsbericht 2025

Algorithmen und Komplexität E-11

Leitung: Mnich, Matthias

Institut auf TORE
Institutswebsite

Publikationen

• Finding subdigraphs in digraphs of bounded directed treewidth - Conference Paper
  Lopes, Raul; Sau, Ignasi
  13th Latin American Algorithms, Graphs, and Optimization Symposium, LAGOS 2025
  Open Access | Publisher DOI
  
  
• A survey on graph problems parameterized above and below guaranteed values - Review Article
  Gutin, Gregory Z.; Mnich, Matthias
  Computer Science Review 58: 100795 (2025)
  Open Access | Publisher DOI
  
  
• Revisiting directed disjoint paths on tournaments (and relatives) - Conference Paper
  De Castro Mendes Gomes Guilherme; Teixeira Lopes, Raul Wayne; Sau, Ignasi
  52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025
  Open Access | Publisher DOI
  
  
• A quasi-polynomial time algorithm for multi-arrival on tree-like multigraphs - Conference Paper
  Ghorbani, Ebrahim; Hoff, Jonah Leander; Mnich, Matthias
  42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025
  Open Access | Publisher DOI
  
  
• Approximate minimum tree cover in all symmetric monotone norms simultaneously - Conference Paper
  Kaul, Matthias; Luo, Kelin; Mnich, Matthias; Röglin, Heiko
  42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025
  Open Access | Publisher DOI
  
  
• The vector space generated by permutations of a trade or a design - Journal Article
  Ghorbani, Ebrahim; Kamali, S.; Khosrovshahi, Gholamreza B.
  Journal of Combinatorial Theory, Series A (2025)
  Publisher DOI
  
  
• Envy-Free Dynamic Pricing Schemes - Journal Article
  Bérczi, Kristóf; Codazzi, Laura; Golak, Julian Arthur Pawel; Grigoriev, Alexander
  Operations Research (2025)
  Publisher DOI
  
  
• Parameterized approximation algorithms for optimization problems on graphs - Doctoral Thesis
  Kaul, Matthias
  Technische Universität Hamburg (2025)
  Open Access
  
  
• Space-efficient parameterized algorithms on graphs of low shrubdepth - Journal Article
  Bergougnoux, Benjamin; Chekan, Vera; Ganian, Robert; Kanté, Mamadou Moustapha; Mnich, Matthias; Oum, Sang-il; Pilipczuk, Michał; Leeuwen, Erik Jan van
  ACM Transactions on Computation Theory 17 (3): 1-42 (2025)
  Open Access | Publisher DOI
  
  

Projekte

• Hamburg Quantencomputing HQC - Teilprojekt P09: Fast Quantum Algorithms for Hard Optimization Problems
  Hamburgische Investitions- und Förderbank; Laufzeit 2023-2028
  Projektleitung: Mnich, Matthias
  Mitarbeitende: Sipos, David; Economides, Constantin; Yavuz, Mahmut Can
  
  
• New algorithmic approaches to macromolecular crystallographic analysis
  Helmholtz Association of German Research Centres; Laufzeit 2023-2026
  Projektleitung: Mnich, Matthias
  Mitarbeitende: Bielfeldt, Sebastian
  Externe beteiligte Einrichtungen: Deutsches Elektronen-Synchrotron DESY
  
  
• Data-driven decentralized energy trading
  Behörde für Wissenschaft, Forschung und Gleichstellung; Laufzeit 2021-2025
  Projektleitung: Mnich, Matthias
  
  
• Multivariate Algorithmen für Scheduling mit hoher Multiplizität
  Deutsche Forschungsgemeinschaft (DFG); Laufzeit 2019-2026
  Projektleitung: Mnich, Matthias