Sprungmarken

Servicenavigation

Fakultät für Mathematik

Hauptnavigation



Sie sind hier:

Bereichsnavigation



Hauptinhalt

M. Sc. Felix Hommelsheim

Kontakt

Technische Universität Dortmund
Fakultät für Mathematik
Vogelpothsweg 87
44227 Dortmund
Germany

Email: Felix Hommelsheim

Telefon: (0231) 755-7224
Raum: M/514

Sprechstunde

  • nach Vereinbarung (E-Mail genügt)

Interessengebiete

  • Robust Optimization
  • Combinatorial Optimization
  • Approximation Algorithms

Projekte

Dissertation

  • F Hommelsheim:
    Complexity of Bulk-Robust Combinatorial Optimization Problems
    [Dissertation]

Publikationen

  • T Hatanaka and F Hommelsheim and T Ito and Y Kobayashi and M Mühlenthaler and A Suzuki:
    Fixed-Parameter Algorithms for Graph Constraint Logic
    [IPEC2020]
  • D Adjiashvili, F Hommelsheim, and M Mühlenthaler:
    Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity
    [IPCO2020]
  • F Hommelsheim, M Mühlenthaler, and O Schaudt:
    How to Secure Matchings Against Edge Failures
    [STACS2019]

Preprints / Full Versions

  • T C Buchheim and D Henke and F Hommelsheim:
    On the Complexity of the Bilevel Minimum Spanning Tree Problem
    [Arxiv]
  • T Hatanaka and F Hommelsheim and T Ito and Y Kobayashi and M Mühlenthaler and A Suzuki:
    Fixed-Parameter Algorithms for Graph Constraint Logic
    [Arxiv]
  • D Adjiashvili, F Hommelsheim, M Mühlenthaler, and O Schaudt:
    Fault-Tolerant Edge-Disjoint Paths --- Beyond Uniform Faults
    [Arxiv]
  • D Adjiashvili, F Hommelsheim, and M Mühlenthaler:
    Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity
    [Arxiv]
  • F Hommelsheim, M Mühlenthaler, and O Schaudt:
    How to Secure Matchings Against Edge Failures
    [Arxiv]