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.
Latest publications from the Institute for Algorithms and Complexity
2020
-
Voting and bribing in single-exponential time
ACM Transactions on Economics and Computation (2020)
-
Time- and space-optimal algorithm for the many-visits TSP
ACM transactions on algorithms (2020)
-
Odd Multiway Cut in Directed Acyclic Graphs
SIAM journal on discrete mathematics (2020)
-
On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes
Discrete optimization (2020): 100565
Publisher DOI -
Dynamic parameterized problems and algorithms
ACM transactions on algorithms (2020)
-
Hitting long directed cycles is fixed-parameter tractable
International Colloquium on Automata, Languages and Programming, ICALP (2020)
-
Engineering kernelization for maximum cut
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020
Publisher DOI -
Dense Steiner problems: approximation algorithms and inapproximability
-
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
International Symposium on Combinatorial Optimization, ISCO, Montreal, Canada (2020-05)