Completed Semester Theses

2022

Generalizing Mantel’s theorem for random graphs to odd cycles
Micha Christoph
Research in Computer Science, supervised by Miloš Trujić

2020

Powers of Hamilton cycles of high discrepancy are unavoidable
Domagoj Bradač
Research in Computer Science, supervised by Miloš Trujić

2018

Evolutionnary Algorithm on Linear Functions with Random Weights
Ulysse Schaller
Semester project, supervised by Johannes Lengler

2017

Improved bounds on the multicolor Ramsey numbers of paths and even cycles
Charlotte Knierim
Research in Computer Science, supervised by Pascal Su

2016

Transferring the Wilshaw model to a geometric setting
Frederik Benzing
Semester project, supervised by Florian Meier and Marcelo Gauy

Predictive Reinforcement Learning
Asier Mujika
Research in Computer Science, supervised by Florian Meier

2014

Fixed Cudget Performance of the (1+1)-EA on Linear Functions
Nick Spooner
Research in Computer Science, supervised by Johannes Lengler

Random percolation with non-uniform activation delays
Simone Forte
Research in Computer Science, supervised by Angelika Steger

SIRS model on random graphs
Steve Muller
Semester project, supervised by Angelika Steger

2010

On sparse Ramsey graphs
Eshan Chattopadhyay
Internship project, supervised by Torsten Mütze

2009

Balanced path avoidance games in random graphs
Nicholas Jimsheleishvili
Internship project, supervised by Luca Gugelmann and Reto Spöhel

Edge-weights vertex coloring
Prakalp Srivastava
Internship project, supervised by Dan Hefetz and Thomas Rast

2008

Asymmetric Online Ramsey Games in Random Graphs
Lutz Warnke
Semester project, supervised by Reto Spöhel

An application of the Combinatorial Nullstellensatz to a graph labeling problem
Huong T. T. Tran
Internship project, supervised by Dan Hefetz

2007

Solutions of Linear Equations in Random Subsets of Integers
Luca Gugelmann
Semester project, supervised by Reto Spöhel

On the k-server Problem
Florian Walpen
Semester project, supervised by Konstantinos Panagiotou

On Nash Equilibria in Network Design Games with Fair Cost Allocation
Salvatore Bonaccorso
Semester project, supervised by Jan Remy

Average Case Analysis of the Random Set Cover Problem
Manuel Forster
Semester project, supervised by Jan Remy

Approximating Prize-Collecting Point Sets
Bruno Gagliano
Semester project, supervised by Jan Remy

Modelling and Simulating the Evolution of Ocular Dominance Maps
Nikunj Bhagat
Internship project, supervised by Florian Jug

On Properties of Random Triangulations
Boris Maistrenko
Internship project, supervised by Konstantinos Panagiotou

Distributed Experts Learning
George Nadareishvili
Internship project, supervised by Fabian Kuhn

Balanced Online Vertex-Coloring Games in Random Graphs
Anupam Prakash
Internship project, supervised by Reto Spöhel

2006

Jigsaw Puzzles with Multiple Solutions
Yoshimi Takano
Semester project, supervised by Konstantinos Panagiotou and Justus Schwartz

The Geometric Vehicle Routing Allocation Problem
Joest Martinus Smit
Semester project, supervised by Jan Remy

Efficient Automated Trading Strategies on the Swiss Stock Exchange
Sulabh Gupta
Internship project, supervised by Julian Lorenz

Scheduling Shifts of Doctors
Vivek Upahdyay
Internship project, supervised by Martin Marciniszyn

2005

Approximation Schemes for Spherical TSP and k-Median
Thomas Locher
Semester project, supervised by Jan Remy

On colouring sparse random graphs
Christian Sommer
Semester project, supervised by Konstantinos Panagiotou

2004

Protein Docking Using Local Shape Distributions
Micha Riser
Semester project, supervised by Jan Remy