Stephan Helfrich

Orcid: 0000-0001-6588-5266

According to our database1, Stephan Helfrich authored at least 8 papers between 2022 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
A Defender-Attacker-Defender Model for Optimizing the Resilience of Hospital Networks to Cyberattacks.
CoRR, January, 2026

Tractable but Hard to Approximate: The Bi-Objective Minimum s-t-Cut Problem With Binary Capacities.
Networks, 2026

2025
Efficiently Constructing Convex Approximation Sets in Multiobjective Optimization Problems.
INFORMS J. Comput., 2025

2024
The Weighted p-Norm Weight Set Decomposition for Multiobjective Discrete Optimization Problems.
J. Optim. Theory Appl., September, 2024

Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory.
Math. Methods Oper. Res., August, 2024

2023
Approximating biobjective minimization problems using general ordering cones.
J. Glob. Optim., June, 2023

Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems.
J. Glob. Optim., June, 2023

2022
An approximation algorithm for a general class of multi-parametric optimization problems.
J. Comb. Optim., 2022


  Loading...