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 2025

Bachelor
 

Master

  • Tobias Sträubig: Selfish Battery Charging Games
  • Lukas Weyand: The Price of Anarchy in Cooperative Bilateral Generalized Network Creation Games

Theses in 2024

Bachelor
 

  • Konrad Letz: Analyzing the structure of Pareto efficient solutions in the biobjective unconstrained binary problem
  • Jannes Malanowski: Conquering the Multiverse: The River Voting Method with Efficient Parallel Universe Tiebreaking
  • Tobias Röhr: A Framework for Graph Deletion Problems Based on User Propagators for MaxSAT
  • Henri Zeiler: Stability in Single-Peaked Strategic Resource Selection Games

Master

  • Sebastian Angrick: A Dichotomy Criterion for Matrix Partitions
  • Ben Bals: Graph Discovery and Source Detection in Temporal Graphs
  • Niko Hastrich: Structural Parameterization of Steiner Tree Packing
  • Jonas Schmidt: Directed Secluded Subgraph Problems

Theses in 2023

Bachelor
 

  • Erik Kohlros: Analyzing the sentiment distribution in Google search results
  • Jacob Schäfer: Mitigating Bias in Skin Lesion Classification Models Using Variational Autoencoders
  • Jakob Timm: Tolerant Closeness Testing on Partially Known Discrete Distributions
  • Jan Fehse: Determining Web Platforms with High Shares in Search Results
  • Jenny Sommerfeld: Simulating Detection for Brownian Motion via Reflective Walk on Spheres
  • Kilian Glase: Measuring the Distribution of Conspiracy-Promoting Content in Google Search Results
     
  • Nicola Kössler: An empirical study about the network properties of the VGIRGs
  • Till Bergmann: Testing Geometric Distributions via Learning and Tolerant Identity Testing

Master

  • Simon Wietheger: Fair Correlation Clustering in Forests

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

  • Julian Berger: Greedy Routing Network Creation Games
  • Simon Wietheger: Fair Correlation Clustering in Forests
  • Jonathan Gadea Harder: Facility Location Games with heterogenous customers
  • Merlin de la Haye: Creation Games for Undirected Wireless Networks
  • Leon Schiller: Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs
  • Lars Seifert: Single-Peaked Jump Schelling Games
  • Arthur Zahn: Price of Anarchy in Bilateral Network Creation Games

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

  • 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

Student Papers

2024

  •  

    Sauer, Pascal; Cseh, Ágnes; Lenzner, PascalImproving ranking quality and fairness in Swiss-system chess tournamentsJournal of Quantitative Analysis in Sports 2024

    [ ]

  •  

    Horev, Yinon; Shay, Shiraz; Cohen, Sarel; Friedrich, Tobias; Issac, Davis; Kamma, Lior; Niklanovits, Aikaterini; Simonov, KirillA Contraction Tree SAT Encoding for Computing Twin-WidthAdvances in Knowledge Discovery and Data Mining 2024

    [ ][ ][ URL ][ DOI ][ Download ]

