About me

I am currently a postdoctoral researcher at TU Berlin in the research group 'Combinatorial optimization and graph algorithms' of Martin Skutella. Before moving to Berlin, I spent 4 months at Georgia Tech in Atlanta in the research group of Tom Trotter, supported by a fellowship of the Swiss National Science foundation, and before that 6 months at ETH Zurich in the 'Theory of combinatorial algorithms group' of Emo Welzl. Between 2012 and 2014 I worked as a software engineer at Supercomputing Systems Zurich. In 2011 I completed my PhD at ETH Zurich in the research group 'Combinatorial structures and algorithms' of Angelika Steger.

Research interests

My research interests are in discrete mathematics and theoretical computer science, and in their applications to real-world problems. Specifically, I am interested in the following subjects:

• Combinatorial algorithms and discrete structures - Check out the Combinatorial Object Server++
• Random graph processes
• Ramsey theory
• Combinatorial games

Selected papers

• Sparse Kneser graphs are Hamiltonian (with Jerri Nummenpalo and Bartosz Walczak)
  STOC 2018
• A constant-time algorithm for middle levels Gray codes (with Jerri Nummenpalo)
  SODA 2017
• Proof of the middle levels conjecture
  Proceedings of the London Mathematical Society 112(4):677-713, 2016
• Bipartite Kneser graphs are Hamiltonian (with Pascal Su)
  Combinatorica 37(6):1207-1219, 2017
  
• Coloring random graphs online without creating monochromatic subgraphs (with Thomas Rast and Reto Spöhel)
  SODA 2011 + Random, Structures & Algorithms 44(4):419-464, 2014
  
• Small subgraphs in random graphs and the power of multiple choices (with Reto Spöhel and Henning Thomas)
  Journal of Combinatorial Theory, Series B 101(4):237-268, 2011

Full bibliography on: DBLP, Google Scholar, Arxiv

Student projects

Please contact me () if you are an excellent student and interested in writing your bachelor or master thesis about one of the topics below:

• Hamilton cycles in Kneser graphs
• Sparse Ramsey graphs
• Shortest paths in disk coverings

Coauthors

I already had the pleasure of working with the following researchers and students:
Oswin Aichholzer, Gustavo Alonso, Michael Belfrage, Aaron Bernstein, Jean Cardinal, Herman Z. Q. Chen, Yann Disser, Karl Däubel (2), Elizabeth Hartung, Tony Huynh, Stefan Felsner, Martina Furrer, Petr Gregor (3), Dan Hefetz, Sven Jäger (2), Sergey Kitaev, Linda Kleist, Max Klimm, Kolja Knauer, Fabian Kuhn, Jerri Nummenpalo (6), Ueli Peter, Thomas Rast, Justus Schwartz, Leon Sering, Reto Spöhel (6), Joe Sawada, Manfred Scheucher (2), Frieder Smolny, Christoph Standke, Raphael Steiner, Patrick Stuedi, Pascal Su, Brian Y. Sun, Henning Thomas, Birgit Vogtenhuber, Bartosz Walczak (2), Franziska Weber, Veit Wiechert (2), Kaja Wille, Aaron Williams