Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
 

Finished Bachelor's and Master's Theses

This page lists all bachelor's and master's theses supervised at the Chair for Algorithm Engineering. Students interested in a thesis topic should just come to our floor and talk to potential supervisors. Publications based on those theses can be found below.

Theses in 2023

Master

Theses in 2022

Bachelor

  • Jessica Dierking: Modelling Traffic Flow for Electric Vehicles
  • Rebekka Dunker: Introducing the Graph Parameter Cell Skeleton Dimension for Analysing Routing Algorithms
  • Julian Egbert: Electric Vehicle Charging Network Graphs Visualization
  • Christian Helms: On the k-Shortest Path Cover Problem
  • Ivan Khomutovskiy: The SKARF Routing Algorithm: A Generalisation of Arc-Flags Using Skeletons
  • Paula Marten: Isomorphisms and Embeddings between Limit Learning Settings
  • Niklas Mohrin: Behaviorally Correct Learning from Informants
  • Lukas Rost: Analyzing Schelling Games with Multi-Dimensional Types
  • Finn Schöllkopf: Heuristics for Placing new Electric Vehicle Charging Parks
  • Kathrin Thenhausen: The utility of clustering for real estate valuation

Master

Theses in 2021

Bachelor

  • Sebastian Angrick: Analyzing Schelling Games with High Diversity
  • Ben Bals: Valuation of Real Estate Properties using Data-Driven Similarity Search
  • Niko Hastrich: Approximate k-Nearest-Neighbor Queries on Geographic Data in the Context of Real Estate Valuation
  • Maximilian Kleissl: Finding Deep Neural Network Architectures for Tabular Real Estate Data Using Genetic Algorithms
  • Jonas Schmidt: Analyzing Continuous Schelling Games
  • Lukas Weyand: Preparation of Real Estate Data for Deep Learning

Master

  • Lukas Behrendt: A Best Response Algorithm for the Minimum Flow Network Creation Game
  • Wilhelm Friedemann: Parameterized Complexity of the Maximum-Weight Connected Subgraph Problem
  • Pascal Führlich: Improving Pairings at Swiss-System Tournaments and Analysis of Swiss Gambits
  • Hans Gawendowicz: On a Social Distancing Network Creation Game
  • Nicolas Klodt: Epidemic Thresholds for the SIS Contact Process on Stars and Clique Stars
  • Bashini Mahaarachchi (U Potsdam): Applying Deep Learning Methods to Create Parking Space Maps Using Satellite Images
  • Jannik Peters: Complexity of Popular Matchings with One- and Three-Sided Preference Lists
  • David Stangl: Learning by Doing: Adapting Branching for Better Pruning in Search Trees
  • Daniel Stephan: Routing with Low Stretch and Small Coordinates in Hyperbolic Random Graphs
  • Michael Vaichenker: Hardness and Approximation Results for Fair Ratio-Cut

Theses in 2020

Bachelor

  • Maximilian Böther: Heuristic Optimization of Strategic Alternative Routes in Traffic Networks Using Evolutionary Algorithms
  • Alina Gries: Reducing CO2 Emissions Through Strategic Routing
  • Otto Kißig: Efficiently Enumerating Maximal Route Segments Shared by Groups of Drivers
  • Leon Schiller: An Empirical Analysis of an Evolutionary Algorithm for the Single Alternative Path Problem
  • Armin Wells: Learning Restricted Regular Expressions From Finite Samples
  • Simon Wietheger: Solving the Single Alternative Path Problem by Efficiently Finding Multi-Criteria SSSPs

Master

  • Benjamin Feldmann: Distributed Unique Column Combinations Discovery
  • Simon Krogmann: Facility Location Games on Networks
  • Marcus Pappik: New Conditions via Markov Chains - Approximating Partition Functions of Abstract Polymer Models without Cluster Expansions
  • Marcus Wilhelm: Beating the Worst-Case - Analysis of a Practical Algorithm for Treewidth

Theses in 2019

Bachelor

  • Jorin Heide: Causal Discovery on Industrial Time Series Data and its Interaction with Lossy Compression
  • Linus Heinzl: Analysis of the Parameter Configuration of the Ramer-Douglas-Peucker Algorithm for Time Series Compression
  • Nicolas Klodt: Run Time Analysis of Evolutionary Algorithms for Time Series Compression
  • Felix Mujkanovic: Explaining the Predictions of Any Time Series Classifier
  • Lars Seifert: Minimizing Communication Cost for On-Line Time Series Compression
  • Arthur Zahn: Hybrid Genetic Algorithms for Time Series Compression by Piecewise Linear Approximation

