Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Lars Rohwedder
Observed name:
Rohwedder, Lars
Institutions:
University of Southern Denmark,
Maastricht University
Observed institutions:
University of Southern Denmark,
Dutch Research Council,
Christian-Albrechts-Universität zu Kiel,
Maastricht University,
École Polytechnique Fédérale de Lausanne
ORCID:
0000-0002-9434-4589
Observed ORCID:
0000-0002-9434-4589
OpenAlex ID:
A5074555680
Works
60
Awards
1
On Integer Programming and Convolution
2019
·
Jansen, Klaus
, Rohwedder, Lars
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
69
PDF
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time
2021
·
Jana Cslovjecsek
, Friedrich Eisenbrand
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
68
PDF
On Integer Programming, Discrepancy, and Convolution
2022
·
Klaus Jansen
, Lars Rohwedder
·
Mathematics of Operations Research
·
67
PDF
Learning Augmented Energy Minimization via Speed Scaling
2020
·
Bamas, Étienne
, Maggiori, Andreas
, et al.
·
arXiv (Cornell University)
·
65
PDF
Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding
2020
·
Klaus Jansen
, Alexandra Lassota
, et al.
·
SIAM Journal on Discrete Mathematics
·
56
PDF
On the Configuration-LP of the Restricted Assignment Problem
2017
·
Klaus Jansen
, Lars Rohwedder
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
41
Knapsack and Subset Sum with Small Items
2021
·
Polak, Adam
, Rohwedder, Lars
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
31
PDF
Flow time scheduling and prefix Beck-Fiala
2022
·
Nikhil Bansal
, Lars Rohwedder
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
24
A Quasi-Polynomial Approximation for the Restricted Assignment Problem
2017
·
Klaus Jansen
, Lars Rohwedder
·
Lecture notes in computer science
·
21
Load Balancing: The Long Road from Theory to Practice
2022
·
Sebastian Berndt
, Max A. Deppert
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
18
A Quasi-Polynomial Approximation for the Restricted Assignment Problem
2020
·
Klaus Jansen
, Lars Rohwedder
·
SIAM Journal on Computing
·
17
PDF
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs
2023
·
Kim-Manuel Klein
, Adam Polak
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
16
Approximation Results for Makespan Minimization with Budgeted Uncertainty
2020
·
Marin Bougeret
, Klaus Jansen
, et al.
·
Theory of Computing Systems
·
16
PDF
Santa Claus meets Makespan and Matroids: Algorithms and Reductions
2024
·
Étienne Bamas
, Alexander Lindermayr
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
15
PDF
Local Search Breaks 1.75 for Graph Balancing
2018
·
Jansen, Klaus
, Rohwedder, Lars
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
15
PDF
Additive Approximation Schemes for Load Balancing Problems
2020
·
Buchem, Moritz
, Rohwedder, Lars
, et al.
·
Research Publications (Maastricht University)
·
13
Towards Non-Uniform k -Center with Constant Types of Radii
2022
·
Xinrui Jia
, Lars Rohwedder
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
12
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems
2024
·
Friedrich Eisenbrand
, Lars Rohwedder
, et al.
·
Annual Symposium on Foundations of Computer Science
·
11
PDF
Better Trees for Santa Claus
2023
·
Étienne Bamas
, Lars Rohwedder
·
ACM Symposium on Theory of Computing (STOC)
·
10
PDF
The Submodular Santa Claus Problem
2025
·
Étienne Bamas
, Sarah Morell
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
9
A note on the integrality gap of the configuration LP for restricted Santa Claus
2020
·
Klaus Jansen
, Lars Rohwedder
·
Information Processing Letters
·
9
PDF
A PTAS for Minimizing Weighted Flow Time on a Single Machine
2023
·
Alexander Armbruster
, Lars Rohwedder
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
8
PDF
Robust Algorithms Under Adversarial Injections
2020
·
Garg, Paritosh
, Kale, Sagar
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
8
PDF
Fine-Grained Equivalence for Problems Related to Integer Linear Programming
2024
·
Rohwedder, Lars
, Węgrzycki, Karol
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
7
PDF
Cardinality Constrained Scheduling in Online Models
2022
·
Epstein, Leah
, Lassota, Alexandra
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
7
PDF
Show more works
View as search
Works count:
60
Citation count:
711
H-index:
15
I10-index:
19
Year
Topic
Type