Bauerhenne, Carolin;Kolisch, Rainer;Schulz, Andreas S.
Robust Appointment Scheduling with Waiting Time Guarantees
CoRR
2024

Schulz, Andreas S.;Telha, Claudio
On the complexity of a maintenance problem for hierarchical systems
CoRR
2023

Grosz, Alexander;Kietreiber, Tobias;Pfannerer, Stephan;Rubey, Martin
A bijectionist's toolkit
Séminaire Lotharingien de Combinatoire
2023
89B
-

Brandl, Lukas;Schulz, Andreas S.
Primal Separation and Approximation for the {0, 1/2}-closure
CoRR
2023

Kaiser, Marcus
Disjoint Paths, Dynamic Equilibria, and the Design of Networks
2022

Happach, Felix;Schulz, Andreas S.
Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover
Mathematics of Operations Research
2023
49
1
578–598

Giannakopoulos, Yiannis;Poças, Diogo;Tsigonias-Dimitriadis, Alexandros
Robust Revenue Maximization Under Minimal Statistical Information
ACM Transactions on Economics and Computation
2022
10
3
1-34

Leichter, Marilena;Moseley, Benjamin;Pruhs, Kirk
An Efficient Reduction of a Gammoid to a Partition Matroid
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2021

Eckl, Alexander;Kirschbaum, Anja;Leichter, Marilena;Schewior, Kevin
A stronger impossibility for fully online matching
Operations Research Letters
2021
49
5
802-808

Leichter, Marilena;Moseley, Benjamin;Pruhs, Kirk
On the impossibility of decomposing binary matroids
Operations Research Letters
2022
50
5
623-625