| 2026 | ESA | Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting. | Tatiana Rocha Avila, Lars Rohwedder, Leo Wennmann |
| 2026 | ESA | Graph Scheduling with Group Completion Times. | Lars Rohwedder, Leander Schnaars |
| 2026 | ICALP | Multiplicative Assignment with Upgrades. | Alexander Armbruster, Lars Rohwedder, Stefan Weltge, Andreas Wiese, Ruilong Zhang |
| 2026 | SODA | A (2 + ε)-approximation algorithm for the general scheduling problem in quasipolynomial time. | Alexander Armbruster, Lars Rohwedder, Andreas Wiese |
| 2026 | STOC | Randomized Rounding over Dynamic Programs. | tienne Bamas, Shi Li, Lars Rohwedder |
| 2025 | ICALP | ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines. | Lars Rohwedder |
| 2025 | ICALP | Cost Preserving Dependent Rounding for Allocation Problems. | Lars Rohwedder, Arman Rouhani, Leo Wennmann |
| 2025 | ICALP | 3.415-Approximation for Coflow Scheduling via Iterated Rounding. | Lars Rohwedder, Leander Schnaars |
| 2025 | IPCO | Space-Efficient Algorithm for Integer Programming with Few Constraints. | Lars Rohwedder, Karol Wegrzycki |
| 2025 | SODA | The Submodular Santa Claus Problem. | tienne Bamas, Sarah Morell, Lars Rohwedder |
| 2024 | FOCS | Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. | Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki |
| 2024 | SODA | Santa Claus meets Makespan and Matroids: Algorithms and Reductions. | tienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlter |
| 2023 | IPCO | Optimizing Low Dimensional Functions over the Integers. | Daniel Dadush, Arthur Lonard, Lars Rohwedder, Jos Verschae |
| 2023 | SODA | On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. | Kim-Manuel Klein, Adam Polak, Lars Rohwedder |
| 2023 | STOC | A PTAS for Minimizing Weighted Flow Time on a Single Machine. | Alexander Armbruster, Lars Rohwedder, Andreas Wiese |
| 2023 | STOC | Better Trees for Santa Claus. | tienne Bamas, Lars Rohwedder |
| 2022 | ALENEX | Load Balancing: The Long Road from Theory to Practice. | Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder |
| 2022 | STOC | Flow time scheduling and prefix Beck-Fiala. | Nikhil Bansal, Lars Rohwedder, Ola Svensson |
| 2022 | STACS | Cardinality Constrained Scheduling in Online Models. | Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder |
| 2021 | ICALP | Knapsack and Subset Sum with Small Items. | Adam Polak, Lars Rohwedder, Karol Wegrzycki |
| 2021 | ICALP | The Submodular Santa Claus Problem in the Restricted Assignment Case. | tienne Bamas, Paritosh Garg, Lars Rohwedder |
| 2021 | ICALP | Additive Approximation Schemes for Load Balancing Problems. | Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese |
| 2021 | SODA | Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. | Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschrder, Lars Rohwedder, Robert Weismantel |
| 2021 | STOC | A (2 + | Lars Rohwedder, Andreas Wiese |
| 2020 | ICALP | Robust Algorithms Under Adversarial Injections. | Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson |
| 2019 | ESA | Online Bin Covering with Limited Migration. | Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder |
| 2019 | ICALP | Near-Linear Time Algorithm for n-fold ILPs via Color Coding. | Klaus Jansen, Alexandra Lassota, Lars Rohwedder |
| 2019 | ICALP | Local Search Breaks 1.75 for Graph Balancing. | Klaus Jansen, Lars Rohwedder |
| 2019 | WAOA | Approximation Results for Makespan Minimization with Budgeted Uncertainty. | Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder |
| 2018 | SODA | Compact LP Relaxations for Allocation Problems. | Klaus Jansen, Lars Rohwedder |
| 2017 | IPCO | A Quasi-Polynomial Approximation for the Restricted Assignment Problem. | Klaus Jansen, Lars Rohwedder |
| 2017 | SODA | On the Configuration-LP of the Restricted Assignment Problem. | Klaus Jansen, Lars Rohwedder |