Alexandra Lassota

Alexandra Lassota is an Assistant Professor at Eindhoven University of Technology (Netherlands) since 2023. She holds a PhD in Computer Science from CAU (Germany), advised by Klaus Jansen. Her postdoctoral research included stints at EPFL (Switzerland) under Fritz Eisenbrand and at MPI-INF in Saarbrücken (Germany) with Danupon Nanongkai. Her work focuses on theoretical computer science, particularly integer programming, scheduling, and algorithmic complexity.

• Education: B.Sc./M.Sc. from Lübeck University (Germany), Ph.D. from CAU (Germany).

Her research interests include mixed-integer programming, extension complexity, fixed-parameter tractability, and approximation algorithms. Recent work explores lower bounds for block-structured integer programs and the computational hardness of detecting points in integer cones.

Her 2024 publications address topics like separable convex optimization, parameterized algorithms for large-scale integer programs, and aggregation of continuous preferences in AI-driven systems. These contributions highlight her expertise in bridging theoretical foundations with practical algorithmic challenges.

• Grants: Supported by Swiss National Science Foundation (SNSF), GA ČR, and Einstein Foundation Berlin.

Lassota is affiliated with the Combinatorial Optimization group at TU/e and actively contributes to research in discrete mathematics and computational complexity.