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

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

Gottschau, Marinus;Leichter, Marilena
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability
Algorithmica
2022
84
8
2222-2239

Black, Alexander E.;Borgwardt, Steffen;Brugger, Matthias
On the Circuit Diameter Conjecture for Counterexamples to the Hirsch Conjecture
CoRR
2023
abs/2302.03977

Schulz, Andreas S.;Telha, Claudio
Integer Factorization: Why Two-Item Joint Replenishment Is Hard
Operations Research
2022

166 p.
Lotteries, Prophets, and Pandora’s Box: A New Take on Classic Problems in Mechanism Design and Online Selection
Dissertation
2022
Tsigonias-Dimitriadis, Alexandros

Giannakopoulos, Yiannis;Grosz, Alexander;Melissourgos, Themistoklis
On the Smoothed Complexity of Combinatorial Local Search
2022