default search action
Felix Hommelsheim
Person information
- affiliation: University of Bremen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i12]Franziska Eberle, Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu, Nicole Megow, Jens Schlöter:
Accelerating Matroid Optimization through Fast Imprecise Oracles. CoRR abs/2402.02774 (2024) - [i11]Mohit Garg, Felix Hommelsheim, Alexander Lindermayr:
Two-Edge Connectivity via Pac-Man Gluing. CoRR abs/2408.05282 (2024) - [i10]Franziska Eberle, Felix Hommelsheim, Malin Rau, Stefan Walzer:
A Tight (3/2 + ε)-Approximation Algorithm for Demand Strip Packing. CoRR abs/2408.08627 (2024) - 2023
- [j6]Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Fixed-parameter algorithms for graph constraint logic. Theor. Comput. Sci. 959: 113863 (2023) - [j5]Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Feedback vertex set reconfiguration in planar graphs. Theor. Comput. Sci. 979: 114188 (2023) - [c6]Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior:
Improved Approximation Algorithms for the Expanding Search Problem. ESA 2023: 54:1-54:15 - [c5]Mohit Garg, Felix Hommelsheim, Nicole Megow:
Matching Augmentation via Simultaneous Contractions. ICALP 2023: 65:1-65:17 - [i9]Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior:
Improved Approximation Algorithms for the Expanding Search Problem. CoRR abs/2301.03638 (2023) - [i8]Felix Hommelsheim, Nicole Megow, Komal Muluk, Britta Peis:
Recoverable Robust Optimization with Commitment. CoRR abs/2306.08546 (2023) - 2022
- [j4]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler:
Flexible Graph Connectivity. Math. Program. 192(1): 409-441 (2022) - [j3]Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
On the complexity of the bilevel minimum spanning tree problem. Networks 80(3): 338-355 (2022) - [c4]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. SWAT 2022: 5:1-5:19 - [i7]Mohit Garg, Felix Hommelsheim, Nicole Megow:
Matching Augmentation via Simultaneous Contractions. CoRR abs/2211.01912 (2022) - 2021
- [j2]Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
On the complexity of robust bilevel optimization with uncertain follower's objective. Oper. Res. Lett. 49(5): 703-707 (2021) - [j1]Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
How to Secure Matchings against Edge Failures. SIAM J. Discret. Math. 35(3): 2265-2292 (2021) - [i6]Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective. CoRR abs/2105.08378 (2021) - 2020
- [c3]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler:
Flexible Graph Connectivity. IPCO 2020: 13-26 - [c2]Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Fixed-Parameter Algorithms for Graph Constraint Logic. IPEC 2020: 15:1-15:15 - [i5]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults. CoRR abs/2009.05382 (2020) - [i4]Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Fixed-Parameter Algorithms for Graph Constraint Logic. CoRR abs/2011.10385 (2020) - [i3]Christoph Buchheim, Dorothee Henke, Felix Hommelsheim:
On the Complexity of the Bilevel Minimum Spanning Tree Problem. CoRR abs/2012.12770 (2020)
2010 – 2019
- 2019
- [c1]Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
How to Secure Matchings Against Edge Failures. STACS 2019: 38:1-38:16 - [i2]David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler:
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity. CoRR abs/1910.13297 (2019) - 2018
- [i1]Viktor Bindewald, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
How to Secure Matchings Against Edge Failures. CoRR abs/1805.01299 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint