Institute for Algorithms and Complexity (E-11)
Institute for Algorithms and Complexity (E-11)
EN
EN
Home
Home
Home
Home
Institute mission
Information for TUHH students
Institute vision
Information for ERASMUS/international students
Team
Jobs
Jobs
Jobs
Jobs
Postdoc/Senior positions
PhD positions
Tutor positions
IT and Administration
Publications
Publications
Publications
Publications
Publications of the institute
Research of Prof. Dr. Matthias Mnich
Research of Dr. Ebrahim Ghorbani
Research of Dr. Raul Wayne Teixeira Lopes
Research of Laura Codazzi
Research of Karolina Tammemaa
Research of Matthias Kaul
Research of Tobias Stamm
Projects
Projects
Projects
Projects
Fast Quantum Algorithms for Hard Optimization Problems
All projects
Data-driven decentralized energy trading
PATTERN - European doctoral network enabling artificial intelligence for electromagnetic compatibility
Holistic flight planning with reduced noise and pollutant emissions
New algorithmic approaches to macromolecular crystallographic analysis
Simultaneous approximation of multi-criteria optimization problems
The key to faster production planning
Cooperation in electric vehicle charging
Quantum annealing
Resilient broadcasting via independent spanning trees
A fixed-parameter approach towards combinatorial optimization
SARS-CoV-2 containment in dynamic contact networks
Problems in structural and chromatic graph theory
Multivariate algorithms for high-multiplicity scheduling
Kernelization for big data
Teaching
Teaching
Teaching
Teaching
All modules
Graduate seminar: Advanced Algorithms
Graduate module: Algorithm engineering
Graduate module: Algorithmic game theory
Core module: Automata theory and formal languages
Core module: Algorithms and data structures
Graduate module: Linear and nonlinear optimization
Graduate seminar: Algorithms for quantum computing
Graduate seminar: Approximation Algorithms
Graduate seminar: Fine-grained algorithms and complexity
Graduate seminar: Parameterized algorithms
Undergraduate seminar: Advances in dynamic algorithms
Undergraduate seminar: Advances in integer programming
Undergraduate seminar: Advances in scheduling algorithms
Undergraduate seminar: Algorithmic foundations of artificial intelligence
Seminar EIM: Algorithm Engineering
Seminar EIM: Computer Science Unplugged
Undergraduate seminar: Foundations of data science
Undergraduate seminar: Principles of compressed sensing
Undergraduate seminar: Quantum algorithm engineering
Undergraduate seminar: Parameterized Complexity
Theses
CS Unplugged
ALGO >
Publications >
Research of Karolina Tammemaa
Publications
2026
Fast approximation algorithms for Euclidean minimum weight perfect matching
Hougardy, Stefan; Tammemaa, Karolina
Theory of Computing Systems 70 (2): 25 (2026)
Open Access
|
Publisher DOI
