Lars Rohwedder

ORCID

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 61

Top Venues

University of Kiel, Germany (PHD)

Education History

University of Kiel, Germany

PHD

Publications

Alexander Armbruster, Lars Rohwedder, Andreas Wiese
-norm. SOSA (2024)
Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. CoRR (2024)
Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. SODA (2024)
Lars Rohwedder, Ashkan Safari, Tjark Vredeveld
A k-swap Local Search for Makespan Scheduling. CoRR (2024)
Étienne Bamas, Sarah Morell, Lars Rohwedder
The Submodular Santa Claus Problem. CoRR (2024)
Étienne Bamas, Lars Rohwedder
Better Trees for Santa Claus. STOC (2023)
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
Online cardinality constrained scheduling. Oper. Res. Lett. 51 (5) (2023)
Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae
Optimizing Low Dimensional Functions over the Integers. CoRR (2023)
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
Online bin covering with limited migration. J. Comput. Syst. Sci. 134 (2023)
Kim-Manuel Klein, Adam Polak, Lars Rohwedder
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. SODA (2023)
Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. CoRR (2023)
Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae
Optimizing Low Dimensional Functions over the Integers. IPCO (2023)
Klaus Jansen, Lars Rohwedder
On Integer Programming, Discrepancy, and Convolution. Math. Oper. Res. 48 (3) (2023)
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm. CoRR (2023)
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
A PTAS for Minimizing Weighted Flow Time on a Single Machine. STOC (2023)
Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson
-Center with Constant Types of Radii. SOSA (2022)
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
Cardinality Constrained Scheduling in Online Models. STACS (2022)
Nikhil Bansal, Lars Rohwedder, Ola Svensson
Flow time scheduling and prefix Beck-Fiala. STOC (2022)
Kim-Manuel Klein, Adam Polak, Lars Rohwedder
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. CoRR (2022)
Nikhil Bansal, Lars Rohwedder, Ola Svensson
Flow Time Scheduling and Prefix Beck-Fiala. CoRR (2022)
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
Cardinality Constrained Scheduling in Online Models. CoRR (2022)
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
A PTAS for Minimizing Weighted Flow Time on a Single Machine. CoRR (2022)
Étienne Bamas, Lars Rohwedder
Better Trees for Santa Claus. CoRR (2022)
Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder
Load Balancing: The Long Road from Theory to Practice. ALENEX (2022)
Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson
Towards Non-Uniform k-Center with Constant Types of Radii. CoRR (2021)
Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder
Load Balancing: The Long Road from Theory to Practice. CoRR (2021)
Étienne Bamas, Paritosh Garg, Lars Rohwedder
The Submodular Santa Claus Problem in the Restricted Assignment Case. ICALP (2021)
Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
Approximation Results for Makespan Minimization with Budgeted Uncertainty. Theory Comput. Syst. 65 (6) (2021)
Adam Polak, Lars Rohwedder, Karol Wegrzycki
Knapsack and Subset Sum with Small Items. CoRR (2021)
Adam Polak, Lars Rohwedder, Karol Wegrzycki
Knapsack and Subset Sum with Small Items. ICALP (2021)
Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder, Lars Rohwedder, Robert Weismantel
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. SODA (2021)
Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese
Additive Approximation Schemes for Load Balancing Problems. ICALP (2021)
Lars Rohwedder, Andreas Wiese
)-approximation algorithm for preemptive weighted flow time on a single machine. STOC (2021)
Étienne Bamas, Paritosh Garg, Lars Rohwedder
The Combinatorial Santa Claus Problem or: How to Find Good Matchings in Non-Uniform Hypergraphs. CoRR (2020)
Klaus Jansen, Lars Rohwedder
A note on the integrality gap of the configuration LP for restricted Santa Claus. Inf. Process. Lett. 164 (2020)
Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson
Robust Algorithms Under Adversarial Injections. ICALP (2020)
Lars Rohwedder, Andreas Wiese
A (2+ε)-approximation algorithm for preemptive weighted flow time on a single machine. CoRR (2020)
Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese
Additive Approximation Schemes for Load Balancing Problems. CoRR (2020)
Klaus Jansen, Lars Rohwedder
A Quasi-Polynomial Approximation for the Restricted Assignment Problem. SIAM J. Comput. 49 (6) (2020)
Klaus Jansen, Alexandra Lassota, Lars Rohwedder
Near-Linear Time Algorithm for n-Fold ILPs via Color Coding. SIAM J. Discret. Math. 34 (4) (2020)
Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson
Learning Augmented Energy Minimization via Speed Scaling. NeurIPS (2020)
Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson
Robust Algorithms under Adversarial Injections. CoRR (2020)
Étienne Bamas, Paritosh Garg, Lars Rohwedder
The Submodular Santa Claus Problem in the Restricted Assignment Case. CoRR (2020)
Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson
Learning Augmented Energy Minimization via Speed Scaling. CoRR (2020)
Klaus Jansen, Lars Rohwedder
On Integer Programming and Convolution. ITCS (2019)
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
Online Bin Covering with Limited Migration. CoRR (2019)
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
Online Bin Covering with Limited Migration. ESA (2019)
Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
Approximation results for makespan minimization with budgeted uncertainty. CoRR (2019)
Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
Approximation Results for Makespan Minimization with Budgeted Uncertainty. WAOA (2019)
Klaus Jansen, Alexandra Lassota, Lars Rohwedder
Near-Linear Time Algorithm for n-fold ILPs via Color Coding. ICALP (2019)
Klaus Jansen, Lars Rohwedder
Local Search Breaks 1.75 for Graph Balancing. ICALP (2019)
Klaus Jansen, Lars Rohwedder
Compact LP Relaxations for Allocation Problems. SOSA (2018)
Klaus Jansen, Lars Rohwedder
Local search breaks 1.75 for Graph Balancing. CoRR (2018)
Klaus Jansen, Alexandra Lassota, Lars Rohwedder
Near-Linear Time Algorithm for n-fold ILPs via Color Coding. CoRR (2018)
Klaus Jansen, Lars Rohwedder
On Integer Programming and Convolution. CoRR (2018)
Klaus Jansen, Lars Rohwedder
A note on the integrality gap of the configuration LP for restricted Santa Claus. CoRR (2018)
Klaus Jansen, Lars Rohwedder
Structured Instances of Restricted Assignment with Two Processing Times. CALDAM (2017)
Klaus Jansen, Lars Rohwedder
On the Configuration-LP of the Restricted Assignment Problem. SODA (2017)
Klaus Jansen, Lars Rohwedder
A Quasi-Polynomial Approximation for the Restricted Assignment Problem. IPCO (2017)
Klaus Jansen, Lars Rohwedder
A Quasi-Polynomial Approximation for the Restricted Assignment Problem. CoRR (2017)
Klaus Jansen, Lars Rohwedder
On the Configuration-LP of the Restricted Assignment Problem. CoRR (2016)

Lars Rohwedder.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Lars Rohwedder