# 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 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* - 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**

- Maximilian Katzmann (FSU Jena):
*Hyperbolic Embedding for Near-Optimal Greedy Routing***President's prize for best thesis**

## 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**

- Martin Schirneck (FSU Jena):
*On Restrictions in Computational Language Learning***Dean's prize for best thesis**

2022 [ nach oben ]

- Bläsius, Thomas; Friedrich, Tobias; Lischeid, Julius; Meeks, Kitty; Schirneck, Martin
**Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling**Journal of Computer and System Sciences 2022: 192–213 - Cseh, Ágnes; Friedrich, Tobias; Peters, Jannik
**Pareto Optimal and Popular House Allocation with Lower and Upper Quotas**Autonomous Agents and Multi-Agent Systems (AAMAS) 2022 - Cseh, Ágnes; Peters, Jannik
**Three-Dimensional Popular Matching with Cyclic Preferences**Autonomous Agents and Multi-Agent Systems (AAMAS) 2022 - Bläsius, Thomas; Friedrich, Tobias; Stangl, David; Weyand, Christopher
**An Efficient Branch-and-Bound Solver for Hitting Set**Algorithm Engineering and Experiments (ALENEX) 2022 - Böther, Maximilian; Kißig, Otto; Taraz, Martin; Cohen, Sarel; Seidel, Karen; Friedrich, Tobias
**What’s Wrong with Deep Learning in Tree Search for Combinatorial Optimization**International Conference on Learning Representations (ICLR) 2022 - Bilò, Davide; Casel, Katrin; Choudhary, Keerti; Cohen, Sarel; Friedrich, Tobias; Lagodzinski, J.A. Gregor; Schirneck, Martin; Wietheger, Simon
**Fixed-Parameter Sensitivity Oracles**Innovations in Theoretical Computer Science (ITCS) 2022: 23:1–23:18

2021 [ nach oben ]

- Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Lowski, Stefanie; Melnichenko, Anna
**Selfish Creation of Social Networks**Conference on Artificial Intelligence (AAAI) 2021: 5185–5193 - Berger, Julian; Böther, Maximilian; Doskoč, Vanja; Gadea Harder, Jonathan; Klodt, Nicolas; Kötzing, Timo; Lötzsch, Winfried; Peters, Jannik; Schiller, Leon; Seifert, Lars; Wells, Armin; Wietheger, Simon
**Learning Languages with Decidable Hypotheses**Computability in Europe (CiE) 2021: 25–37 - Cohen, Sarel; Hershcovitch, Moshik; Taraz, Martin; Kißig, Otto; Wood, Andrew; Waddington, Daniel; Chin, Peter; Friedrich, Tobias
**Drug Repurposing using Link Prediction on Knowledge Graphs with Applications to Non-Volatile Memory**Complex Networks and their Applications (ComplexNetworks) 2021 - Berger, Julian; Bleidt, Tibor; Büßemeyer, Martin; Ding, Marcus; Feldmann, Moritz; Feuerpfeil, Moritz; Jacoby, Janusch; Schröter, Valentin; Sievers, Bjarne; Spranger, Moritz; Stadlinger, Simon; Wullenweber, Paul; Cohen, Sarel; Doskoč, Vanja; Friedrich, Tobias
**Fine-Grained Localization, Classification and Segmentation of Lungs with Various Diseases**CVPR Workshop on Fine-Grained Visual Categorization (FGVC@CVPR) 2021 - Böther, Maximilian; Schiller, Leon; Fischbeck, Philipp; Molitor, Louise; Krejca, Martin S.; Friedrich, Tobias
**Evolutionary Minimization of Traffic Congestion**Genetic and Evolutionary Computation Conference (GECCO) 2021: 937–945Best Paper Award (RWA Track) - Krogmann, Simon; Lenzner, Pascal; Molitor, Louise; Skopalik, Alexander
**Two-Stage Facility Location Games with Strategic Clients and Facilities**International Joint Conference on Artificial Intelligence (IJCAI) 2021: 292–298 - Casel, Katrin; Friedrich, Tobias; Issac, Davis; Klodt, Nicolas; Seifert, Lars; Zahn, Arthur
**A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics**Knowledge Discovery and Data Mining (KDD) 2021: 882–891 - Kißig, Otto; Taraz, Martin; Cohen, Sarel; Doskoč, Vanja; Friedrich, Tobias
**Drug Repurposing for Multiple COVID Strains using Collaborative Filtering**ICLR Workshop on Machine Learning for Preventing and Combating Pandemics (MLPCP@ICLR) 2021 - Friedemann, Wilhelm; Friedrich, Tobias; Gawendowicz, Hans; Lenzner, Pascal; Melnichenko, Anna; Peters, Jannik; Stephan, Daniel; Vaichenker, Michael
**Efficiency and Stability in Euclidean Network Design**Symposium on Parallelism in Algorithms and Architectures (SPAA) 2021: 232–242 - Kißig, Otto; Taraz, Martin; Cohen, Sarel; Friedrich, Tobias
**Drug Repurposing Using Link Prediction on Knowledge Graphs**ICML Workshop on Computational Biology (WCB@ICML) 2021[ BibTeX ]

2020 [ nach oben ]

