Solving Packing Problems with Few Small Items Using Rainbow Matchings. - Max Bannach; Sebastian Berndt 001; Marten Maack; Matthias Mnich; Alexandra Lassota; Malin Rau; Malte Skambath (MFCS, 2020)

Approximation Algorithms for Scheduling with Class Constraints. - Klaus Jansen; Alexandra Lassota; Marten Maack (SPAA, 2020)

Near-Linear Time Algorithm for n-Fold ILPs via Color Coding. - Klaus Jansen; Alexandra Lassota; Lars Rohwedder (SIAM J. Discret. Math., 2020)

Total Completion Time Minimization for Scheduling with Incompatibility Cliques. - Klaus Jansen; Alexandra Lassota; Marten Maack; Tytus Pikies (ICAPS, 2021)

Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. - Sebastian Berndt 001; Klaus Jansen; Alexandra Lassota (SOFSEM, 2021)

Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises. - Cornelius Brand; Martin Koutecký; Alexandra Lassota; Sebastian Ordyniak (CoRR, 2021)

Parameterized Algorithms for Integer Linear Programs and Their Applications for Allocation Problems (Parametrisierte Algorithmen für Ganzzahlige Lineare Programme und deren Anwendungen für Zuweisungsprobleme) - Alexandra Anna Lassota (2021)

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs. - Alexandra Lassota; Aleksander Lukasiewicz; Adam Polak 001 (ICALP, 2022)

Cardinality Constrained Scheduling in Online Models. - Leah Epstein; Alexandra Lassota; Asaf Levin; Marten Maack; Lars Rohwedder (STACS, 2022)

Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints. - Alexandra Anna Lassota; Alexander Lindermayr; Nicole Megow; Jens Schlöter (ICML, 2023)

Fast Convolutions for Near-Convex Sequences. - Cornelius Brand; Alexandra Lassota (ISAAC, 2023)

A Polyhedral Perspective on Tropical Convolutions. - Cornelius Brand; Martin Koutecký; Alexandra Lassota (IWOCA, 2023)

The double exponential runtime is tight for 2-stage stochastic ILPs. - Klaus Jansen; Kim-Manuel Klein; Alexandra Lassota (Math. Program., 2023)

Online cardinality constrained scheduling. - Leah Epstein; Alexandra Lassota; Asaf Levin; Marten Maack; Lars Rohwedder (Oper. Res. Lett., 2023)

Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds. - Cornelius Brand; Martin Koutecký; Alexandra Lassota; Sebastian Ordyniak (ESA, 2024)

Aggregation of Continuous Preferences in One Dimension. - Alberto Del Pia; Dusan Knop; Alexandra Lassota; Krzysztof Sornat; Nimrod Talmon (IJCAI, 2024)

Tight Lower Bounds for Block-Structured Integer Programs. - Christoph Hunkenschröder; Kim-Manuel Klein; Martin Koutecký; Alexandra Lassota; Asaf Levin (IPCO, 2024)

Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. - Lukasz Kowalik; Alexandra Lassota; Konrad Majewski; Michal Pilipczuk; Marek Sokolowski 001 (SOSA, 2024)

FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin Shares. - Klaus Jansen; Alexandra Lassota; Malte Tutas; Adrian Vetta (CoRR, 2024)

The Condorcet Dimension of Metric Spaces. - Alexandra Lassota; Adrian Vetta; Bernhard von Stengel (CoRR, 2024)

Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns. - Alexandra Lassota; Koen Ligthart (ICALP, 2025)

Minimalistic Predictions for Online Class Constraint Scheduling. - Dorian Guyot; Alexandra Anna Lassota (ICLR, 2025)

Six Candidates Suffice to Win a Voter Majority. - Moses Charikar; Alexandra Lassota; Prasanna Ramakrishnan; Adrian Vetta; Kangning Wang 001 (STOC, 2025)

Parameterized algorithms for block-structured integer programs with large entries. - Jana Cslovjecsek; Martin Koutecký; Alexandra Lassota; Michal Pilipczuk; Adam Polak 001 (TheoretiCS, 2025)