| On integer programming, discrepancy, and convolution K Jansen, L Rohwedder Mathematics of Operations Research, 2022 | 91* | 2022 |
| Learning augmented energy minimization via speed scaling É Bamas, A Maggiori, L Rohwedder, O Svensson Advances in Neural Information Processing Systems 33, 15350-15359, 2020 | 66 | 2020 |
| Near-Linear Time Algorithm for -Fold ILPs via Color Coding K Jansen, A Lassota, L Rohwedder SIAM Journal on Discrete Mathematics 34 (4), 2282-2299, 2020 | 43 | 2020 |
| On the configuration-lp of the restricted assignment problem K Jansen, L Rohwedder Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 43 | 2017 |
| Block-structured integer and linear programming in strongly polynomial and near linear time J Cslovjecsek, F Eisenbrand, C Hunkenschröder, L Rohwedder, ... Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 39* | 2021 |
| A quasi-polynomial approximation for the restricted assignment problem K Jansen, L Rohwedder SIAM Journal on Computing 49 (6), 1083-1108, 2020 | 32 | 2020 |
| Knapsack and subset sum with small items A Polak, L Rohwedder, K Węgrzycki arXiv preprint arXiv:2105.04035, 2021 | 28 | 2021 |
| Local search breaks 1.75 for graph balancing K Jansen, L Rohwedder arXiv preprint arXiv:1811.00955, 2018 | 13 | 2018 |
| A note on the integrality gap of the configuration LP for restricted Santa Claus K Jansen, L Rohwedder Information Processing Letters 164, 106025, 2020 | 12 | 2020 |
| Online bin covering with limited migration S Berndt, L Epstein, K Jansen, A Levin, M Maack, L Rohwedder arXiv preprint arXiv:1904.06543, 2019 | 12 | 2019 |
| On minimizing tardy processing time, max-min skewed convolution, and triangular structured ILPs KM Klein, A Polak, L Rohwedder Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 9 | 2023 |
| Approximation results for makespan minimization with budgeted uncertainty M Bougeret, K Jansen, M Poss, L Rohwedder Theory of Computing Systems 65, 903-915, 2021 | 9 | 2021 |
| Flow time scheduling and prefix beck-fiala N Bansal, L Rohwedder, O Svensson Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 8 | 2022 |
| Load balancing: The long road from theory to practice S Berndt, MA Deppert, K Jansen, L Rohwedder 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2022 | 8 | 2022 |
| Towards Non-Uniform k-Center with Constant Types of Radii X Jia, L Rohwedder, K Sheth, O Svensson Symposium on Simplicity in Algorithms (SOSA), 228-237, 2022 | 7 | 2022 |
| A (2 + ε)-approximation algorithm for preemptive weighted flow time on a single machine L Rohwedder, A Wiese Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 7 | 2021 |
| Compact LP relaxations for allocation problems K Jansen, L Rohwedder 1st Symposium on Simplicity in Algorithms (SOSA 2018), 2018 | 7 | 2018 |
| The submodular santa claus problem in the restricted assignment case E Bamas, P Garg, L Rohwedder arXiv preprint arXiv:2011.06939, 2020 | 6 | 2020 |
| Better trees for santa claus É Bamas, L Rohwedder Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1862-1875, 2023 | 5 | 2023 |
| Additive approximation schemes for load balancing problems M Buchem, L Rohwedder, T Vredeveld, A Wiese arXiv preprint arXiv:2007.09333, 2020 | 5 | 2020 |
Klaus JansenProfessor, Computer Science, University of Kiel在 informatik.uni-kiel.de 的电子邮件经过验证
