Felix Hommelsheim

Orcid: 0000-0003-4444-9793

Affiliations:
  • University of Bremen, Germany


According to our database1, Felix Hommelsheim authored at least 18 papers between 2018 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

2018
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
6
1
2
3
2
2
1
1
1
1
1
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures.
CoRR, January, 2025

A Tight (3/2 + <i>∈</i> )-Approximation Algorithm for Demand Strip Packing.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

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

Two-Edge Connectivity via Pac-Man Gluing.
CoRR, 2024

Accelerating Matroid Optimization through Fast Imprecise Oracles.
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.
Theor. Comput. Sci., November, 2023

Fixed-parameter algorithms for graph constraint logic.
Theor. Comput. Sci., May, 2023

Recoverable Robust Optimization with Commitment.
CoRR, 2023

Matching Augmentation via Simultaneous Contractions.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Improved Approximation Algorithms for the Expanding Search Problem.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
On the complexity of the bilevel minimum spanning tree problem.
Networks, 2022

Flexible Graph Connectivity.
Math. Program., 2022

Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2021
How to Secure Matchings against Edge Failures.
SIAM J. Discret. Math., 2021

On the complexity of robust bilevel optimization with uncertain follower's objective.
Oper. Res. Lett., 2021

2020
Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults.
CoRR, 2020

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

2018
How to Secure Matchings Against Edge Failures.
CoRR, 2018


  Loading...