Felix Hommelsheim

About Me: 

I am a postdoc at the Center for Mathematical Modeling at Universidad de Chile, supervised by Jose Soto and Jose Verschae. 

My main research interest lies in the intersection of Theoretical Computer Science and Discrete Mathematics. I am interested in the design and analysis of approximation algorithms for graph problems, in particular network design.

I have received my PhD at TU Dortmund in 2020. My advisor was Christoph Buchheim. Subsequently, I was a postdoc at the University of Bremen under the supervision of Nicole Megow.

e-mail: firstname.lastname [at] gmail [dot] com

News: 

• Our paper "A Better-Than-5/4-Approximation for Two-Edge Connectivity"
  (with Alexander Lindermayr and Zhenwei Liu) has been accepted at SODA 2026.

• I gave a talk on my new paper "Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation" at the AGCO seminar at CMM, Universidad de Chile.

• My paper "Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation" is now available on arxiv.

• Our paper "A 5/4-approximation for Two-Edge Connectivity" (with Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli, and Alexander Lindermayr) has been published at STOC 2025.

• Our paper "Protecting the Connectivity of a Graph under Non-Uniform Edge Failures" (with Nicole Megow, Zhenwei Liu, and Guochuan Zhang) has been published at STACS 2025.

• Our paper "A tight (3/2 + eps)-approximation for the Demand Strip Packing Problem" (with Franziska Eberle, Malin Rau, and Stefan Walzer) has been published at SODA 2025.