Dr. Felix Hommelsheim

About me

I am a postdoc at the University of Bremen at the group of Prof. Dr. Nicole Megow. I received my PhD in Mathematics from TU Dortmund in 2020, where I was supervised by Prof. Dr. Christoph Buchheim.

Research Interests

• Combinatorial Optimization
• Efficient algorithms, approximation algorithms
• Network Design, reconfiguration, scheduling
• Uncertainty models: robust, online

Publications

Improved Approximation Algorithms for the Expanding Search Problem
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior
Accepted for publication at ESA 2023.

Matching Augmentation via Simultaneous Contractions
Mohit Garg, Felix Hommelsheim, Nicole Megow 
Accepted for publication at ICALP 2023.

Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults
Adjiashvili D., Hommelsheim F., Muehlenthaler M., Schaudt O.
SWAT, 2022

Flexible Graph Connectivity
Adjiashvili A., Hommelsheim F., Mühlenthaler M.
Mathematical Programming, 2021

On the complexity of robust bilevel optimization with uncertain follower’s objective
Buchheim C., Henke D., Hommelsheim F.
Operations Research Letters, 2021

Fixed-Parameter Algorithms for Graph Constraint Logic
Hatanaka T., Hommelsheim F., Ito T., Kobayashi Y., Mühlenthaler M., Suzuki A.
IPEC 2020: International Symposium on Parameterized and Exact Computation

Flexible Graph Connectivity
Adjiashvili A., Hommelsheim F., Mühlenthaler M.
IPCO 2020: Integer Programming and Combinatorial Optimization

How to Secure Matchings Against Edge Failures
Hommelsheim F.,Mühlenthaler M., Schaudt O.
STACS 2019: International Symposium on Theoretical Aspects of Computer Science
Full Version accepted at Siam Journal on Discrete Mathematics

Preprints

On the Complexity of the Bilevel Minimum Spanning Tree Problem
Buchheim C., Henke H., Hommelsheim F.
arXiv:2012.12770, 2020

Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults
Adjiashvili A., Hommelsheim F., Mühlenthaler M., Schaudt O.
arXiv:2009.05382, 2020