Bachelor's and Master's Projects and Theses at the Chair for Algorithms and Data Structures

Note: this is a new page, created on 07-02-2017. The old page, which was outdated and in a terrible format, can still be found here.

Deliverables

B.Sc. and M.Sc. thesis: (1) written thesis; (2) oral presentation (20 minutes + question); (3) well-documented version of your code and data, which allow reproducibility of your results, in our SVN. Here are some guidelines on how to write a good thesis. See the list at the end of this page for many examples (of submitted theses and the accompanying presentation).

B.Sc. and M.Sc. projects: (1) a project website; (2) well-documented version of your code and data, which allow reproducibility of your results, in our SVN. See the list at the end of this page for many examples (of project websites).

Available projects and theses (click on the titles for more information)

A User Interface for the QLever SPARQL+Text engine (project or thesis): This is well-suited as a project (B.Sc. or M.Sc.) but also provides ample opportunity for continuation with a theses (B.Sc. or M.Sc). You should be fond of good user interfaces and have a good taste concerning layout and colors and such things. You should also like knowledge bases and big datasets and searching in them. Supervised by Hannah Bast.

Generating Regular-Interval Maps from Public Transit Data (project or thesis, ongoing): We are looking for well-structured input data for our transit-map drawing algorithm. The goal of this topic is to provide the transit-mapper with a graph from which it can render regular-intervall timetable maps ("Taktfahrplankarten") like this. You should be a fan of huge datasets, timetable data and of course graphs (but who isn't). As a bachelor or master project with the possibility of continuation as a thesis. Supervised by Patrick Brosi.

Merging Overlapping GTFS Feeds (Bachelor project or thesis): Many transportation companies publish their timetable data either directly as GTFS feeds or in formats that can be converted to GTFS. As soon as you have two GTFS feeds (two sets of timetable data) that cover either the same or adjacent areas, the problem of duplicate trips arises. You should develop a tool that merges two or more GTFS feeds and solves duplication / fragmentation issues. As a bachelor project or thesis. Supervised by Patrick Brosi.

GTFS Browser Web App (Bachelor project or thesis): Develop a web-application that can be used to analyze huge GTFS datasets. There are already some tools available (for example, ScheduleViewer) but they all feel and look quite clumsy, are incredible slow and cannot handle large datasets. Supervised by Patrick Brosi.

Completed projects and theses

List of completed B.Sc. and M.Sc. theses (each with the written thesis and presentation)

List of completed B.Sc. and M.Sc. projects (each with a project website)