default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLars Rohwedder
Person information
- affiliation: Maastricht University, School of Business and Economics, the Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c26]Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter:
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. SODA 2024: 2829-2860- [c25]Alexander Armbruster, Lars Rohwedder, Andreas Wiese:
Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm. SOSA 2024: 63-81 - [i30]Lars Rohwedder, Ashkan Safari, Tjark Vredeveld:
A k-swap Local Search for Makespan Scheduling. CoRR abs/2401.05956 (2024) - [i29]Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki:
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. CoRR abs/2404.03747 (2024) - [i28]Étienne Bamas, Sarah Morell, Lars Rohwedder:
The Submodular Santa Claus Problem. CoRR abs/2407.04824 (2024) - [i27]Lars Rohwedder, Karol Wegrzycki:
Fine-Grained Equivalence for Problems Related to Integer Linear Programming. CoRR abs/2409.03675 (2024) - [i26]Lars Rohwedder, Karol Wegrzycki:
Space-Efficient Algorithm for Integer Programming with Few Constraints. CoRR abs/2409.03681 (2024) - 2023
- [j7]Sebastian Berndt, Leah Epstein
, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online bin covering with limited migration. J. Comput. Syst. Sci. 134: 42-72 (2023) - [j6]Klaus Jansen, Lars Rohwedder:
On Integer Programming, Discrepancy, and Convolution. Math. Oper. Res. 48(3): 1481-1495 (2023) - [j5]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Online cardinality constrained scheduling. Oper. Res. Lett. 51(5): 533-539 (2023) - [c24]Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae:
Optimizing Low Dimensional Functions over the Integers. IPCO 2023: 115-126 - [c23]Kim-Manuel Klein, Adam Polak, Lars Rohwedder:
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. SODA 2023: 2947-2960 - [c22]Alexander Armbruster, Lars Rohwedder, Andreas Wiese:
A PTAS for Minimizing Weighted Flow Time on a Single Machine. STOC 2023: 1335-1344 - [c21]Étienne Bamas, Lars Rohwedder:
Better Trees for Santa Claus. STOC 2023: 1862-1875 - [i25]Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae:
Optimizing Low Dimensional Functions over the Integers. CoRR abs/2303.02474 (2023) - [i24]Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter:
Santa Claus meets Makespan and Matroids: Algorithms and Reductions. CoRR abs/2307.08453 (2023) - [i23]Alexander Armbruster, Lars Rohwedder, Andreas Wiese:
Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm. CoRR abs/2308.06209 (2023) - 2022
- [c20]Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder:
Load Balancing: The Long Road from Theory to Practice. ALENEX 2022: 104-116 - [c19]Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson:
Towards Non-Uniform k-Center with Constant Types of Radii. SOSA 2022: 228-237 - [c18]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Cardinality Constrained Scheduling in Online Models. STACS 2022: 28:1-28:15 - [c17]Nikhil Bansal, Lars Rohwedder, Ola Svensson:
Flow time scheduling and prefix Beck-Fiala. STOC 2022: 331-342 - [i22]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Cardinality Constrained Scheduling in Online Models. CoRR abs/2201.05113 (2022) - [i21]Nikhil Bansal, Lars Rohwedder, Ola Svensson:
Flow Time Scheduling and Prefix Beck-Fiala. CoRR abs/2202.02217 (2022) - [i20]Alexander Armbruster, Lars Rohwedder, Andreas Wiese:
A PTAS for Minimizing Weighted Flow Time on a Single Machine. CoRR abs/2208.03127 (2022) - [i19]Kim-Manuel Klein, Adam Polak, Lars Rohwedder:
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. CoRR abs/2211.05053 (2022) - [i18]Étienne Bamas, Lars Rohwedder:
Better Trees for Santa Claus. CoRR abs/2211.14259 (2022) - 2021
- [j4]Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder:
Approximation Results for Makespan Minimization with Budgeted Uncertainty. Theory Comput. Syst. 65(6): 903-915 (2021) - [c16]Étienne Bamas, Paritosh Garg, Lars Rohwedder:
The Submodular Santa Claus Problem in the Restricted Assignment Case. ICALP 2021: 22:1-22:18 - [c15]Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese:
Additive Approximation Schemes for Load Balancing Problems. ICALP 2021: 42:1-42:17 - [c14]Adam Polak, Lars Rohwedder, Karol Wegrzycki:
Knapsack and Subset Sum with Small Items. ICALP 2021: 106:1-106:19 - [c13]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: 1666-1681 - [c12]Lars Rohwedder, Andreas Wiese:
A (2 + ε)-approximation algorithm for preemptive weighted flow time on a single machine. STOC 2021: 1042-1055 - [i17]Adam Polak, Lars Rohwedder, Karol Wegrzycki:
Knapsack and Subset Sum with Small Items. CoRR abs/2105.04035 (2021) - [i16]Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder:
Load Balancing: The Long Road from Theory to Practice. CoRR abs/2107.13638 (2021) - [i15]Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson:
Towards Non-Uniform k-Center with Constant Types of Radii. CoRR abs/2110.02688 (2021) - 2020
- [j3]Klaus Jansen, Lars Rohwedder:
A note on the integrality gap of the configuration LP for restricted Santa Claus. Inf. Process. Lett. 164: 106025 (2020) - [j2]Klaus Jansen, Lars Rohwedder:
A Quasi-Polynomial Approximation for the Restricted Assignment Problem. SIAM J. Comput. 49(6): 1083-1108 (2020) - [j1]Klaus Jansen, Alexandra Lassota, Lars Rohwedder:
Near-Linear Time Algorithm for n-Fold ILPs via Color Coding. SIAM J. Discret. Math. 34(4): 2282-2299 (2020) - [c11]Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson:
Robust Algorithms Under Adversarial Injections. ICALP 2020: 56:1-56:15 - [c10]Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson:
Learning Augmented Energy Minimization via Speed Scaling. NeurIPS 2020 - [i14]Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson:
Robust Algorithms under Adversarial Injections. CoRR abs/2004.12667 (2020) - [i13]Étienne Bamas, Paritosh Garg, Lars Rohwedder:
The Combinatorial Santa Claus Problem or: How to Find Good Matchings in Non-Uniform Hypergraphs. CoRR abs/2007.09116 (2020) - [i12]Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese:
Additive Approximation Schemes for Load Balancing Problems. CoRR abs/2007.09333 (2020) - [i11]Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson:
Learning Augmented Energy Minimization via Speed Scaling. CoRR abs/2010.11629 (2020) - [i10]Lars Rohwedder, Andreas Wiese:
A (2+ε)-approximation algorithm for preemptive weighted flow time on a single machine. CoRR abs/2011.05676 (2020) - [i9]Étienne Bamas, Paritosh Garg, Lars Rohwedder:
The Submodular Santa Claus Problem in the Restricted Assignment Case. CoRR abs/2011.06939 (2020)
2010 – 2019
- 2019
- [b1]Lars Rohwedder:
Algorithms for Integer Programming and Allocation. University of Kiel, Germany, 2019 - [c9]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online Bin Covering with Limited Migration. ESA 2019: 18:1-18:14 - [c8]Klaus Jansen, Lars Rohwedder:
Local Search Breaks 1.75 for Graph Balancing. ICALP 2019: 74:1-74:14 - [c7]Klaus Jansen, Alexandra Lassota, Lars Rohwedder:
Near-Linear Time Algorithm for n-fold ILPs via Color Coding. ICALP 2019: 75:1-75:13 - [c6]Klaus Jansen, Lars Rohwedder:
On Integer Programming and Convolution. ITCS 2019: 43:1-43:17 - [c5]Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder:
Approximation Results for Makespan Minimization with Budgeted Uncertainty. WAOA 2019: 60-71 - [i8]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online Bin Covering with Limited Migration. CoRR abs/1904.06543 (2019) - [i7]Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder:
Approximation results for makespan minimization with budgeted uncertainty. CoRR abs/1905.08592 (2019) - 2018
- [c4]Klaus Jansen, Lars Rohwedder:
Compact LP Relaxations for Allocation Problems. SOSA 2018: 11:1-11:19 - [i6]Klaus Jansen, Lars Rohwedder:
On Integer Programming and Convolution. CoRR abs/1803.04744 (2018) - [i5]Klaus Jansen, Lars Rohwedder:
A note on the integrality gap of the configuration LP for restricted Santa Claus. CoRR abs/1807.03626 (2018) - [i4]Klaus Jansen, Alexandra Lassota, Lars Rohwedder:
Near-Linear Time Algorithm for n-fold ILPs via Color Coding. CoRR abs/1811.00950 (2018) - [i3]Klaus Jansen, Lars Rohwedder:
Local search breaks 1.75 for Graph Balancing. CoRR abs/1811.00955 (2018) - 2017
- [c3]Klaus Jansen, Lars Rohwedder:
Structured Instances of Restricted Assignment with Two Processing Times. CALDAM 2017: 230-241 - [c2]Klaus Jansen, Lars Rohwedder:
A Quasi-Polynomial Approximation for the Restricted Assignment Problem. IPCO 2017: 305-316 - [c1]Klaus Jansen, Lars Rohwedder:
On the Configuration-LP of the Restricted Assignment Problem. SODA 2017: 2670-2678 - [i2]Klaus Jansen, Lars Rohwedder:
A Quasi-Polynomial Approximation for the Restricted Assignment Problem. CoRR abs/1701.07208 (2017) - 2016
- [i1]Klaus Jansen, Lars Rohwedder:
On the Configuration-LP of the Restricted Assignment Problem. CoRR abs/1611.01934 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
