| Berechnung guter Lösungen fuer Varianten des Job-Shop-Scheduling - Problems | Bachelor Thesis | Prof. Dr. Sándor P. Fekete | running |
| Entwicklung eines Multi-Connectivity-fähigen Routingprotokolls für WSNs | Bachelor Thesis | Lara Jüschke, Torben Petersen | running |
| Finding Performance Bottlenecks in WebAssembly Applications | Bachelor Thesis | Lennart Almstedt | running |
| Exact Methods for the Budgeted Close-Enough Traveling Salesman Problem | Bachelor Thesis | Prof. Dr. Sándor P. Fekete | running |
| The Capacitated Lawn Mowing Problem | Bachelor Thesis | Prof. Dr. Sándor P. Fekete | running |
| Computing Exact Solutions for Geometric Covering | Bachelor Thesis | Chek-Manh Loi, Michael Perk | running |
| Samplingbased Algorithms for the Traveling Salesman Problem with Neighborhoods | Bachelor Thesis | Chek-Manh Loi, Dr. Dominik Krupke | running |
| Strategic Deployment of RSUs with Collective Perception Capabilities | Master Thesis | Fynn Schulze, Alexander Willecke | running |
| Energy-Efficient Synchronization in TDMA Protocols for WSNs: An In-Depth Evaluation | Master Thesis | Jan Schlichter, Leonard Zurek | running |
| AI Assisted Evaluation of V2X Simulation Data | Project Thesis | Fynn Schulze, Alexander Willecke | running |
