Alexandra Lassota

According to our database, Alexandra Lassota authored at least 17 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Tight Lower Bounds for Block-Structured Integer Programs.

Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin

CoRR, 2024

Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard.

Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Parameterized algorithms for block-structured integer programs with large entries.

Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Online cardinality constrained scheduling.

Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder

Oper. Res. Lett., September, 2023

The double exponential runtime is tight for 2-stage stochastic ILPs.

Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota

Math. Program., February, 2023

A Polyhedral Perspective on Tropical Convolutions.

Cornelius Brand, Martin Koutecký, Alexandra Lassota

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Fast Convolutions for Near-Convex Sequences.

Cornelius Brand, Alexandra Lassota

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints.

Alexandra Anna Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter

Proceedings of the International Conference on Machine Learning, 2023

2022

Cardinality Constrained Scheduling in Online Models.

Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs.

Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

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

PhD thesis, 2021

Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises.

Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak

CoRR, 2021

Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs.

Sebastian Berndt, Klaus Jansen, Alexandra Lassota

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Total Completion Time Minimization for Scheduling with Incompatibility Cliques.

Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020

Near-Linear Time Algorithm for n-Fold ILPs via Color Coding.

Klaus Jansen, Alexandra Lassota, Lars Rohwedder

SIAM J. Discret. Math., 2020

Approximation Algorithms for Scheduling with Class Constraints.

Klaus Jansen, Alexandra Lassota, Marten Maack

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Solving Packing Problems with Few Small Items Using Rainbow Matchings.

Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020