Felix Hommelsheim

33 papers A* 5A 3B 2Journal 22Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A* conf
A Better-Than-5/4-Approximation for Two-Edge Connectivity.
SODA
Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu
2026 J jnl
Improved Approximation Algorithms for the Expanding Search Problem.
SIAM J. Discret. Math.
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior
2025 A* conf
A 5/4-Approximation for Two-Edge Connectivity.
STOC
Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni, Felix Hommelsheim, Afrouz Jabal Ameli, Alexander Lindermayr
2025 J jnl
A Better-Than-5/4-Approximation for Two-Edge Connectivity.
CoRR
Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu
2025 A* conf
A Tight (3/2 +
SODA
Franziska Eberle, Felix Hommelsheim, Malin Rau, Stefan Walzer
2025 J jnl
Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation.
CoRR
Felix Hommelsheim
2025 A conf
Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures.
STACS
Felix Hommelsheim, Zhenwei Liu, Nicole Megow, Guochuan Zhang
2025 J jnl
Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures.
CoRR
Felix Hommelsheim, Zhenwei Liu, Nicole Megow, Guochuan Zhang
2024 J jnl
A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing.
CoRR
Franziska Eberle, Felix Hommelsheim, Malin Rau, Stefan Walzer
2024 A* conf
Accelerating Matroid Optimization through Fast Imprecise Oracles.
NeurIPS
Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter
2024 J jnl
Accelerating Matroid Optimization through Fast Imprecise Oracles.
CoRR
Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter
2024 J jnl
Two-Edge Connectivity via Pac-Man Gluing.
CoRR
Mohit Garg, Felix Hommelsheim, Alexander Lindermayr
2023 J jnl
Feedback vertex set reconfiguration in planar graphs.
Theor. Comput. Sci.
Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2023 J jnl
Fixed-parameter algorithms for graph constraint logic.
Theor. Comput. Sci.
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2023 A conf
Improved Approximation Algorithms for the Expanding Search Problem.
ESA
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior
2023 J jnl
Improved Approximation Algorithms for the Expanding Search Problem.
CoRR
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior
2023 A* conf
Matching Augmentation via Simultaneous Contractions.
ICALP
Mohit Garg, Felix Hommelsheim, Nicole Megow
2023 J jnl
Recoverable Robust Optimization with Commitment.
CoRR
Felix Hommelsheim, Nicole Megow, Komal Muluk, Britta Peis
2022 — conf
Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults.
SWAT
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2022 J jnl
Flexible Graph Connectivity.
Math. Program.
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
2022 J jnl
Matching Augmentation via Simultaneous Contractions.
CoRR
Mohit Garg, Felix Hommelsheim, Nicole Megow
2022 J jnl
On the complexity of the bilevel minimum spanning tree problem.
Networks
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
2021 J jnl
How to Secure Matchings against Edge Failures.
SIAM J. Discret. Math.
Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2021 J jnl
On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective.
CoRR
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
2021 J jnl
On the complexity of robust bilevel optimization with uncertain follower's objective.
Oper. Res. Lett.
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
2020 J jnl
Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults.
CoRR
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2020 B conf
Fixed-Parameter Algorithms for Graph Constraint Logic.
IPEC
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2020 J jnl
Fixed-Parameter Algorithms for Graph Constraint Logic.
CoRR
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2020 B conf
Flexible Graph Connectivity.
IPCO
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
2020 J jnl
On the Complexity of the Bilevel Minimum Spanning Tree Problem.
CoRR
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
2019 J jnl
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity.
CoRR
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
2019 A conf
How to Secure Matchings Against Edge Failures.
STACS
Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
2018 J jnl
How to Secure Matchings Against Edge Failures.
CoRR
Viktor Bindewald, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt