Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Campus E1 4, Room 305
I am a researcher at Max Planck Institute for Informatics.
I am interested in theoretical computer science in general.
More specifically, I study conditional lower bounds (e.g. based on the Strong Exponential Time Hypothesis), algorithm design including but not limited to computational geometry, and random graph models for real world networks. I recently rejoined MPI after staying one year at ETH Zurich and four months at the Simons Institute for the Theory of Computing, Berkeley.
The best way to reach me is by e-mail.
For a complete list of publications look here
FOCS'15: Proc. of the 55th Annual IEEE Symposium on Foundations of Computer Science
SoCG'15: Proc. of the 31st International Symposium on Computational Geometry
FOCS'14: Proc. of the 55th Annual IEEE Symposium on Foundations of Computer Science
STACS'14: Proc. of the 31st Symposium on Theoretical Aspects of Computer Science
STOC'13: Proc. of the 45th ACM Symposium on the Theory of Computing
ICALP'12: Proc. of the 39th International Colloquium on Automata, Languages and Programming
SoCG'10: Proc. of the 2010 Annual Symposium on Computational Geometry