2023

  •  

    Friedrich, Tobias; Kötzing, Timo; Radhakrishnan, Aishwarya; Schiller, Leon; Schirneck, Martin; Tennigkeit, Georg; Wietheger, SimonCrossover for Cardinality Constrained OptimizationACM Transactions on Evolutionary Learning and Optimization 2023: 1–32

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Friedrich, Tobias; Gawendowicz, Hans; Lenzner, Pascal; Melnichenko, AnnaSocial Distancing Network CreationAlgorithmica 2023

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Böther, Maximilian; Schiller, Leon; Fischbeck, Philipp; Molitor, Louise; Krejca, Martin S.; Friedrich, TobiasEvolutionary Minimization of Traffic CongestionIEEE Transactions on Evolutionary Computation 2023: 1809–1821

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Krämer, Bastian; Stang, Moritz; Doskoč, Vanja; Schäfers, Wolfgang; Friedrich, TobiasAutomated valuation models: improving model performance by choosing the optimal spatial training levelJournal of Property Research 2023: 365–390

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Cohen, Sarel; Hershcovitch, Moshik; Taraz, Martin; Kißig, Otto; Issac, Davis; Wood, Andrew; Waddington, Daniel; Chin, Peter; Friedrich, TobiasImproved And Optimized Drug Repurposing For The SARS-CoV-2 PandemicPlos One 2023

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Friedrich, Tobias; Lenzner, Pascal; Molitor, Louise; Seifert, LarsSingle-Peaked Jump Schelling GamesInternational Symposium on Algorithmic Game Theory (SAGT) 2023

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Cseh, Ágnes; Führlich, Pascal; Lenzner, PascalThe Swiss GambitAutonomous Agents and Multi-Agent Systems (AAMAS) 2023

    [ ][ ][ URL ][ Download ]

  •  

    Friedrich, Tobias; Lenzner, Pascal; Molitor, Louise; Seifert, LarsSingle-Peaked Jump Schelling GamesAutonomous Agents and Multiagent Systems (AAMAS) 2023: 2899–2901

    [ ][ ][ URL ][ Download ]

  •  

    Böther, Maximilian; Kißig, Otto; Weyand, ChristopherEfficiently Computing Directed Minimum Spanning TreesSIAM Symposium on Algorithm Engineering and Experiments (ALENEX) 2023: 86–95

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Khomutovskiy, Ivan; Dunker, Rebekka; Dierking, Jessica; Egbert, Julian; Helms, Christian; Schöllkopf, Finn; Casel, Katrin; Fischbeck, Philipp; Friedrich, Tobias; Isaac, Davis; Krogmann, Simon; Lenzner, PascalApplying Skeletons to Speed Up the Arc-Flags Routing AlgorithmSIAM Symposium on Algorithm Engineering and Experiments (ALENEX) 2023: 110–122

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Krämer, Bastian; Stang, Moritz; Doskoč, Vanja; Schäfers, Wolfgang; Friedrich, TobiasAutomated Valuation Models: Improving Model Performance by Choosing the Optimal Spatial Training LevelAmerican Real Estate Society (ARES) 2023: 1–26

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Casel, Katrin; Friedrich, Tobias; Schirneck, Martin; Wietheger, SimonFair Correlation Clustering in ForestsFoundations of Responsible Computing (FORC) 2023: 9:1–9:12

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Friedrich, Tobias; Göbel, Andreas; Katzmann, Maximilian; Schiller, LeonCliques in High-Dimensional Geometric Inhomogeneous Random GraphsInternational Colloquium on Automata, Languages and Programming (ICALP) 2023: 62:1–62:13

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Gadea Harder, Jonathan; Krogmann, Simon; Lenzner, Pascal; Skopalik, AlexanderStrategic Resource Selection with Homophilic AgentsInternational Joint Conference on Artificial Intelligence (IJCAI) 2023: 2701–2709

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Friedrich, Tobias; Gawendowicz, Hans; Lenzner, Pascal; Zahn, ArthurThe Impact of Cooperation in Bilateral Network CreationACM Symposium on Principles of Distributed Computing (PODC) 2023

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Angrick, Sebastian; Bals, Ben; Casel, Katrin; Cohen, Sarel; Friedrich, Tobias; Hastrich, Niko; Hradilak, Theresa; Issac, Davis; Kißig, Otto; Schmidt, Jonas; Wendt, LeoSolving Directed Feedback Vertex Set by Iterative Reduction to Vertex CoverSymposium on Experimental Algorithms (SEA) 2023: 10:1–10:14

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Stephan, DanielStrongly Hyperbolic Unit Disk GraphsSymposium Theoretical Aspects of Computer Science (STACS) 2023: 13:1–13:17

    [ ][ ][ URL ][ DOI ][ Download ]

2022

  •  

    Bläsius, Thomas; Friedrich, Tobias; Lischeid, Julius; Meeks, Kitty; Schirneck, MartinEfficiently Enumerating Hitting Sets of Hypergraphs Arising in Data ProfilingJournal of Computer and System Sciences 2022: 192–213

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Cseh, Ágnes; Peters, JannikThree-Dimensional Popular Matching with Cyclic PreferencesAutonomous Agents and Multi-Agent Systems (AAMAS) 2022: 77–87

    [ ][ ][ URL ][ Download ]

  •  

    Cseh, Ágnes; Friedrich, Tobias; Peters, JannikPareto Optimal and Popular House Allocation with Lower and Upper QuotasAutonomous Agents and Multi-Agent Systems (AAMAS) 2022: 300–308

    [ ][ ][ URL ][ Download ]

  •  

    Bläsius, Thomas; Friedrich, Tobias; Stangl, David; Weyand, ChristopherAn Efficient Branch-and-Bound Solver for Hitting SetAlgorithm Engineering and Experiments (ALENEX) 2022

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Hildebrandt, Philipp; Schulze, Maximilian; Cohen, Sarel; Doskoč, Vanja; Saabni, Raid; Friedrich, TobiasOptical Character Recognition Guided Image Super ResolutionSymposium on Document Engineering (DocEng) 2022: 1–4

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Führlich, Pascal; Cseh, Ágnes; Lenzner, PascalImproving Ranking Quality and Fairness in Swiss-System Chess TournamentsACM Conference on Economics and Computation (EC) 2022: 1101–1102

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Angrick, Sebastian; Bals, Ben; Hastrich, Niko; Kleissl, Maximilian; Schmidt, Jonas; Doskoč, Vanja; Katzmann, Maximilian; Molitor, Louise; Friedrich, TobiasTowards Explainable Real Estate Valuation via Evolutionary AlgorithmsGenetic and Evolutionary Computation Conference (GECCO) 2022: 1130–1138

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Friedrich, Tobias; Kötzing, Timo; Radhakrishnan, Aishwarya; Schiller, Leon; Schirneck, Martin; Tennigkeit, Georg; Wietheger, SimonCrossover for Cardinality Constrained OptimizationGenetic and Evolutionary Computation Conference (GECCO) 2022: 1399–1407

    Best Paper Award (Theory Track)

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Friedrich, Tobias; Gawendowicz, Hans; Lenzner, Pascal; Melnichenko, AnnaSocial Distancing Network CreationInternational Colloquium on Automata, Languages and Programming (ICALP) 2022: 62:1–62:21

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Böther, Maximilian; Kißig, Otto; Taraz, Martin; Cohen, Sarel; Seidel, Karen; Friedrich, TobiasWhat’s Wrong with Deep Learning in Tree Search for Combinatorial OptimizationInternational Conference on Learning Representations (ICLR) 2022

    [ ][ ][ URL ][ Download ]

  •  

    Bilò, Davide; Casel, Katrin; Choudhary, Keerti; Cohen, Sarel; Friedrich, Tobias; Lagodzinski, J.A. Gregor; Schirneck, Martin; Wietheger, SimonFixed-Parameter Sensitivity OraclesInnovations in Theoretical Computer Science (ITCS) 2022: 23:1–23:18

    [ ][ ][ URL ][ DOI ][ Download ]

