This page presents completed Bachelor theses conducted at the Algorithms and Complexity Group (TU Wien), including research abstracts, supervisors, and downloadable PDF reports.
đź’ˇ Looking for open thesis topics? Please check our current Open Bachelor & Master Theses.
Author: Felix Kainz
Supervisor: Prof. Martin Nöllenburg | Assistance: Alexander Dobler
Published: October 31, 2025
Abstract: Storyline visualizations encode interactions between characters over time, with x-monotone curves representing characters that converge when they interact. However, excessive line crossings quickly reduce readability. This thesis investigates the One-Sided Crossing Minimization in Time Interval Storylines with a Protagonist (1-SCM-TI-P), a variant where one main character remains fixed while interactions within the same temporal group may be reordered freely. We introduce an exact ILP formulation for crossing minimization together with a fast lower bound and develop a scalable heuristic framework combining a TSP-based initialization with Simulated Annealing using structured neighborhood operations. Experiments on real-world research collaboration networks derived from DBLP show that the heuristics achieve near-optimal solutions within milliseconds while the ILP is limited to small or sparse instances.
đź“„ Download PDFAuthor: Anna Henriksson
Supervisor: Prof. Martin Nöllenburg | Assistance: Dr. Simon Dominik Fink
Published: March 8, 2025
Abstract: Presentations are a fundamental part of communicating work progress and results to an audience. While generic tools like PowerPoint provide animation features, specialized academic tools such as IPE do not natively support them. This thesis presents ipe_animations, a tool that generates animations for IPE presentations by bridging IPE with Manim. We analyze requirements, construct a common graphics model between both systems, and provide a user-friendly implementation along with future development perspectives.
Author: Sebastian Wodniansky-Wildenfeld
Supervisor: Prof. Martin Nöllenburg | Assistance: Dr. Simon Dominik Fink
Published: February 11, 2025
Abstract: Planarity testing is the problem of determining whether a given graph can be drawn in the plane without edge crossings. The Left-Right planarity testing method (Rosenstiehl & de Fraysseix 1982, refined by Brandes 2008) provides an elegant approach. This thesis implements Brandes’ simplified variant and systematically compares it with state-of-the-art planarity testing algorithms, evaluating practical runtime efficiency and implementation readability.
đź“„ Download PDFAuthor: Simon Niederwolfsgruber
Supervisor: Prof. Martin Nöllenburg | Assistance: Thomas Depian
Published: November 30, 2024
Abstract: Label placement is a central problem in automated cartography. While point and line labeling are well established, area labeling requires complex conformity metrics. This thesis introduces the Height-Constrained Area Labeling problem and proposes a C++ labeling pipeline placing labels along circular arcs within boundary polygons. The method enhances quality through clustering and local search heuristics.
đź“„ Download PDF