Simon Meierhans is currently a PhD student at ETH Zurich advised by Rasmus Kyng and Maximilian Probst Gutenberg where he is pursuing fundamental challenges in graph algorithms. He received his M.Sc. degree and B.Sc. degree (with distinction) in Computer Science from ETH Zurich. His current research interests center around fast graph algorithms and their applications, and his work relies on both combinatorial and continuous optimization techniques.