Master

  • Hagen Echzell: Flow-Based Network Creation Games
  • Stefanie Lowski (Diploma at HU Berlin): Selfish Network Creation with Distance-Dependent Edge Price
  • Valentin Pinkau: Hierarchical Graph Embeddings in Hyperbolic Space
  • Fabian Sommer: Controlling Assortativitiy in Heterogeneous Geometric Random Graphs
  • Sören Tietböhl: Improving evolutionary algorithms with activity: An initial study through MaxCut

Theses in 2018

Bachelor

  • Sarah-Isabel Amon: Optimierung von skillbasierten Dispositionen mit Hilfe evolutionärer Algorithmen
  • Hans Gawendowicz: Analyse einfacher evolutionärer Algorithmen auf dem Maximum-Cardinality-Matching-Problem
  • Julius Lischeid: Lexicographic Enumeration of Hitting Sets in Hypergraphs
  • Jannik Peters & Daniel Stephan: Comparison of MIP Solvers and Evolutionary Algorithms for Hard Real World Audit Assignment Problems
  • Lennart Salabarria: Untersuchung lokaler agentenbasierter Verbesserungsstrategien
  • Jonas Umland: Skillbasierte Mitarbeiterdisposition mittels ganzzahliger linearer Optimierung
  • Felix Werner: Interaktive Visualisierung skillbasierter Dispositionen

Master

  • Philipp Fischbeck: On the Effectiveness of Data Reduction for Covering Problems in Real-World Transit Networks
  • Clemens Frahnow: Ring Migration Topology Helps Bypassing Local Optima in Evolutionary Computation
  • Cedric Freiberger: On the Runtime of the Louvain Modularity Optimization
  • Sven Ihde: Wireless and Metric Network Creation Games
  • Stefan Neubert: Mechanisms for Network Creation
  • David Schumann: Exploring Game Theoretic Models for Generating Real World Networks
  • Marianne Thieffry: Efficient Generation of Geometric Inhomogeneous Random Graphs
  • Christopher Weyand: Locality in Game Theoretic Models for Real-World Networks

Theses in 2017

Bachelor

  • Jan Eube: Bidirektionale Suche auf einer in Kacheln eingeteilten Karte
  • Thomas Feldtkeller: Analysis of Routing Algorithms on Tiled Map Data
  • Julius Severin: Visualizing Shortest Path Algorithms on Tiled Map Data
  • Fabian Sommer: Shortest Paths in a Tiled-Divided Map – Changing Node Priorities Based on the Accessibility of Tiles
  • Justin Trautmann: Cache Replacement Strategies for Routing Algorithms on Tiled Maps

Master

Theses in 2016

Bachelor

  • Tobias Arndt: Field Study for Evaluating On-Street Parking Search Algorithms on Probabilistic Data
  • Danjiar Hafner: Deep Reinforcement Learning from Raw Pixels in Doom
  • Thomas Kellermeier: Routing Drivers for On-Street Parking Search in a Multi-Agent System
  • Simon Krogmann: Algorithms for Creating Parking Spot Search Routes With and Without Access to Parking Probabilities
  • Armin Razmdjou: Automatic Matching Between Large Road Networks on the Example of TomTom and OpenStreetMap

Master

  • Martin Aschenbach (FSU Jena): Comparison of Restricted Language Identification from Informants
  • Dominik Müller: Analyzing Neuroevolution Algorithms
  • Michael Schneeweiß (FSU Jena): Gewinne Spiele durch Lernen

Theses in 2015

Bachelor

  • Andreas Goral (FSU Jena): Graph Isomorphism on Deterministic Scale-Free Networks

Master

Student Papers

We are proud that our students regularly publish their results in peer-reviewed international scientific journals and conference proceedings. The following list presents all research papers based on one of the theses, our Bachelor and Master Projects, and Project Seminars.

Sorry, the requested view was not found.

The technical reason is: No template was found. View could not be resolved for action "view" in class "AcademicPuma\ExtBibsonomyCsl\Controller\DocumentController".