Algorithmics and Computational Complexity
Theses
2022
Master-Thesis
S.
Bruchhold,
"A Simple and Robust Measure of Triadic Closure: Algorithmic and Structural Aspects",
BachelorThesis,
TU Berlin,
Sep.
2022.
Thesis
S.
Bruchhold,
"A Simple and Robust Measure of Triadic Closure: Algorithmic and Structural Aspects",
TU Berlin,
Sep.
2022.
E.
Deltl,
"Algorithmic Complexity of Bi-Criteria Multilevel Committee Election",
BachelorThesis,
TU Berlin,
May
2022.
E.
Deltl,
"Algorithmic Complexity of Bi-Criteria Multilevel Committee Election",
TU Berlin,
May
2022.
L.
Glessen,
"Algorithmic Approaches to Cluster Editing on Multipartite Hypergraphs",
MasterThesis,
TU Berlin,
2022.
2021
Thesis
L.
Nau,
"Algorithmic Complexity of Successive Evacuation in Decaying Temporal Graphs",
TU Berlin,
Dec.
2021.
Master-Thesis
L.
Nau,
"Algorithmic Complexity of Successive Evacuation in Decaying Temporal Graphs",
BachelorThesis,
TU Berlin,
Dec.
2021.
M.
Herkenrath,
"The Influence of Habitat Structure on the Algorithmic Complexity of Placing Green Bridges",
BachelorThesis,
TU Berlin,
Nov.
2021.
H.
Schulz,
"On Efficient Cut-Based Data Reduction for Weighted Cluster Editing",
BachelorThesis,
TU Berlin,
Nov.
2021.
P.
Ruß,
"Using Temporal Graph Comparison for Sign Language Recognition",
BachelorThesis,
TU Berlin,
Nov.
2021.
P.
Ruß,
"Using Temporal Graph Comparison for Sign Language Recognition",
TU Berlin,
Nov.
2021.
PhD-Thesis
M.
Bentert,
"Elements of Dynamic and 2-SAT Programming: Paths, Trees, and Cuts",
PhD Thesis,
Technische Universität Berlin,
Nov.
2021.
M.
Herkenrath,
"The Influence of Habitat Structure on the Algorithmic Complexity of Placing Green Bridges",
TU Berlin,
Nov.
2021.
H.
Schulz,
"On Efficient Cut-Based Data Reduction for Weighted Cluster Editing",
TU Berlin,
Nov.
2021.
T.
Jaron-Strugala,
"Parametrisierte Algorithmen zum Finden von Petersen-Teilgraphen",
TU Berlin,
Sep.
2021.
L.
Goldmann,
"Parameterized Complexity of Modifying Graphs to be Biclique-free",
MasterThesis,
TU Berlin,
Sep.
2021.
T.
Jaron-Strugala,
"Parametrisierte Algorithmen zum Finden von Petersen-Teilgraphen",
BachelorThesis,
TU Berlin,
Sep.
2021.
L.
Kreisel,
"On Equilibria in Schelling Games: Robustness and Multimodality",
TU Berlin,
Jun.
2021.
L.
Kreisel,
"On Equilibria in Schelling Games: Robustness and Multimodality",
BachelorThesis,
TU Berlin,
Jun.
2021.
R.
Wolf,
"Towards Linear-Time Parameterized Algorithms for Strongly Stable Matching",
TU Berlin,
Mar.
2021.
N.
Wünsche,
"Mind the Gap When Searching for Relaxed Cliques",
MasterThesis,
TU Berlin,
Mar.
2021.
B.
Arinalp,
"Multistage Committee Elections: Beyond Plurality Voting",
BachelorThesis,
TU Berlin,
Mar.
2021.
B.
Arinalp,
"Multistage Committee Elections: Beyond Plurality Voting",
TU Berlin,
Mar.
2021.
R.
Wolf,
"Towards Linear-Time Parameterized Algorithms for Strongly Stable Matching",
BachelorThesis,
TU Berlin,
Mar.
2021.
A.
Kaczmarczyk,
"Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments",
PhD Thesis,
Technische Universität Berlin,
2021.