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 Activities
- 1 June 2021, 2pm CEST: Prof. Mnich lectures on the institute's research on algorithms and complexity at the Faculty Research Colloquium.
- 14/21 June 2021, 5pm CEST: Prof. Mnich presents the institute's research on fundamental algorithms for machine learning at the MLE Research Colloquium.
- 1 July 2021, 10.30am CEST: Prof. Mnich lectures on fundamental algorithms for machine learning at the Machine Learning in Engineering 2021 Workshop. Sign up here.
Latest publications from the Institute for Algorithms and Complexity
2021
-
On Short Fastest Paths in Temporal Graphs
International Conference and Workshops on Algorithms and Computation (WALCOM 2021)
-
Hitting weighted even cycles in planar graphs
International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2021)
-
Circumference of essentially 4-connected planar triangulations
Journal of graph algorithms and applications 25 (1): 121-132 (2021)
Open Access | Publisher DOI -
Cycle Spectra of Contraction-Critically 4-Connected Planar Graphs
Graphs and Combinatorics: (2021)
Publisher DOI -
Reachability switching games
Logical methods in computer science 17 (2): 10:1-10:29 (2021)
Open Access | Publisher DOI
2020
-
Hitting long directed cycles is fixed-parameter tractable
International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Open Access | Publisher DOI -
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 -
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)
-
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 -
Time- and space-optimal algorithm for the many-visits TSP
ACM transactions on algorithms (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