Lars Rohwedder

86 papers A* 21A 6B 4Journal 50Unranked 4
YearRankTypeTitle / Venue / Authors
2026 A* conf
A (2 + ε)-approximation algorithm for the general scheduling problem in quasipolynomial time.
SODA
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
2026 J jnl
Makespan minimization for ordinal cardinality constrained scheduling.
Discret. Appl. Math.
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2026 J jnl
Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting.
CoRR
T. R. Avila, Lars Rohwedder, Leo Wennmann
2025 A* conf
3.415-Approximation for Coflow Scheduling via Iterated Rounding.
ICALP
Lars Rohwedder, Leander Schnaars
2025 J jnl
3.415-Approximation for Coflow Scheduling via Iterated Rounding.
CoRR
Lars Rohwedder, Leander Schnaars
2025 J jnl
A (2+ϵ)-approximation algorithm for the general scheduling problem in quasipolynomial time.
CoRR
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
2025 J jnl
A k-swap local search for makespan scheduling.
Comput. Oper. Res.
Lars Rohwedder, Ashkan Safari, Tjark Vredeveld
2025 A* conf
Cost Preserving Dependent Rounding for Allocation Problems.
ICALP
Lars Rohwedder, Arman Rouhani, Leo Wennmann
2025 J jnl
Cost Preserving Dependent Rounding for Allocation Problems.
CoRR
Lars Rohwedder, Arman Rouhani, Leo Wennmann
2025 A* conf
ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines.
ICALP
Lars Rohwedder
2025 J jnl
ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines.
CoRR
Lars Rohwedder
2025 A conf
Fine-Grained Equivalence for Problems Related to Integer Linear Programming.
ITCS
Lars Rohwedder, Karol Wegrzycki
2025 J jnl
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023 Special Issue.
ACM Trans. Algorithms
Nikhil Bansal, Eun Jung Kim, Viswanath Nagarajan, Aaron Potechin, Lars Rohwedder
2025 J jnl
Multiplicative assignment with upgrades.
CoRR
Alexander Armbruster, Lars Rohwedder, Stefan Weltge, Andreas Wiese, Ruilong Zhang
2025 J jnl
Non-Adaptive Evaluation of
CoRR
Mads Anker Nielsen, Lars Rohwedder, Kevin Schewior
2025 A conf
Non-Adaptive Evaluation of k-of- n Functions: Tight Gap and a Unit-Cost PTAS.
APPROX/RANDOM
Mads Anker Nielsen, Lars Rohwedder, Kevin Schewior
2025 J jnl
Randomized Rounding over Dynamic Programs.
CoRR
Étienne Bamas, Shi Li, Lars Rohwedder
2025 J jnl
Smoothed analysis of the k-swap neighborhood for makespan scheduling.
Oper. Res. Lett.
Lars Rohwedder, Ashkan Safari, Tjark Vredeveld
2025 B conf
Space-Efficient Algorithm for Integer Programming with Few Constraints.
IPCO
Lars Rohwedder, Karol Wegrzycki
2025 A* conf
The Submodular Santa Claus Problem.
SODA
Étienne Bamas, Sarah Morell, Lars Rohwedder
2024 J jnl
A k-swap Local Search for Makespan Scheduling.
CoRR
Lars Rohwedder, Ashkan Safari, Tjark Vredeveld
2024 J jnl
Fine-Grained Equivalence for Problems Related to Integer Linear Programming.
CoRR
Lars Rohwedder, Karol Wegrzycki
2024 A* conf
Santa Claus meets Makespan and Matroids: Algorithms and Reductions.
SODA
Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
2024 A* conf
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems.
FOCS
Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki
2024 J jnl
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems.
CoRR
Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki
2024 — conf
Simpler constant factor approximation algorithms for weighted flow time - now for any
SOSA
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
2024 J jnl
Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling.
CoRR
Lars Rohwedder, Ashkan Safari, Tjark Vredeveld
2024 J jnl
Space-Efficient Algorithm for Integer Programming with Few Constraints.
CoRR
Lars Rohwedder, Karol Wegrzycki
2024 J jnl
The Submodular Santa Claus Problem.
CoRR
Étienne Bamas, Sarah Morell, Lars Rohwedder
2023 A* conf
A PTAS for Minimizing Weighted Flow Time on a Single Machine.
STOC
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
2023 A* conf
Better Trees for Santa Claus.
STOC
Étienne Bamas, Lars Rohwedder
2023 J jnl
On Integer Programming, Discrepancy, and Convolution.
Math. Oper. Res.
Klaus Jansen, Lars Rohwedder
2023 A* conf
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs.
SODA
Kim-Manuel Klein, Adam Polak, Lars Rohwedder
2023 J jnl
Online bin covering with limited migration.
J. Comput. Syst. Sci.
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2023 J jnl
Online cardinality constrained scheduling.
Oper. Res. Lett.
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2023 B conf
Optimizing Low Dimensional Functions over the Integers.
IPCO
Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae
2023 J jnl
Optimizing Low Dimensional Functions over the Integers.
CoRR
Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae
2023 J jnl
Santa Claus meets Makespan and Matroids: Algorithms and Reductions.
CoRR
Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
2023 J jnl
Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm.
CoRR
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
2022 J jnl
A PTAS for Minimizing Weighted Flow Time on a Single Machine.
CoRR
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
2022 J jnl
Better Trees for Santa Claus.
CoRR
Étienne Bamas, Lars Rohwedder
2022 A conf
Cardinality Constrained Scheduling in Online Models.
STACS
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2022 J jnl
Cardinality Constrained Scheduling in Online Models.
CoRR
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2022 J jnl
Flow Time Scheduling and Prefix Beck-Fiala.
CoRR
Nikhil Bansal, Lars Rohwedder, Ola Svensson
2022 A* conf
Flow time scheduling and prefix Beck-Fiala.
STOC
Nikhil Bansal, Lars Rohwedder, Ola Svensson
2022 A conf
Load Balancing: The Long Road from Theory to Practice.
ALENEX
Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder
2022 J jnl
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs.
CoRR
Kim-Manuel Klein, Adam Polak, Lars Rohwedder
2022 — conf
Towards Non-Uniform
SOSA
Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson
2021 A* conf
A (2 +
STOC
Lars Rohwedder, Andreas Wiese
2021 A* conf
Additive Approximation Schemes for Load Balancing Problems.
ICALP
Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese
2021 J jnl
Approximation Results for Makespan Minimization with Budgeted Uncertainty.
Theory Comput. Syst.
Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
2021 A* conf
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time.
SODA
Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder, Lars Rohwedder, Robert Weismantel
2021 A* conf
Knapsack and Subset Sum with Small Items.
ICALP
Adam Polak, Lars Rohwedder, Karol Wegrzycki
2021 J jnl
Knapsack and Subset Sum with Small Items.
CoRR
Adam Polak, Lars Rohwedder, Karol Wegrzycki
2021 J jnl
Load Balancing: The Long Road from Theory to Practice.
CoRR
Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder
2021 A* conf
The Submodular Santa Claus Problem in the Restricted Assignment Case.
ICALP
Étienne Bamas, Paritosh Garg, Lars Rohwedder
2021 J jnl
Towards Non-Uniform k-Center with Constant Types of Radii.
CoRR
Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson
2020 J jnl
A (2+ε)-approximation algorithm for preemptive weighted flow time on a single machine.
CoRR
Lars Rohwedder, Andreas Wiese
2020 J jnl
A Quasi-Polynomial Approximation for the Restricted Assignment Problem.
SIAM J. Comput.
Klaus Jansen, Lars Rohwedder
2020 J jnl
A note on the integrality gap of the configuration LP for restricted Santa Claus.
Inf. Process. Lett.
Klaus Jansen, Lars Rohwedder
2020 J jnl
Additive Approximation Schemes for Load Balancing Problems.
CoRR
Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese
2020 A* conf
Learning Augmented Energy Minimization via Speed Scaling.
NeurIPS
Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson
2020 J jnl
Learning Augmented Energy Minimization via Speed Scaling.
CoRR
Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson
2020 J jnl
Near-Linear Time Algorithm for n-Fold ILPs via Color Coding.
SIAM J. Discret. Math.
Klaus Jansen, Alexandra Lassota, Lars Rohwedder
2020 A* conf
Robust Algorithms Under Adversarial Injections.
ICALP
Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson
2020 J jnl
Robust Algorithms under Adversarial Injections.
CoRR
Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson
2020 J jnl
The Combinatorial Santa Claus Problem or: How to Find Good Matchings in Non-Uniform Hypergraphs.
CoRR
Étienne Bamas, Paritosh Garg, Lars Rohwedder
2020 J jnl
The Submodular Santa Claus Problem in the Restricted Assignment Case.
CoRR
Étienne Bamas, Paritosh Garg, Lars Rohwedder
2019 — —
Algorithms for Integer Programming and Allocation.
Lars Rohwedder
2019 B conf
Approximation Results for Makespan Minimization with Budgeted Uncertainty.
WAOA
Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
2019 J jnl
Approximation results for makespan minimization with budgeted uncertainty.
CoRR
Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
2019 A* conf
Local Search Breaks 1.75 for Graph Balancing.
ICALP
Klaus Jansen, Lars Rohwedder
2019 A* conf
Near-Linear Time Algorithm for n-fold ILPs via Color Coding.
ICALP
Klaus Jansen, Alexandra Lassota, Lars Rohwedder
2019 A conf
On Integer Programming and Convolution.
ITCS
Klaus Jansen, Lars Rohwedder
2019 A conf
Online Bin Covering with Limited Migration.
ESA
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2019 J jnl
Online Bin Covering with Limited Migration.
CoRR
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2018 J jnl
A note on the integrality gap of the configuration LP for restricted Santa Claus.
CoRR
Klaus Jansen, Lars Rohwedder
2018 — conf
Compact LP Relaxations for Allocation Problems.
SOSA
Klaus Jansen, Lars Rohwedder
2018 J jnl
Local search breaks 1.75 for Graph Balancing.
CoRR
Klaus Jansen, Lars Rohwedder
2018 J jnl
Near-Linear Time Algorithm for n-fold ILPs via Color Coding.
CoRR
Klaus Jansen, Alexandra Lassota, Lars Rohwedder
2018 J jnl
On Integer Programming and Convolution.
CoRR
Klaus Jansen, Lars Rohwedder
2017 B conf
A Quasi-Polynomial Approximation for the Restricted Assignment Problem.
IPCO
Klaus Jansen, Lars Rohwedder
2017 J jnl
A Quasi-Polynomial Approximation for the Restricted Assignment Problem.
CoRR
Klaus Jansen, Lars Rohwedder
2017 A* conf
On the Configuration-LP of the Restricted Assignment Problem.
SODA
Klaus Jansen, Lars Rohwedder
2017 — conf
Structured Instances of Restricted Assignment with Two Processing Times.
CALDAM
Klaus Jansen, Lars Rohwedder
2016 J jnl
On the Configuration-LP of the Restricted Assignment Problem.
CoRR
Klaus Jansen, Lars Rohwedder