- Birnick, Johann; Bläsius, Thomas; Friedrich, Tobias; Naumann, Felix; Papenbrock, Thorsten; Schirneck, Martin
**Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery**Proceedings of the VLDB Endowment 2020: 2270–2283 - Bläsius, Thomas; Böther, Maximilian; Fischbeck, Philipp; Friedrich, Tobias; Gries, Alina; Hüffner, Falk; Kißig, Otto; Lenzner, Pascal; Molitor, Louise; Schiller, Leon; Wells, Armin; Witheger, Simon
**A Strategic Routing Framework and Algorithms for Computing Alternative Paths**Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) 2020: 10:1–10:14 - Friedrich, Tobias; Krejca, Martin S.; Lagodzinski, J. A. Gregor; Rizzo, Manuel; Zahn, Arthur
**Memetic Genetic Algorithms for Time Series Compression by Piecewise Linear Approximation**International Conference on Neural Information Processing (ICONIP) 2020: 592–604 - Echzell, Hagen; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna
**Flow-Based Network Creation Games**International Joint Conference on Artificial Intelligence (IJCAI) 2020: 139–145

2019 [ nach oben ]

- Friedrich, Tobias; Krejca, Martin S.; Rothenberger, Ralf; Arndt, Tobias; Hafner, Danijar; Kellermeier, Thomas; Krogmann, Simon; Razmjou, Armin
**Routing for On-Street Parking Search using Probabilistic Data**AI Communications 2019: 113–124 - Doerr, Benjamin; Fischbeck, Philipp; Frahnow, Clemens; Friedrich, Tobias; Kötzing, Timo; Schirneck, Martin
**Island Models Meet Rumor Spreading**Algorithmica 2019: 886–915 - Bläsius, Thomas; Friedrich, Tobias; Lischeid, Julius; Meeks, Kitty; Schirneck, Martin
**Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling**Algorithm Engineering and Experiments (ALENEX) 2019: 130–143 - Peters, Jannik; Stephan, Daniel; Amon, Isabel; Gawendowicz, Hans; Lischeid, Julius; Salabarria, Julius; Umland, Jonas; Werner, Felix; Krejca, Martin S.; Rothenberger, Ralf; Kötzing, Timo; Friedrich, Tobias
**Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem**International Conference on Automated Planning and Scheduling (ICAPS) 2019: 541–554 - Bläsius, Thomas; Fischbeck, Philipp; Friedrich, Tobias; Schirneck, Martin
**Understanding the Effectiveness of Data Reduction in Public Transportation Networks**Workshop on Algorithms and Models for the Web Graph (WAW) 2019: 87–101 - Echzell, Hagen; Friedrich, Tobias; Lenzner, Pascal; Molitor, Louise; Pappik, Marcus; Schöne, Friedrich; Sommer, Fabian; Stangl, David
**Convergence and Hardness of Strategic Schelling Segregation**Web and Internet Economics (WINE) 2019: 156–170

2018 [ nach oben ]

- Bläsius, Thomas; Freiberger, Cedric; Friedrich, Tobias; Katzmann, Maximilian; Montenegro-Retana, Felix; Thieffry, Marianne
**Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry**International Colloquium on Automata, Languages, and Programming (ICALP) 2018: 20:1–20:14 - Frahnow, Clemens; Kötzing, Timo
**Ring Migration Topology Helps Bypassing Local Optima**Parallel Problem Solving From Nature (PPSN) 2018: 129–140 - Bläsius, Thomas; Eube, Jan; Feldtkeller, Thomas; Friedrich, Tobias; Krejca, Martin S.; Lagodzinski, J. A. Gregor; Rothenberger, Ralf; Severin, Julius; Sommer, Fabian; Trautmann, Justin
**Memory-restricted Routing With Tiled Map Data**Systems, Man, and Cybernetics (SMC) 2018: 3347–3354 - Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Krohmer, Anton; Striebel, Jonathan
**Towards a Systematic Evaluation of Generative Network Models**Workshop on Algorithms and Models for the Web Graph (WAW) 2018: 99–114

2017 [ nach oben ]

- Doerr, Benjamin; Fischbeck, Philipp; Frahnow, Clemens; Friedrich, Tobias; Kötzing, Timo; Schirneck, Martin
**Island Models Meet Rumor Spreading**Genetic and Evolutionary Computation Conference (GECCO) 2017: 1359–1366 - Friedrich, Tobias; Ihde, Sven; Keßler, Christoph; Lenzner, Pascal; Neubert, Stefan; Schumann, David
**Efficient Best Response Computation for Strategic Network Formation under Attack**Symposium on Algorithmic Game Theory (SAGT) 2017: 199–211 - Friedrich, Tobias; Ihde, Sven; Keßler, Christoph; Lenzner, Pascal; Neubert, Stefan; Schumann, David
**Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack**Symposium on Parallelism in Algorithms and Architectures (SPAA) 2017: 321–323

2016 [ nach oben ]

- Arndt, Tobias; Hafner, Danijar; Kellermeier, Thomas; Krogmann, Simon; Razmjou, Armin; Krejca, Martin S.; Rothenberger, Ralf; Friedrich, Tobias
**Probabilistic Routing for On-Street Parking Search**European Symposium on Algorithms (ESA) 2016: 6:1–6:13 - Kötzing, Timo; Schirneck, Martin
**Towards an Atlas of Computational Learning Theory**Symposium on Theoretical Aspects of Computer Science (STACS) 2016: 47:1–47:13