A PTAS for Minimizing Weighted Flow Time on a Single Machine. - Alexander Armbruster 002; Lars Rohwedder; Andreas Wiese (STOC, 2023)

Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm. - Alexander Armbruster 002; Lars Rohwedder; Andreas Wiese (CoRR, 2023)

Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm. - Alexander Armbruster 002; Lars Rohwedder; Andreas Wiese (SOSA, 2024)

On the Approximability of Unsplittable Flow on a Path with Time Windows. - Alexander Armbruster 002; Fabrizio Grandoni 001; Edin Husic; Antoine Tinguely; Andreas Wiese (IPCO, 2025)

Multiplicative assignment with upgrades. - Alexander Armbruster 002; Lars Rohwedder; Stefan Weltge; Andreas Wiese; Ruilong Zhang 001 (CoRR, 2025)

Augmenting Packing Dynamic Programs to Handle (Many) Additional Budget Constraints. - Alexander Armbruster 002; Fabrizio Grandoni 001; Antoine Tinguely; Andreas Wiese (SODA, 2026)

A (2 + ε)-approximation algorithm for the general scheduling problem in quasipolynomial time. - Alexander Armbruster 002; Lars Rohwedder; Andreas Wiese (SODA, 2026)

Improved Approximation Algorithms for Non-preemptive Throughput Maximization. - Alexander Armbruster 002; Fabrizio Grandoni 001; Antoine Tinguely; Andreas Wiese (STOC, 2026)

Minimizing Weighted Flow Time. - Alexander Armbruster 002; Lars Rohwedder; Andreas Wiese (J. ACM, 2026)