| 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 | 49 | 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 | 23 | 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 | 22 | 2023 |
| 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 | 16 | 2023 |
| 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 | 10 | 2024 |
| 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 | 8 | 2021 |
| 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 | 4 | 2024 |
| 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 |
| Six Candidates Suffice to Win a Voter Majority M Charikar, A Lassota, P Ramakrishnan, A Vetta, K Wang arXiv preprint arXiv:2411.03390, 2024 | 3 | 2024 |
| Tight lower bounds for block-structured integer programs C Hunkenschröder, KM Klein, M Koutecký, A Lassota, A Levin International Conference on Integer Programming and Combinatorial …, 2024 | 3 | 2024 |
| The Condorcet Dimension of Metric Spaces A Lassota, A Vetta, B von Stengel arXiv preprint arXiv:2410.09201, 2024 | 2 | 2024 |
| Online cardinality constrained scheduling L Epstein, A Lassota, A Levin, M Maack, L Rohwedder Operations Research Letters 51 (5), 533-539, 2023 | 2 | 2023 |
| Fast Convolutions for Near-Convex Sequences C Brand, A Lassota 34th International Symposium on Algorithms and Computation, 1-16, 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 |
| 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) D Král, N Bertrand, S Cabello, M Wootters, D Ağaoğlu, P Hliněný, J Ahn, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | 1 | 2020 |
| FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin Shares K Jansen, A Lassota, M Tutas, A Vetta arXiv preprint arXiv:2409.04225, 2024 | | 2024 |
| Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds C Brand, M Koutechy, A Lassota, S Ordyniak Leibniz International Proceedings in Informatics, 2024 | | 2024 |
| Aggregation of continuous preferences in one dimension A Del Pia, D Knop, A Lassota, K Sornat, N Talmon 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024 …, 2024 | | 2024 |
