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.

• November 2023: Paper accepted at the 49th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) in Cochem, Germany: New support bounds and proximity bounds for integer linear programming (joint work with Sebastian Berndt and Tobias Stamm).
• November 2023: We are offering a postdoc position in algorithms, complexity, or (algorithmic) game theory. Please check out the job offer here!
• November 2023: Paper accepted at ACM Transactions on Algorithms: Approximating sparsest cuts in low-treewidth graphs via combinatorial diameter (joint work with Parinya Chalermsook, Matthias Kaul, Joachim Spoerhase and Daniel Vaz).
• October 2023: We are offering two PhD positions: one in quantum-inspired optimization, one in algorithms and complexity. Please check out the job offers here!
• October 2023: We welcome our new team assistant, Britta Siegert, at the institute, and wish her best of success.
• September 2023: We delivered the foundational lecture on Algorithms for Machine Learning, at the MLE Days 2023 in Hamburg, to a packed Audimax.
• September 2023: We welcome our new postdoc, Dr. Tom Davot, at the institute, and wish him best of success.
• August 2023: Paper accepted at the 34th International Symposium on Algorithms and Computation (ISAAC) in Kyoto, Japan: New support size bounds for integer programming, applied to makespan minimization on uniformly related machines (joint work with Sebastian Berndt, Hauke Brinkop, Klaus Jansen, and Tobias Stamm).
• July 2023: Paper accepted at the 42nd IEEE/ACM International Conference on Computer-Aided Design (ICCAD) in San Francisco, California, USA: Checkpoint placement for systematic fault-injection campaigns (joint work with Christian Dietrich and Tim-Marek Thomas).
• July 2023: Paper accepted at the 64th IEEE Symposium on Foundations of Computer Science (FOCS) in Santa Cruz, California, USA: Improved approximations for vector bin packing via iterative randomized rounding (joint work with Ariel Kulik and Hadas Shachnai).
• June 2023: Paper accepted at the 31st European Symposium on Algorithms (ESA) in Amsterdam, The Netherlands: A (3/2+ε)-approximation for multiple TSP with a variable number of depots (joint work with Max Deppert and Matthias Kaul).
• June 2023: Paper accepted at the 31st European Symposium on Algorithms (ESA) in Amsterdam, The Netherlands: Space-efficient parameterized algorithms on graphs of low shrubdepth (joint work with Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Sang-il Oum, Michał Pilipczuk and Erik Jan van Leeuwen).
• April 2023: We welcome our long-term visitors in the summer term 2023 at our institute, Prof. Dr. Michael R. Fellows and Dr. Frances A. Rosamond, as part of a Humboldt Research Fellowship grant.
• March 2023: We organized the 84^th Theorietag of the Gesellschaft für Informatik at Hamburg University of Technology (TUHH), jointly with Research Group for Theoretical Computer Science at TUHH.

For older news, check our list of past activities.