Happach, Felix;Schulz, Andreas S.Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set CoverMathematics of Operations Research2023
Giannakopoulos, Yiannis;Poças, Diogo;Tsigonias-Dimitriadis, AlexandrosRobust Revenue Maximization Under Minimal Statistical InformationACM Transactions on Economics and Computation20221031-34
Leichter, Marilena;Moseley, Benjamin;Pruhs, KirkAn Efficient Reduction of a Gammoid to a Partition MatroidSchloss Dagstuhl - Leibniz-Zentrum für Informatik2021
Eckl, Alexander;Kirschbaum, Anja;Leichter, Marilena;Schewior, KevinA stronger impossibility for fully online matchingOperations Research Letters2021495802-808
Leichter, Marilena;Moseley, Benjamin;Pruhs, KirkOn the impossibility of decomposing binary matroidsOperations Research Letters2022505623-625
Gottschau, Marinus;Leichter, MarilenaMinimum Hitting Set of Interval Bundles Problem: Computational Complexity and ApproximabilityAlgorithmica20228482222-2239
Black, Alexander E.;Borgwardt, Steffen;Brugger, MatthiasOn the Circuit Diameter Conjecture for Counterexamples to the Hirsch ConjectureCoRR2023abs/2302.03977
Schulz, Andreas S.;Telha, ClaudioInteger Factorization: Why Two-Item Joint Replenishment Is HardOperations Research2022
166 p.Lotteries, Prophets, and Pandora’s Box: A New Take on Classic Problems in Mechanism Design and Online SelectionDissertation2022Tsigonias-Dimitriadis, Alexandros
Giannakopoulos, Yiannis;Grosz, Alexander;Melissourgos, ThemistoklisOn the Smoothed Complexity of Combinatorial Local Search2022