Welcome to the Institute for Algorithms and Complexity
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.
Upcoming and recent activities
- 2 September 2020, 9.45am CET: Prof. Mnich presents the paper "Hitting Long Directed Cycles is Fixed-Parameter Tractable" at HALG: Highlights of Algorithms 2020
- 2 December 2020, 1pm CET: Prof. Mnich presents the institute's research on designing efficient vaccination and quarantine strategies in wake of the Corona pandemic. Hosted in the DASHH Hamburg COVID-19 series.
Latest publications from the Institute for Algorithms and Complexity
2020
-
Solving packing problems with few small items using rainbow matchings
45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Open Access | Publisher DOI -
Hitting long directed cycles is fixed-parameter tractable
International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Open Access | Publisher DOI -
Engineering kernelization for maximum cut
22nd Symposium on Algorithm Engineering and Experiments (ALENEX 2020)
Publisher DOI -
Dense Steiner problems: approximation algorithms and inapproximability
arXiv:2004.14102 (2020)
-
Time- and space-optimal algorithm for the many-visits TSP
ACM transactions on algorithms (2020)
Publisher DOI -
Dynamic parameterized problems and algorithms
ACM transactions on algorithms (2020)
Publisher DOI -
Odd Multiway Cut in Directed Acyclic Graphs
SIAM journal on discrete mathematics (2020)
Publisher DOI -
A 3/2-approximation for the metric many-visits path TSP
arXiv:2007.11389 (2020)
-
Recent advances in practical data reduction
arXiv:2012.12594
-
Voting and bribing in single-exponential time
ACM Transactions on Economics and Computation (2020)
Publisher DOI -
Stable matchings with covering constraints: a complete computational trichotomy
Algorithmica (2020)
Open Access | Publisher DOI -
Scheduling with non-renewable resources: Minimizing the sum of completion times
6th International Symposium on Combinatorial Optimization (ISCO 2020)
Publisher DOI -
On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes
Discrete Optimization (2020)
Publisher DOI