The Institute for Algorithms and Complexity is a research institute of TUHH - Hamburg University of Technology. It researches the design and development of efficient algorithmic methods for the solution of important computational problems with impact in business, engineering, the social sciences, and beyond. It offers undergraduate and graduate education in the fields of algorithms, computational complexity, and mathematical optimization to the students of TUHH.

2025

• August: Matthias Mnich is PC member of the 31st International Computing and Combinatorics Conference in Chengdu, China. Submit your contributions here.
• March: Paper accepted at the ACM Transactions on Computation Theory: Space-efficient parameterized algorithms on graphs of low shrubdepth (joint work by Benjamin Bergougnoux, Vera Chekan, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk and Erik Jan van Leeuwen).

2024

• December: PhD student Matthias Kaul successfully defended his PhD thesis Parameterized Approximation Algorithms for Optimization Problems on Graphs. Congratulations, Matthias, and best wishes for your future academic journey!
• December: Paper accepted at the 42nd International Symposium on Theoretical Aspects of Computer Science (STACS) in Jena, Germany: Approximate minimum tree cover in all symmetric monotone norms simultaneously (joint work by Matthias Kaul, Kelin Luo, Matthias Mnich and Heiko Röglin).
• December: Paper accepted at the 42nd International Symposium on Theoretical Aspects of Computer Science (STACS) in Jena, Germany: Generalized Arrival for tree-like multigraphs (joint work by Ebrahim Ghorbani, Jonah Hoff and Matthias Mnich).
• December: Matthias Mnich is PC member of the 35th International Symposium on Algorithms and Computation, to be held in Sydney, Australia.
• October: Matthias Mnich is PC member of the 7th Creative Mathematical Sciences Conference, to be held in Trier, Germany.
• September: Matthias Mnich is PC member of the 32nd European Symposium on Algorithms, to be held at Royal Holloway, United Kingdom.
• August: Paper accepted at the Journal of Scheduling: Serial batching to minimize the weighted number of tardy jobs (joint work by Danny Hermelin, Matthias Mnich and Simon Omlor).
• August: Paper accepted at the 19th International Symposium on Parameterized and Exact Computation (IPEC) in Egham, United Kingdom: Single-machine scheduling to minimize the number of tardy jobs with release dates (joint work by Matthias Kaul, Matthias Mnich and Hendrik Molter).
• July: Paper accepted at the 27th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) in London, United Kingdom: A (3/2+1/e)-approximation algorithm for Ordered TSP (joint work by Susanne Armbruster, Matthias Mnich and Martin Nägele).
• July: We are now part of hqic (Hamburg Quantum Innovative Capital), which was officially kicked-off by the Second Mayor and Senator for Science, Research and Equality.
• May: We showcased our research activities at the EIMDay 2024 of the School of Electrical Engineering, Computer Science and Mathematics, where we showcase our research and teaching activities.
• April: Paper accepted at the 33rd International Joint Conference on Artificial Intelligence (IJCAI) in Jeju, South Korea: Efficient cost-minimization schemes for electrical energy demand satisfaction by prosumers in microgrids with battery storage capabilities (joint work by Laura Codazzi, Gergely Csaji and Matthias Mnich).
• April: Paper accepted at the 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP) in Tallinn, Estonia: No polynomial kernels for knapsack (joint work by Klaus Heeger, Danny Hermelin, Matthias Mnich and Dvir Shabtay).

For older news, check our list of past activities.