Near-Linear Time Algorithm for K Jansen, A Lassota, L Rohwedder
SIAM Journal on Discrete Mathematics 34 (4), 2282-2299, 2020
39 2020 Approximation algorithms for scheduling with class constraints K Jansen, A Lassota, M Maack
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020
21 2020 The double exponential runtime is tight for 2-stage stochastic ILPs K Jansen, KM Klein, A Lassota
Mathematical Programming 197 (2), 1145-1172, 2023
15 2023 Total completion time minimization for scheduling with incompatibility cliques K Jansen, A Lassota, M Maack, T Pikies
Proceedings of the International Conference on Automated Planning and …, 2021
9 2021 Cardinality constrained scheduling in online models L Epstein, A Lassota, A Levin, M Maack, L Rohwedder
arXiv preprint arXiv:2201.05113, 2022
4 2022 Solving packing problems with few small items using rainbow matchings M Bannach, S Berndt, M Maack, M Mnich, A Lassota, M Rau, M Skambath
arXiv preprint arXiv:2007.02660, 2020
4 2020 Online cardinality constrained scheduling L Epstein, A Lassota, A Levin, M Maack, L Rohwedder
Operations Research Letters 51 (5), 533-539, 2023
2 2023 Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs A Lassota, A Łukasiewicz, A Polak
arXiv preprint arXiv:2203.10077, 2022
2 2022 Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs S Berndt, K Jansen, A Lassota
SOFSEM 2021: Theory and Practice of Computer Science: 47th International …, 2021
2 2021 Parameterized algorithms for block-structured integer programs with large entries J Cslovjecsek, M Koutecký, A Lassota, M Pilipczuk, A Polak
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
1 2024 Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard Ł Kowalik, A Lassota, K Majewski, M Pilipczuk, M Sokołowski
2024 Symposium on Simplicity in Algorithms (SOSA), 279-285, 2024
1 2024 Minimalistic predictions to schedule jobs with online precedence constraints AA Lassota, A Lindermayr, N Megow, J Schlöter
International Conference on Machine Learning, 18563-18583, 2023
1 2023 Tight Lower Bounds for Block-Structured Integer Programs C Hunkenschröder, KM Klein, M Koutecký, A Lassota, A Levin
arXiv preprint arXiv:2402.17290, 2024
2024 Correction to: A Polyhedral Perspective on Tropical Convolutions C Brand, M Koutecký, A Lassota
International Workshop on Combinatorial Algorithms, C1-C1, 2023
2023 A Polyhedral Perspective on Tropical Convolutions C Brand, M Koutecký, A Lassota
International Workshop on Combinatorial Algorithms, 111-122, 2023
2023 Fast Convolutions for Near-Convex Sequences C Brand, A Lassota
34th International Symposium on Algorithms and Computation (ISAAC 2023), 2023
2023 Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises C Brand, M Koutecký, A Lassota, S Ordyniak
arXiv preprint arXiv:2111.08048, 2021
2021 Parameterized Algorithms for Integer Linear Programs and Their Applications for Allocation Problems A Lassota
2021 Möglichkeiten und Grenzen der parallelen Berechnung von Kerneln AA Lassota
2017 Probabilistische Analyse und Minimierung von Flussnetzwerken AA Lassota
2015 