| 2026 | AAAI | Algorithms for Structured Elections Under Thiele Voting Rules. | Alexandra Lassota, Krzysztof Sornat |
| 2026 | IPCO | On Integer Programs That Look Like Paths. | Marcin Brianski, Alexandra Lassota, Kristna Pekrkov, Michal Pilipczuk, Janina Reuter |
| 2026 | IPCO | Solving 4-Block Integer Linear Programs Faster Using Affine Decompositions of the Right-Hand Sides. | Alexandra Lassota, Koen Ligthart |
| 2025 | ICALP | Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns. | Alexandra Lassota, Koen Ligthart |
| 2025 | STOC | Six Candidates Suffice to Win a Voter Majority. | Moses Charikar, Alexandra Lassota, Prasanna Ramakrishnan, Adrian Vetta, Kangning Wang |
| 2024 | ESA | Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds. | Cornelius Brand, Martin Kouteck, Alexandra Lassota, Sebastian Ordyniak |
| 2024 | IJCAI | Aggregation of Continuous Preferences in One Dimension. | Alberto Del Pia, Dusan Knop, Alexandra Lassota, Krzysztof Sornat, Nimrod Talmon |
| 2024 | IPCO | Tight Lower Bounds for Block-Structured Integer Programs. | Christoph Hunkenschrder, Kim-Manuel Klein, Martin Kouteck, Alexandra Lassota, Asaf Levin |
| 2024 | SODA | Parameterized algorithms for block-structured integer programs with large entries. | Jana Cslovjecsek, Martin Kouteck, Alexandra Lassota, Michal Pilipczuk, Adam Polak |
| 2023 | ISAAC | Fast Convolutions for Near-Convex Sequences. | Cornelius Brand, Alexandra Lassota |
| 2023 | IWOCA | A Polyhedral Perspective on Tropical Convolutions. | Cornelius Brand, Martin Kouteck, Alexandra Lassota |
| 2022 | ICALP | Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs. | Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak |
| 2022 | STACS | Cardinality Constrained Scheduling in Online Models. | Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder |
| 2021 | IPCO | The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. | Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota |
| 2021 | SOFSEM | Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. | Sebastian Berndt, Klaus Jansen, Alexandra Lassota |
| 2020 | MFCS | Solving Packing Problems with Few Small Items Using Rainbow Matchings. | Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath |
| 2020 | SPAA | Approximation Algorithms for Scheduling with Class Constraints. | Klaus Jansen, Alexandra Lassota, Marten Maack |
| 2019 | ICALP | Near-Linear Time Algorithm for n-fold ILPs via Color Coding. | Klaus Jansen, Alexandra Lassota, Lars Rohwedder |