About me.

I am an assistant professor at TU/e (Netherlands). Previously, I received my Ph.D. in computer science at CAU (Germany) advised by Klaus Jansen. I went as a PostDoc for two years to EPFL (Switzerland) and a couple of month to MPI-INF in Saarbrücken (Germany).

My main research interests revolve around (mixed) integer programming, scheduling, extension complexity, tropical convolutions, fixed-parameter tractability, and approximation algorithms. 

In my personal life, I like ballroom dancing and snowboarding, I work with owls, like to occasionally play my guitar, and improve my pizza baking skills.

E-Mail: a.a.lassota@tue.nl
self-made pizza
snowboarding in the alps

Publications. (see also [dblp.org])

Alexandra Lassota, Alexander Lindermayr, Nicole Megow, and Jens Schlöter. “Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints.” In:
ICML. Vol. 202. PMLR. 2023, 18563-18583. url: https://proceedings.mlr.press/v202/lassota23a.html.

Cornelius Brand, Martin Koutecký, and Alexandra Lassota. “A Polyhedral Perspective on Tropical Convolutions.” In: IWOCA. Vol. 13889, Springer. 2023, 111-122. url: https://link.springer.com/chapter/10.1007/978-3-031-34347-6_10.

Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, and Marek Sokolowski. “Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard.” In: CoRR abs/2307.00406 (2023). url: https://arxiv.org/abs/2307.00406.

Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder. “Cardinality Constrained Scheduling in Online Models.” In: STACS. Vol. 219. LIPICcs. 2022, 28:1–28:15. url: https://doi.org/10.4230/LIPIcs.STACS.2022.28.

Alexandra Lassota, Aleksander Lukasiewicz, and Adam Polak. “Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs.” In: ICALP. Vol. 229. LIPIcs. 2022, 87:1–87:15.) url: https://doi.org/10.4230/LIPIcs.ICALP.2022.87.

Klaus Jansen, Kim-Manuel Klein, and Alexandra Lassota. “The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs.” In: IPCO. Vol. 12707. Lecture Notes in Computer Science. Springer, 2021, 297–310. url: https://doi.org/10.1007/978-3-030-73879-2\_21.

Klaus Jansen, Alexandra Lassota, Marten Maack, and Tytus Pikies. “Total Completion Time Minimization for Scheduling with Incompatibility Cliques.” In: ICAPS. AAAI Press, 2021, pp. 192–200. url: https://ojs.aaai.org/index.php/ICAPS/article/view/15962.

Cornelius Brand, Martin Koutecký, Alexandra Lassota, and Sebastian Ordyniak. “Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises.” In: CoRR abs/2111.08048 (2021). url: https://arxiv.org/abs/2111.08048.

Sebastian Berndt, Klaus Jansen and Alexandra Lassota. “Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs.” In: SOFSEM. Vol. 12607. Lecture Notes in Computer Science. Springer, 2021, 349–360. url: https://doi.org/10.1007/978-3-030-67731-2\_25.

Klaus Jansen, Alexandra Lassota, and Marten Maack. “Approximation Algorithms for Scheduling with Class Constraints.” In: SPAA. ACM, 2020, 349–357. url: https://doi.org/10.1145/3350755.3400247.

Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, and Malte Skambath. “Solving Packing Problems with Few Small Items Using Rainbow Matchings.” In: MFCS. Vol. 170. LIPIcs. 2020, 11:1–11:14. url: https://doi.org/10.4230/LIPIcs.MFCS.2020.11.

Klaus Jansen, Alexandra Lassota, and Lars Rohwedder. “Near-Linear Time Algorithm for n-fold ILPs via Color Coding.” In: SIAM Journal on Discrete Mathematics 2020 (previously appeared in the proceedings of ICALP. Vol. 132. LIPIcs. 2019, 75:1–75:13.) url: https://doi.org/10.1137/19M1303873.