Felix Hommelsheim

According to our database, Felix Hommelsheim authored at least 20 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation.

Felix Hommelsheim

CoRR, May, 2025

A 5/4-Approximation for Two-Edge Connectivity.

Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni, Felix Hommelsheim, Afrouz Jabal Ameli, Alexander Lindermayr

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures.

Felix Hommelsheim, Zhenwei Liu, Nicole Megow, Guochuan Zhang

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

A Tight (3/2 + <i>∈</i> )-Approximation Algorithm for Demand Strip Packing.

Franziska Eberle, Felix Hommelsheim, Malin Rau, Stefan Walzer

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing.

Franziska Eberle, Felix Hommelsheim, Malin Rau, Stefan Walzer

CoRR, 2024

Two-Edge Connectivity via Pac-Man Gluing.

Mohit Garg, Felix Hommelsheim, Alexander Lindermayr

CoRR, 2024

Accelerating Matroid Optimization through Fast Imprecise Oracles.

Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

2023

Feedback vertex set reconfiguration in planar graphs.

Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki

Theor. Comput. Sci., November, 2023

Fixed-parameter algorithms for graph constraint logic.

Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki

Theor. Comput. Sci., May, 2023

Recoverable Robust Optimization with Commitment.

Felix Hommelsheim, Nicole Megow, Komal Muluk, Britta Peis

CoRR, 2023

Matching Augmentation via Simultaneous Contractions.

Mohit Garg, Felix Hommelsheim, Nicole Megow

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Improved Approximation Algorithms for the Expanding Search Problem.

Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

On the complexity of the bilevel minimum spanning tree problem.

Christoph Buchheim, Dorothee Henke, Felix Hommelsheim

Networks, 2022

Flexible Graph Connectivity.

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler

Math. Program., 2022

Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults.

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2021

How to Secure Matchings against Edge Failures.

Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt

SIAM J. Discret. Math., 2021

On the complexity of robust bilevel optimization with uncertain follower's objective.

Christoph Buchheim, Dorothee Henke, Felix Hommelsheim

Oper. Res. Lett., 2021

2020

Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults.

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt

CoRR, 2020

2019

Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity.

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler

CoRR, 2019

2018

How to Secure Matchings Against Edge Failures.

Viktor Bindewald, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt

CoRR, 2018