Algorithmik und Komplexitätstheorie

Abschlussarbeiten

2022

Thesis

E. Deltl, "Algorithmic Complexity of Bi-Criteria Multilevel Committee Election", TU Berlin, Mai 2022.

Master-Thesis

L. Glessen, "Algorithmic Approaches to Cluster Editing on Multipartite Hypergraphs", TU Berlin, 2022.

2021

Thesis

L. Nau, "Algorithmic Complexity of Successive Evacuation in Decaying Temporal Graphs", TU Berlin, Dez. 2021.

PhD-Thesis

M. Bentert, "Elements of Dynamic and 2-SAT Programming: Paths, Trees, and Cuts", Technische Universität Berlin, Nov. 2021.
H. Schulz, "On Efficient Cut-Based Data Reduction for Weighted Cluster Editing", TU Berlin, Nov. 2021.
M. Herkenrath, "The Influence of Habitat Structure on the Algorithmic Complexity of Placing Green Bridges", TU Berlin, Nov. 2021.
P. Ruß, "Using Temporal Graph Comparison for Sign Language Recognition", TU Berlin, Nov. 2021.

Master-Thesis

L. Goldmann, "Parameterized Complexity of Modifying Graphs to be Biclique-free", TU Berlin, Sep. 2021.
T. Jaron-Strugala, "Parametrisierte Algorithmen zum Finden von Petersen-Teilgraphen", TU Berlin, Sep. 2021.
L. Kreisel, "On Equilibria in Schelling Games: Robustness and Multimodality", TU Berlin, Jun. 2021.
N. Wünsche, "Mind the Gap When Searching for Relaxed Cliques", TU Berlin, Mä. 2021.
B. Arinalp, "Multistage Committee Elections: Beyond Plurality Voting", TU Berlin, Mä. 2021.
R. Wolf, "Towards Linear-Time Parameterized Algorithms for Strongly Stable Matching", TU Berlin, Mä. 2021.

2020

Thesis

J. Schulte-Mattler, "Algorithmen und Experimente für das Electric Vehicle Scheduling-Problem", TU Berlin, Dez. 2020.
L. J. Rasche, "Synergie zwischen ÖPNV und Radfahren, modelliert als Routing in Temporalen Graphen", TU Berlin, Dez. 2020.
L. Steinhau, "Parameterized Algorithmics of Multistage Matching", TU Berlin, Dez. 2020.

PhD-Thesis

H. Molter, "Classic Graph Problems Made Temporal - A Parameterized Complexity Analysis", Technische Universität Berlin, Dez. 2020.

Master-Thesis

T. Koana, "Algorithmic and Structural Aspects of Matrix Completion Problems", TU Berlin, Dez. 2020.
P. Kunz, "Proximity and Intractibility - Revisiting Classic Graph Problems", TU Berlin, Dez. 2020.
J. Henkel, "Competitive Diffusion Games on Graphs Made Temporal", TU Berlin, Okt. 2020.
M. Rymar, "Towards Generalized Algorithmic Concepts for Temporal Betweenness Centrality", TU Berlin, Okt. 2020.
T. Fluschnik, "Elements of efficient data reduction: fractals, diminishers, weights and neighborhoods", PhD Thesis, Technische Universität Berlin, Jun. 2020.
L. Müller, "On Reachable Assignments in Social Networks", TU Berlin, Mai 2020.

2019

Thesis

L. Kalkbrenner, "Coalitional Manipulation for Multiwinner Elections: Algorithms and Experiments", TU Berlin, Dez. 2019.
J. Schröder, "Comparing Graph Parameters", TU Berlin, Nov. 2019.

Seite 1 von 4