Theses & Student Projects

Bachelor's, Master's, and Project Theses in the Algorithms and Complexity Group

How to Apply for a Thesis

We continuously supervise Bachelor's Theses (Bachelorarbeit), Master's Theses (Diplomarbeit), and Project Theses (Projektarbeit). In addition to specific open calls, many topics are formulated individually based on our ongoing research projects.

📩 Direct Inquiry via Email:

If you are interested in writing a thesis with us, please contact the faculty member whose research area best matches your interests directly by email.

Please make sure to provide / attach:

  • A current transcript of your academic records (Sammelzeugnis).
  • Your study program and preferred thesis type (Bachelor, Master, Project).
  • A short statement about your specific interests, relevant completed courses, and programming or mathematical skills.

You can also check the official TU Wien TISS Theses Database for centrally advertised topics.

Open Theses Topics

Current proposals and open calls for Bachelor's and Master's theses

There are currently no specific calls listed. Please follow the instructions above for individual initiative applications!

Research Focus Areas & Supervisors

Find a potential supervisor based on your field of interest

Satisfiability & Automated Reasoning

SAT/QBF solving, combinatorial search, symmetry breaking, SMS, and translating hard decision/optimization problems into SAT.

👤 Contact: Stefan Szeider

Graph Drawing & Network Visualization

Algorithms for geometric representations of networks, graph layout models, visual graph theory, and interactive visualization tools.

👤 Contact: Martin Nöllenburg

Computational Geometry & Cartography

Geometric algorithms for map labeling, schematic transit maps, boundary labeling, and spatial visualization problems.

👤 Contact: Martin Nöllenburg

Combinatorial Optimization & Metaheuristics

Exact and heuristic optimization, integer linear programming (ILP), vehicle routing, personnel scheduling, and hybrid search methods.

👤 Contact: Günther Raidl

Parameterized & Exact Algorithms

Parameterized complexity, structural graph decompositions (treewidth, cliquewidth), kernelization, and fine-grained complexity.

👤 Contact: Robert Ganian

Computational Social Choice

Algorithms for collective decision making, multi-winner voting rules, preference aggregation, and fair resource allocation.

👤 Contact: Jiehua Chen

Completed Theses Archive

Browse past Bachelor's, Master's, and Doctoral dissertations

Completed Bachelor Theses

Explore completed Bachelor theses written in our research group with abstracts and full-text PDF downloads.

Browse Bachelor Archive
Completed Master & PhD Theses

Access published Diploma theses and Doctoral dissertations supervised in our group via TU Wien Repositum.

TU Wien Repositum