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
Join us on 15 and 16 September 2022 for the MLE Days Hamburg: https://mle-days.hamburg and learn everything about Machine Learning in Engineering.
Latest Publications from the Institute for Algorithms and Complexity
2022
-
Exact and approximation algorithms for many-visits travelling salesperson problems
Open Access -
Gaussian graphical modeling for spectrometric data analysis
Computational Statistics and Data Analysis: 107416 (2022-01-01)
Publisher DOI -
Optimizing fuel consumption on inland waterway networks : local search heuristic for lock scheduling
Omega-international journal of management science 109 : 102580 (2022)
Open Access | Publisher DOI -
Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
arXiv: 2203.03600 (2022-03-07)
Open Access
2021
-
On short fastest paths in temporal graphs
International Conference and Workshops on Algorithms and Computation (WALCOM 2021)
Publisher DOI -
Circumference of essentially 4-connected planar triangulations
Journal of graph algorithms and applications 25 (1): 121-132 (2021)
Open Access | Publisher DOI -
Approximating sparsest cut in low-treewidth graphs via combinatorial diameter
arXiv:2111.06299 (2021)
Open Access -
Efficient approximations for many-visits multiple traveling salesman problems
arXiv: 2201.02054 (2021)
-
Reachability switching games
Logical methods in computer science 17 (2): 10:1-10:29 (2021-04-22)
Open Access | Publisher DOI -
Cycle spectra of contraction-critically 4-connected planar graphs
Graphs and Combinatorics 37 (6): 2129-2137 (2021)
Publisher DOI -
Hitting weighted even cycles in planar graphs
International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2021)
Open Access | Publisher DOI -
Parameterized complexity of configuration integer programs
Operations research letters 49(6): 908-913 (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)
-
Voting and bribing in single-exponential time
ACM Transactions on Economics and Computation (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 -
Recent advances in practical data reduction
arXiv:2012.12594
Open Access -
Time- and space-optimal algorithm for the many-visits TSP
ACM transactions on algorithms (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 -
A 3/2-approximation for the metric many-visits path TSP
arXiv:2007.11389 (2020)
Open Access -
On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes
Discrete Optimization (2020)
Publisher DOI