Structured Instances of Restricted Assignment with Two Processing Times. - Klaus Jansen; Lars Rohwedder (CALDAM, 2017)

On the Configuration-LP of the Restricted Assignment Problem. - Klaus Jansen; Lars Rohwedder (SODA, 2017)

Compact LP Relaxations for Allocation Problems. - Klaus Jansen; Lars Rohwedder (SOSA, 2018)

Local Search Breaks 1.75 for Graph Balancing. - Klaus Jansen; Lars Rohwedder (ICALP, 2019)

On Integer Programming and Convolution. - Klaus Jansen; Lars Rohwedder (ITCS, 2019)

Algorithms for Integer Programming and Allocation. - Lars Rohwedder (2019)

Robust Algorithms Under Adversarial Injections. - Paritosh Garg; Sagar Kale; Lars Rohwedder; Ola Svensson (ICALP, 2020)

Learning Augmented Energy Minimization via Speed Scaling. - Étienne Bamas; Andreas Maggiori; Lars Rohwedder; Ola Svensson (NeurIPS, 2020)

The Combinatorial Santa Claus Problem or: How to Find Good Matchings in Non-Uniform Hypergraphs. - Étienne Bamas; Paritosh Garg; Lars Rohwedder (CoRR, 2020)

A (2+ε)-approximation algorithm for preemptive weighted flow time on a single machine. - Lars Rohwedder; Andreas Wiese (CoRR, 2020)

A note on the integrality gap of the configuration LP for restricted Santa Claus. - Klaus Jansen; Lars Rohwedder (Inf. Process. Lett., 2020)

A Quasi-Polynomial Approximation for the Restricted Assignment Problem. - Klaus Jansen; Lars Rohwedder (SIAM J. Comput., 2020)

Near-Linear Time Algorithm for n-Fold ILPs via Color Coding. - Klaus Jansen; Alexandra Lassota; Lars Rohwedder (SIAM J. Discret. Math., 2020)

Knapsack and Subset Sum with Small Items. - Adam Polak 001; Lars Rohwedder; Karol Wegrzycki (ICALP, 2021)

The Submodular Santa Claus Problem in the Restricted Assignment Case. - Étienne Bamas; Paritosh Garg; Lars Rohwedder (ICALP, 2021)

Additive Approximation Schemes for Load Balancing Problems. - Moritz Buchem; Lars Rohwedder; Tjark Vredeveld; Andreas Wiese (ICALP, 2021)

Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. - Jana Cslovjecsek; Friedrich Eisenbrand; Christoph Hunkenschröder; Lars Rohwedder; Robert Weismantel (SODA, 2021)

A (2 + ε)-approximation algorithm for preemptive weighted flow time on a single machine. - Lars Rohwedder; Andreas Wiese (STOC, 2021)

Towards Non-Uniform k-Center with Constant Types of Radii. - Xinrui Jia 001; Lars Rohwedder; Kshiteej Sheth; Ola Svensson (CoRR, 2021)

Approximation Results for Makespan Minimization with Budgeted Uncertainty. - Marin Bougeret; Klaus Jansen; Michael Poss; Lars Rohwedder (Theory Comput. Syst., 2021)

Load Balancing: The Long Road from Theory to Practice. - Sebastian Berndt 001; Max A. Deppert; Klaus Jansen; Lars Rohwedder (ALENEX, 2022)

Towards Non-Uniform k-Center with Constant Types of Radii. - Xinrui Jia 001; Lars Rohwedder; Kshiteej Sheth; Ola Svensson (SOSA, 2022)

Cardinality Constrained Scheduling in Online Models. - Leah Epstein; Alexandra Lassota; Asaf Levin; Marten Maack; Lars Rohwedder (STACS, 2022)

Flow time scheduling and prefix Beck-Fiala. - Nikhil Bansal 001; Lars Rohwedder; Ola Svensson (STOC, 2022)

Optimizing Low Dimensional Functions over the Integers. - Daniel Dadush; Arthur Léonard; Lars Rohwedder; José Verschae (IPCO, 2023)

On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. - Kim-Manuel Klein; Adam Polak 001; Lars Rohwedder (SODA, 2023)

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

Better Trees for Santa Claus. - Étienne Bamas; Lars Rohwedder (STOC, 2023)

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

Online bin covering with limited migration. - Sebastian Berndt 001; Leah Epstein; Klaus Jansen; Asaf Levin; Marten Maack; Lars Rohwedder (J. Comput. Syst. Sci., 2023)

On Integer Programming, Discrepancy, and Convolution. - Klaus Jansen; Lars Rohwedder (Math. Oper. Res., 2023)

Online cardinality constrained scheduling. - Leah Epstein; Alexandra Lassota; Asaf Levin; Marten Maack; Lars Rohwedder (Oper. Res. Lett., 2023)

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. - Friedrich Eisenbrand; Lars Rohwedder; Karol Wegrzycki (FOCS, 2024)

Santa Claus meets Makespan and Matroids: Algorithms and Reductions. - Étienne Bamas; Alexander Lindermayr; Nicole Megow; Lars Rohwedder; Jens Schlöter (SODA, 2024)

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

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines. - Lars Rohwedder (ICALP, 2025)

Cost Preserving Dependent Rounding for Allocation Problems. - Lars Rohwedder; Arman Rouhani; Leo Wennmann (ICALP, 2025)

3.415-Approximation for Coflow Scheduling via Iterated Rounding. - Lars Rohwedder; Leander Schnaars (ICALP, 2025)

Fine-Grained Equivalence for Problems Related to Integer Linear Programming. - Lars Rohwedder; Karol Wegrzycki (ITCS, 2025)

Space-Efficient Algorithm for Integer Programming with Few Constraints. - Lars Rohwedder; Karol Wegrzycki (IPCO, 2025)

The Submodular Santa Claus Problem. - Étienne Bamas; Sarah Morell; Lars Rohwedder (SODA, 2025)

A k-swap local search for makespan scheduling. - Lars Rohwedder; Ashkan Safari; Tjark Vredeveld (Comput. Oper. Res., 2025)

Smoothed analysis of the k-swap neighborhood for makespan scheduling. - Lars Rohwedder; Ashkan Safari; Tjark Vredeveld (Oper. Res. Lett., 2025)

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

Non-Adaptive Evaluation of k-of-n Functions: Tight Gap and a Unit-Cost PTAS. - Mads Anker Nielsen; Lars Rohwedder; Kevin Schewior (CoRR, 2025)