Institute for Algorithms and Complexity (E-11)
Institute for Algorithms and Complexity (E-11)
EN
EN
- Homepage
- News
- People
- Jobs
- Research
-
Projects
- All projects
- 2022-2023: Holistic flight planning with reduced noise and pollutant emissions
- 2021-2024: Data-driven decentralized energy trading
- 2021-2024: 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
- All courses
- Graduate seminar: Advanced Algorithms
- Graduate course: Algorithm Engineering
- Core course: Algorithmic game theory
- Core course: Automata Theory and Formal Languages
- Core course: Algorithms and data structures
- Core course: 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
