Prof. Dr. Matthias Mnich

Head of the Institute for Algorithms and Complexity at TUHH - Hamburg University of Technology

Deputy Dean International of the School of Electrical Engineering, Computer Science and Mathematics at TUHH - Hamburg University of Technology

Principal Investigator at the Helmholtz Graduate School for the Structure of Matter

• Matthias Kaul, PhD 2024. First job after graduation: postdoc at the University of Bonn
• Roland Vincze, PhD 2022. First job after graduation: postdoc at University of Augsburg
• Alexander Göke, PhD 2021. First job after graduation: software developer.

• PATTERN (2025 - 2031)
• Hamburg Quantum Computing (2024 - 2029)
• Multivariate algorithms for high-multiplicity scheduling (2018 - 2025)
• New algorithmic approaches to macromolecular crystallographic analysis (2021 - 2026)
• Data-driven decentralized energy trading (2021 - 2025)
• Kernelization for big data (2014 - 2021)
• A fixed-parameter approach towards combinatorial optimization (2019 - 2021)

• PC member of ECAI 2025 (European Conference on Artificial Intelligence)
• PC member of COCOON 2025 (International Computing and Combinatorics Conference)
• PC member of ESA 2024 (European Symposium on Algorithms)
• PC member of ISAAC 2024 (International Symposium on Algorithms and Computation)
• PC member of CMSC 2024 (Creative Mathematical Sciences Conference)
• PC member of FCT 2023 (International Symposium on Fundamentals in Computation Theory)
• PC member of SEA 2023 (International Symposium on Experimental Algorithms)
• PC member of STACS 2023 (Symposium on Theoretical Aspects of Computer Science)
• PC member of WAOA 2021 (Workshop on Approximation and Online Algorithms)
• PC member of IJCAI 2020 (International Joint Conference on Artificial Intelligence)
• PC member of IJCAI 2019 (International Joint Conference on Artificial Intelligence)
• PC member of ARDA 2019 (Advances in Reoptimization and Dynamic Algorithms)
• PC member of Euro-Par 2019 (International European Conference on Parallel and Distributed Computing)
• PC member of SWAT 2018 (Scandinavian Symposium and Workshops on Algorithm Theory)
• PC member of IJCAI 2018 (International Joint Conference on Artificial Intelligence)
• PC member of AAAI 2018 (AAAI Conference on Artificial Intelligence)

• Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay:
  No polynomial kernels for knapsack
  ICALP 2024
• Ariel Kulik, Matthias Mnich, Hadas Shachnai:
  Improved approximations for vector bin packing via iterative randomized rounding
  FOCS 2023
• Max Deppert, Matthias Kaul, Matthias Mnich:
  A (3/2+ε)-approximation for multiple TSP with a variable number of depots
  ESA 2023
• Alexander Göke, Dániel Marx, Matthias Mnich:
  Hitting long directed cycles is fixed-parameter tractable
  ICALP 2020
• André Berger, László Kozma, Matthias Mnich, Roland Vincze:
  Time- and space-optimal algorithms for the many-visits TSP
  SODA 2019
  ACM Transactions on Algorithms
  Presentation at Hausdorff Workshop on Combinatorial Optimization
• Anna Adamaszek, Matthias Mnich, Katarzyna Paluch:
  New approximation algorithms for (1,2)-TSP
  ICALP 2018
• John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani:
  Reachability switching games
  ICALP 2018
• Martin Koutecký, Dušan Knop, Matthias Mnich:
  Combinatorial n-fold integer programming and applications
  ESA 2017
  Mathematical Programming
• Josh Alman, Matthias Mnich, Virginia Vassilevska Williams:
  Dynamic parameterized problems and algorithms
  ICALP 2017
  ACM Transactions on Algorithms
• Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase:
  New algorithms for maximum disjoint paths based on tree-likeness
  ESA 2016
  Mathematical Programming
• Matthias Mnich, Virginia Vassilevska Williams, László A. Végh:
  A 7/3-approximation for feedback vertex sets in tournaments
  ESA 2016
  Presentation at Hausdorff Trimester in Combinatorial Optimization
• Zdeněk Dvořák, Matthias Mnich:
  Large independent sets in triangle-free planar graphs
  ESA 2014
  SIAM Journal on Discrete Mathematics
• Matthias Mnich, Andreas Wiese:
  Scheduling and fixed-parameter tractability
  IPCO 2014
  Mathematical Programming
• Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
  Parameterized complexity of induced H-matching on claw-free graphs
  ESA 2012
  Algorithmica
• Robert Crowston, Mark Jones, Matthias Mnich:
  Max-cut parameterized above the Edwards-Erdős-bound
  ICALP 2012
  Algorithmica
• Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger:
  Domination when the stars are out
  ICALP 2011
  ACM Transactions on Algorithms
• Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo:
  All ternary permutation constraint satisfaction problems parameterized above average have polynomial kernels
  ESA 2010
  Journal of Computer and System Sciences
• Serge Gaspers, Matthias Mnich:
  Feedback vertex sets in tournaments
  ESA 2010
  Journal of Graph Theory
• Ross Kang, Matthias Mnich, Tobias Müller:
  Induced matchings in subcubic planar graphs
  ESA 2010
  SIAM Journal on Discrete Mathematics