2021

  •  

    Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Lowski, Stefanie; Melnichenko, AnnaSelfish Creation of Social NetworksConference on Artificial Intelligence (AAAI) 2021: 5185–5193

    [ ][ ][ URL ][ Download ]

  •  

    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, SimonLearning Languages with Decidable HypothesesComputability in Europe (CiE) 2021: 25–37

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Cohen, Sarel; Hershcovitch, Moshik; Taraz, Martin; Kißig, Otto; Wood, Andrew; Waddington, Daniel; Chin, Peter; Friedrich, TobiasDrug Repurposing using Link Prediction on Knowledge Graphs with Applications to Non-Volatile MemoryComplex Networks and their Applications (ComplexNetworks) 2021: 742–753

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Behrendt, Lukas; Casel, Katrin; Friedrich, Tobias; Lagodzinski, J. A. Gregor; Löser, Alexander; Wilhelm, MarcusFrom Symmetry to Asymmetry: Generalizing TSP Approximations by ParametrizationFundamentals of Computation Theory (FCT) 2021: 53–66

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    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, TobiasFine-Grained Localization, Classification and Segmentation of Lungs with Various DiseasesCVPR Workshop on Fine-Grained Visual Categorization (FGVC@CVPR) 2021

    [ ][ ][ URL ][ Download ]

  •  

    Böther, Maximilian; Schiller, Leon; Fischbeck, Philipp; Molitor, Louise; Krejca, Martin S.; Friedrich, TobiasEvolutionary Minimization of Traffic CongestionGenetic and Evolutionary Computation Conference (GECCO) 2021: 937–945

    Best-Paper Award (RWA Track)

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Krogmann, Simon; Lenzner, Pascal; Molitor, Louise; Skopalik, AlexanderTwo-Stage Facility Location Games with Strategic Clients and FacilitiesInternational Joint Conference on Artificial Intelligence (IJCAI) 2021: 292–298

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Casel, Katrin; Friedrich, Tobias; Issac, Davis; Klodt, Nicolas; Seifert, Lars; Zahn, ArthurA Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved HeuristicsKnowledge Discovery and Data Mining (KDD) 2021: 882–891

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Kißig, Otto; Taraz, Martin; Cohen, Sarel; Doskoč, Vanja; Friedrich, TobiasDrug Repurposing for Multiple COVID Strains using Collaborative FilteringICLR Workshop on Machine Learning for Preventing and Combating Pandemics (MLPCP@ICLR) 2021

    [ ][ ][ Download ]

  •  

    Atzberger, Daniel; Cech, Tim; de la Haye, Merlin; Söchting, Maximilian; Scheibel, Willy; Limberger, Daniel; Döllner, JürgenSoftware Forest: A Visualization of Semantic Similarities in Source Code using a Tree MetaphorProceedings of the 16th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications -- Volume 3 IVAPP 2021: 112–122

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Friedemann, Wilhelm; Friedrich, Tobias; Gawendowicz, Hans; Lenzner, Pascal; Melnichenko, Anna; Peters, Jannik; Stephan, Daniel; Vaichenker, MichaelEfficiency and Stability in Euclidean Network DesignSymposium on Parallelism in Algorithms and Architectures (SPAA) 2021: 232–242

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Kißig, Otto; Taraz, Martin; Cohen, Sarel; Friedrich, TobiasDrug Repurposing Using Link Prediction on Knowledge GraphsICML Workshop on Computational Biology (WCB@ICML) 2021: 742–753

    [ ][ ][ DOI ][ Download ]

2020

  •  

    Birnick, Johann; Bläsius, Thomas; Friedrich, Tobias; Naumann, Felix; Papenbrock, Thorsten; Schirneck, MartinHitting Set Enumeration with Partial Information for Unique Column Combination DiscoveryProceedings of the VLDB Endowment 2020: 2270–2283

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    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; Wietheger, SimonA Strategic Routing Framework and Algorithms for Computing Alternative PathsAlgorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) 2020: 10:1–10:14

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Friedrich, Tobias; Krejca, Martin S.; Lagodzinski, J. A. Gregor; Rizzo, Manuel; Zahn, ArthurMemetic Genetic Algorithms for Time Series Compression by Piecewise Linear ApproximationInternational Conference on Neural Information Processing (ICONIP) 2020: 592–604

    [ ][ ][ DOI ][ Download ]

  •  

    Echzell, Hagen; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, AnnaFlow-Based Network Creation GamesInternational Joint Conference on Artificial Intelligence (IJCAI) 2020: 139–145

    [ ][ ][ URL ][ DOI ][ Download ]

