Stable Clusterings and the Cones of Outer Normals. - Felix Happach (OR, 2017)

Precedence-Constrained Scheduling and Min-Sum Set Cover. - Felix Happach; Andreas S. Schulz (WAOA, 2019)

Budget Minimization with Precedence Constraints. - Marinus Gottschau; Felix Happach; Marcus Kaiser; Clara Waldmann (CoRR, 2019)

Good Clusterings Have Large Volume. - Steffen Borgwardt; Felix Happach (Oper. Res., 2019)

Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover. - Felix Happach; Andreas S. Schulz (CoRR, 2020)

Makespan minimization with OR-precedence constraints. - Felix Happach (J. Sched., 2021)

A General Framework for Approximating Min Sum Ordering Problems. - Felix Happach; Lisa Hellerstein; Thomas Lidbetter (INFORMS J. Comput., 2022)

An Algorithm for the Separation-Preserving Transition of Clusterings. - Steffen Borgwardt; Felix Happach; Stetson Zirkelbach (INFORMS J. Optim., 2023)

Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover. - Felix Happach; Andreas S. Schulz (Math. Oper. Res., 2024)