Institute for Algorithms and Complexity (E-11)
Institute for Algorithms and Complexity (E-11)
EN
EN
Homepage
Homepage
Homepage
Homepage
Institute mission
Information for TUHH students
Institute vision
Information for ERASMUS/international students
People
Jobs
Jobs
Jobs
Jobs
Postdoc/Senior positions
PhD positions
Tutor positions
IT and Administration
Research
Research
Research
Research
Research of the institute
Research of Prof. Dr. Matthias Mnich
Research of Laura Codazzi
Research of Matthias Kaul
Research of Tobias Stamm
Projects
Projects
Projects
Projects
All projects
2022-2023: Holistic flight planning with reduced noise and pollutant emissions
2021-2024: Data-driven decentralized energy trading
2021-2026: New algorithmic approaches to macromolecular crystallographic analysis
2021-2022: Simultaneous approximation of multi-criteria optimization problems
2021: The key to faster production planning
2021: Cooperation in Electric Vehicle Charging
2021: Quantum Annealing
2020-2023: Resilient broadcasting via independent spanning trees
2019-2021: A fixed-parameter approach towards combinatorial optimization
2020: SARS-CoV-2 containment in dynamic contact networks
2019-2020: Problems in structural and chromatic graph theory
2017-2021: Multivariate algorithms for high-multiplicity scheduling
2014-2021: 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
ALGO >
Research >
Research of Tobias Stamm
Publications
2024
New support bounds and proximity bounds for integer linear programming
Berndt, Sebastian; Mnich, Matthias; Stamm, Tobias
International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2024)
Publisher DOI
2023
New support size bounds for integer programming, applied to makespan minimization on uniformly related machines
Berndt, Sebastian; Brinkop, Hauke; Jansen, Klaus; Mnich, Matthias; Stamm, Tobias
International Symposium on Algorithms and Computation (ISAAC 2023) 283: 13
Open Access
|
Publisher DOI