Beginning fall 2008, I will be a PhD student in the Theory Group of the MIT Computer Science and Artificial Intelligence Laboratory. The last two semesters I was a visiting graduate student at the Theory Group of Princeton's Computer Science Department. I am working with Robert E. Tarjan.

I studied in Germany at the Technical University Munich in the diploma program for Computer Science and the diploma program for Mathematics. In October 2007, after only three years instead of the regular five to six, I graduated summa cum laude (GPA: 4.00) with a mathematics diploma.

I am furthermore a fellow of the elite graduate program TopMath in Applied Mathematics. In TopMath I am supervised by Ernst W. Mayr and specialize in theoretical computer science. In 2007 I completed the TopMath Elite Bachelor of Science and won the "Best Study Award" for my independent studies. I expect to gain the TopMath Master of Science in June 2008.

• Faster Algorithms for Incremental Topological Ordering
  with Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen and Robert E. Tarjan, accepted to ICALP 2008, April 2008
  to appear in Lecture Notes in Computer Science Series, Springer-Verlag
  PDF

• Incremental Topological Ordering and Strong Component Maintenance
  with Siddhartha Sen and Robert E. Tarjan, February 2008
  released under arXiv:0803.0792v1 [cs.DS]
  PDF

• Planarity Algorithms via PQ-trees
  with Robert E. Tarjan, accepted to Topological & Geometric Graph Theory International Conference 2008, January 2008
  to appear in Electronic Notes in Discrete Mathematics, Elsevier
  PDF (extended abstract)

• Finding a Feasible Flow in a Strongly Connected Network
  with Robert E. Tarjan, December 2007
  to appear in Operations Research Letters, Elsevier
  PDF

• Maximum flows in planar networks
  diploma thesis, supervised by Ernst W. Mayr, December 2007