How to Secure Matchings Against Edge Failures. - Viktor Bindewald; Felix Hommelsheim; Moritz Mühlenthaler; Oliver Schaudt (CoRR, 2018)

Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity. - David Adjiashvili; Felix Hommelsheim; Moritz Mühlenthaler (CoRR, 2019)

Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults. - David Adjiashvili; Felix Hommelsheim; Moritz Mühlenthaler; Oliver Schaudt (CoRR, 2020)

On the complexity of robust bilevel optimization with uncertain follower's objective. - Christoph Buchheim; Dorothee Henke; Felix Hommelsheim (Oper. Res. Lett., 2021)

How to Secure Matchings against Edge Failures. - Felix Hommelsheim; Moritz Mühlenthaler; Oliver Schaudt (SIAM J. Discret. Math., 2021)

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

Flexible Graph Connectivity. - David Adjiashvili; Felix Hommelsheim; Moritz Mühlenthaler (Math. Program., 2022)

On the complexity of the bilevel minimum spanning tree problem. - Christoph Buchheim; Dorothee Henke; Felix Hommelsheim (Networks, 2022)

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

Matching Augmentation via Simultaneous Contractions. - Mohit Garg 003; Felix Hommelsheim; Nicole Megow (ICALP, 2023)

Recoverable Robust Optimization with Commitment. - Felix Hommelsheim; Nicole Megow; Komal Muluk; Britta Peis (CoRR, 2023)

Fixed-parameter algorithms for graph constraint logic. - Tatsuhiko Hatanaka; Felix Hommelsheim; Takehiro Ito; Yusuke Kobayashi 001; Moritz Mühlenthaler; Akira Suzuki 001 (Theor. Comput. Sci., 2023)

Feedback vertex set reconfiguration in planar graphs. - Nicolas Bousquet 001; Felix Hommelsheim; Yusuke Kobayashi 001; Moritz Mühlenthaler; Akira Suzuki 001 (Theor. Comput. Sci., 2023)

Accelerating Matroid Optimization through Fast Imprecise Oracles. - Franziska Eberle; Felix Hommelsheim; Alexander Lindermayr; Zhenwei Liu; Nicole Megow; Jens Schlöter (NeurIPS, 2024)

Two-Edge Connectivity via Pac-Man Gluing. - Mohit Garg 003; Felix Hommelsheim; Alexander Lindermayr (CoRR, 2024)

A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing. - Franziska Eberle; Felix Hommelsheim; Malin Rau; Stefan Walzer (CoRR, 2024)

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

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures. - Felix Hommelsheim; Zhenwei Liu; Nicole Megow; Guochuan Zhang (STACS, 2025)

A 5/4-Approximation for Two-Edge Connectivity. - Miguel Bosch-Calvo; Mohit Garg 003; Fabrizio Grandoni 001; Felix Hommelsheim; Afrouz Jabal Ameli; Alexander Lindermayr (STOC, 2025)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation. - Felix Hommelsheim (CoRR, 2025)