2019

  •  

    Friedrich, Tobias; Krejca, Martin S.; Rothenberger, Ralf; Arndt, Tobias; Hafner, Danijar; Kellermeier, Thomas; Krogmann, Simon; Razmjou, ArminRouting for On-Street Parking Search using Probabilistic DataAI Communications 2019: 113–124

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Doerr, Benjamin; Fischbeck, Philipp; Frahnow, Clemens; Friedrich, Tobias; Kötzing, Timo; Schirneck, MartinIsland Models Meet Rumor SpreadingAlgorithmica 2019: 886–915

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Bläsius, Thomas; Friedrich, Tobias; Lischeid, Julius; Meeks, Kitty; Schirneck, MartinEfficiently Enumerating Hitting Sets of Hypergraphs Arising in Data ProfilingAlgorithm Engineering and Experiments (ALENEX) 2019: 130–143

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    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, TobiasMixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment ProblemInternational Conference on Automated Planning and Scheduling (ICAPS) 2019: 541–554

    [ ][ ][ URL ][ Download ]

  •  

    Bläsius, Thomas; Fischbeck, Philipp; Friedrich, Tobias; Schirneck, MartinUnderstanding the Effectiveness of Data Reduction in Public Transportation NetworksWorkshop on Algorithms and Models for the Web Graph (WAW) 2019: 87–101

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Echzell, Hagen; Friedrich, Tobias; Lenzner, Pascal; Molitor, Louise; Pappik, Marcus; Schöne, Friedrich; Sommer, Fabian; Stangl, DavidConvergence and Hardness of Strategic Schelling SegregationWeb and Internet Economics (WINE) 2019: 156–170

    [ ][ ][ DOI ][ Download ]

2018

  •  

    Bläsius, Thomas; Freiberger, Cedric; Friedrich, Tobias; Katzmann, Maximilian; Montenegro-Retana, Felix; Thieffry, MarianneEfficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic GeometryInternational Colloquium on Automata, Languages, and Programming (ICALP) 2018: 20:1–20:14

    [ ][ ][ URL ][ DOI ][ Download ]

  •  

    Frahnow, Clemens; Kötzing, TimoRing Migration Topology Helps Bypassing Local OptimaParallel Problem Solving From Nature (PPSN) 2018: 129–140

    [ ][ ][ Download ]

  •  

    Bläsius, Thomas; Eube, Jan; Feldtkeller, Thomas; Friedrich, Tobias; Krejca, Martin S.; Lagodzinski, J. A. Gregor; Rothenberger, Ralf; Severin, Julius; Sommer, Fabian; Trautmann, JustinMemory-restricted Routing With Tiled Map DataSystems, Man, and Cybernetics (SMC) 2018: 3347–3354

    [ ][ ][ DOI ][ Download ]

  •  

    Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Krohmer, Anton; Striebel, JonathanTowards a Systematic Evaluation of Generative Network ModelsWorkshop on Algorithms and Models for the Web Graph (WAW) 2018: 99–114

    [ ][ ][ URL ][ DOI ][ Download ]

2017

  •  

    Doerr, Benjamin; Fischbeck, Philipp; Frahnow, Clemens; Friedrich, Tobias; Kötzing, Timo; Schirneck, MartinIsland Models Meet Rumor SpreadingGenetic and Evolutionary Computation Conference (GECCO) 2017: 1359–1366

    [ ][ ][ DOI ][ Download ]

  •  

    Friedrich, Tobias; Ihde, Sven; Keßler, Christoph; Lenzner, Pascal; Neubert, Stefan; Schumann, DavidEfficient Best Response Computation for Strategic Network Formation under AttackSymposium on Algorithmic Game Theory (SAGT) 2017: 199–211

    [ ][ ][ DOI ][ Download ]

  •  

    Friedrich, Tobias; Ihde, Sven; Keßler, Christoph; Lenzner, Pascal; Neubert, Stefan; Schumann, DavidBrief Announcement: Efficient Best Response Computation for Strategic Network Formation under AttackSymposium on Parallelism in Algorithms and Architectures (SPAA) 2017: 321–323

    [ ][ ][ DOI ][ Download ]

2016

  •  

    Arndt, Tobias; Hafner, Danijar; Kellermeier, Thomas; Krogmann, Simon; Razmjou, Armin; Krejca, Martin S.; Rothenberger, Ralf; Friedrich, TobiasProbabilistic Routing for On-Street Parking SearchEuropean Symposium on Algorithms (ESA) 2016: 6:1–6:13

    [ ][ ][ DOI ][ Download ]

  •  

    Kötzing, Timo; Schirneck, MartinTowards an Atlas of Computational Learning TheorySymposium on Theoretical Aspects of Computer Science (STACS) 2016: 47:1–47:13

    [ ][ ][ URL ][ DOI ][ Download ]