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:

Conference Publications:

A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing 
Franziska Eberle, Felix Hommelsheim, Malin Rau, Stefan Walzer
Accepted at SODA 2025.

Accelerating Matroid Optimization through Fast Imprecise Oracles 
Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schl?ter.
Accepted at NeurIPS 2024.

Improved Approximation Algorithms for the Expanding Search Problem 
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior
European Symposium on Algorithms (ESA) 2023.

Matching Augmentation via Simultaneous Contractions
Mohit Garg, Felix Hommelsheim, Nicole Megow
International Colloquium on Automata, Languages and Programming (ICALP) 2023.

Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
Scandinavian Workshop on Algorithm Theory (SWAT) 2022.

Fixed-Parameter Algorithms for Graph Constraint Logic 
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
International Symposium on Parameterized and Exact Computation (IPEC) 2020.

Flexible Graph Connectivity 
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
Integer Programming and Combinatorial Optimization (IPCO) 2020.

How to Secure Matchings Against Edge Failures 
Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
International Symposium on Theoretical Aspects of Computer Science (STACS) 2019.
 

Journal Publications:

Feedback vertex set reconfiguration in planar graphs 
Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Theoretical Computer Science.

Fixed-parameter algorithms for graph constraint logic 
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Theoretical Computer Science.

Flexible Graph Connectivity 
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
Mathematical Programming.

On the complexity of the bilevel minimum spanning tree problem 
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
Networks.

On the complexity of robust bilevel optimization with uncertain follower's objective 
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
Operations Research Letters.

How to Secure Matchings Against Edge Failures 
Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
Siam Journal on Discrete Mathematics.


Preprints:

Two-Edge Connectivity via Pac-Man Gluing
Mohit Garg, Felix Hommelsheim, Alexander Lindermayr

Recoverable Robust Optimization with Commitment
Felix Hommelsheim, Nicole Megow, Komal Muluk, Britta Peis