Skip to main content

Dr. Felix Hommelsheim

Bild von Dr. Felix Hommelsheim

Universität Bremen
FB3: Mathematik/Informatik
Bibliothekstr. 5
28359 Bremen
Germany
Office: MZH 3280
Phone: +49 (421) 218-63582
Email
Office hours: by appointment

About me

I am a postdoc at the University of Bremen at the group of Prof. Dr. Nicole Megow. I reiceived my PhD in Mathematics from TU Dortmund in 2020, where I was supervised by Prof. Dr. Christoph Buchheim.

Research Interests

  • Combinatorial Optimization
  • Efficient algorithms, approximation algorithms
  • Network Design, reconfiguration, scheduling
  • Uncertainty models: robust, online

Publications

Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults
Adjiashvili D., Hommelsheim F., Muehlenthaler M., Schaudt O.
SWAT, 2022

Flexible Graph Connectivity
Adjiashvili A., Hommelsheim F., Mühlenthaler M.
Mathematical Programming, 2021

On the complexity of robust bilevel optimization with uncertain follower’s objective
Buchheim C., Henke D., Hommelsheim F.
Operations Research Letters, 2021

Fixed-Parameter Algorithms for Graph Constraint Logic
Hatanaka T., Hommelsheim F., Ito T., Kobayashi Y., Mühlenthaler M., Suzuki A.
IPEC 2020: International Symposium on Parameterized and Exact Computation

Flexible Graph Connectivity
Adjiashvili A., Hommelsheim F., Mühlenthaler M.
IPCO 2020: Integer Programming and Combinatorial Optimization

How to Secure Matchings Against Edge Failures
Hommelsheim F.,Mühlenthaler M., Schaudt O.
STACS 2019: International Symposium on Theoretical Aspects of Computer Science
Full Version accepted at Siam Journal on Discrete Mathematics

Preprints

On the Complexity of the Bilevel Minimum Spanning Tree Problem
Buchheim C., Henke H., Hommelsheim F.
arXiv:2012.12770, 2020

Fault-Tolerant Edge-Disjoint Paths - Beyond Uniform Faults
Adjiashvili A., Hommelsheim F., Mühlenthaler M., Schaudt O.
arXiv:2009.05382, 2020