Selected Topics in Algorithms: Algorithms and Sustainability (Winter 2025/2026)
- Lecturer: Kevin Buchin
- Module: INF-MSc-603
- Type: 2 SWS lecture + 2 SWS tutorial
- Moodle: 54282 (enroll via lsf)
- Language: English
Description
This course explores how algorithms research can contribute to addressing challenges of sustainability. We will study algorithmic techniques and applications with a focus on both theoretical foundations and practical impact. Topics include:
- Computational Movement Analysis
- Routing Algorithms for Sustainable Mobility
- Energy-efficient Algorithms
- Algorithmic Fairness.
Prerequisites
- Solid background in algorithms and data structures
- Interest in both the theory of algorithms and in practical, application-driven algorithm design
- Readiness to apply algorithms in hands-on, project-based work
Format
- weekly lecture (Tue 10:15-11:45) and tutorial (Thu 12:15-13:45)
- Tutorial sessions combine exercises on lecture content with project discussion and practical guidance
Projects
Each student will work on a small-scale project, comparable in scope to course work for a regular course. Projects can be done individually or in pairs. Students are free to propose their own topics. By default, however, projects will be based on the frameworks and ideas introduced in the course and discussed in the tutorial sessions.
Possible projects include, for example:
- developing a MoveApp for MoveBank,
- implementing routing algorithms as part of our tour4me framework (https://tramectory.github.io/tour4me/
- evaluating and engineering basic algorithms for energy efficiency (e.g., for sorting, convex hulls, or another fundamental problem).
Language
- The course will be taught in English
calendar week | lecture | tutorial | theme | planned topics (details may change) | guest speakers (lecture (L), tutorial (T)) |
---|---|---|---|---|---|
42 | 14.10.2025 | 16.10.2025 | Introduction | sustainability goals, course organization, introduction | L: Dr. Henning Moldenhauer, Sustainability Office TU Dortmund: "Sustainability goals" T: Dr. Andrea Kölzsch, Assistant Professor for Ecology, Radboud University: "MoveApps Introduction" |
43 | 21.10.2025 | 23.10.2025 | Computational Movement Analysis | Trajectory similarity and clustering | T: Mart Hagedoorn, PhD student in Algorithms, TU Dortmund: "Integrating Route Planning Algorithms in Tour4Me" |
44 | 28.10.2025 | 30.10.2025 | Trajectory Preprocessing and Simplification | ||
45 | 04.11.2025 | 06.11.2025 | Trajectory Segmentation | ||
46 | 11.11.2025 | 13.11.2025 | Route Planning | Route Planning Fundamentals: Dijstra, Contraction Hierarchies, Transit Node Routing | T: JProf. Ben Hermann, TU Dortmund: "Measuring energy-efficiency of programs" |
47 | 18.11.2025 | 20.11.2025 | Route Planning: Guest Lecture on Accessibility; Public Transport/Multi-Modal Route Planning | L: Prof. Sabine Storandt, University of Konstanz: "Route planning for accessibility in digital twins" | |
48 | 25.11.2025 | 27.11.2025 | Alternative Routes | ||
49 | 02.12.2025 | 04.12.2025 | Energy-efficient algorithms | Green Computing Algorithms, Scheduling Algorithms | |
50 | 09.12.2025 | 11.12.2025 | Energy-efficiency in Software Engineering | L: JProf. Ben Hermann, TU Dortmund | |
51 | 16.12.2025 | 18.12.2025 | Algorithm engineering & parallel algorithms | ||
52 | 23.12.2025 | 25.12.2025 | no class - winter holiday | ||
1 | 30.12.2025 | 01.01.2026 | no class - winter holiday | ||
2 | 06.01.2026 | 08.01.2026 | no class | ||
3 | 13.01.2026 | 15.01.2026 | Algorithmic Fairness | Fair Clustering | L: Prof. Melanie Schmidt, HHU Düsseldorf: "Fair Clustering" |
4 | 20.01.2026 | 22.01.2026 | Fair Ranking | ||
5 | 27.01.2026 | 29.01.2026 | Game-theoretic Approach to Fairness | ||
6 | 03.02.2026 | 05.02.2026 | Project Presentations | project presentations |