Felix Hommelsheim

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 22

Top Topics

Graph Connectivity

Network Design Problem

Top Venues

Theor. Comput. Sci.

Oper. Res. Lett.

Publications

Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter
Accelerating Matroid Optimization through Fast Imprecise Oracles. CoRR (2024)
Mohit Garg, Felix Hommelsheim, Nicole Megow
Matching Augmentation via Simultaneous Contractions. ICALP (2023)
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
Fixed-parameter algorithms for graph constraint logic. Theor. Comput. Sci. 959 (2023)
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior
Improved Approximation Algorithms for the Expanding Search Problem. ESA (2023)
Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
Feedback vertex set reconfiguration in planar graphs. Theor. Comput. Sci. 979 (2023)
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior
Improved Approximation Algorithms for the Expanding Search Problem. CoRR (2023)
Felix Hommelsheim, Nicole Megow, Komal Muluk, Britta Peis
Recoverable Robust Optimization with Commitment. CoRR (2023)
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
Flexible Graph Connectivity. Math. Program. 192 (1) (2022)
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. SWAT (2022)
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
On the complexity of the bilevel minimum spanning tree problem. Networks 80 (3) (2022)
Mohit Garg, Felix Hommelsheim, Nicole Megow
Matching Augmentation via Simultaneous Contractions. CoRR (2022)
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective. CoRR (2021)
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
On the complexity of robust bilevel optimization with uncertain follower's objective. Oper. Res. Lett. 49 (5) (2021)
Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
How to Secure Matchings against Edge Failures. SIAM J. Discret. Math. 35 (3) (2021)
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults. CoRR (2020)
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
Fixed-Parameter Algorithms for Graph Constraint Logic. IPEC (2020)
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
On the Complexity of the Bilevel Minimum Spanning Tree Problem. CoRR (2020)
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
Fixed-Parameter Algorithms for Graph Constraint Logic. CoRR (2020)
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
Flexible Graph Connectivity. IPCO (2020)
Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
How to Secure Matchings Against Edge Failures. STACS (2019)
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity. CoRR (2019)
Viktor Bindewald, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt
How to Secure Matchings Against Edge Failures. CoRR (2018)