Alexandra Lassota

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 29

Top Topics

Integer Program

Approximation Algorithms

Packing Problem

Precedence Constraints

Top Venues

Oper. Res. Lett.

Publications

Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
Parameterized algorithms for block-structured integer programs with large entries. SODA (2024)
Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. SOSA (2024)
Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin
Tight Lower Bounds for Block-Structured Integer Programs. CoRR (2024)
Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin
Tight Lower Bounds for Block-Structured Integer Programs. IPCO (2024)
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
Online cardinality constrained scheduling. Oper. Res. Lett. 51 (5) (2023)
Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
Parameterized algorithms for block-structured integer programs with large entries. CoRR (2023)
Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. CoRR (2023)
Cornelius Brand, Alexandra Lassota
Fast Convolutions for Near-Convex Sequences. ISAAC (2023)
Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
The double exponential runtime is tight for 2-stage stochastic ILPs. Math. Program. 197 (2) (2023)
Cornelius Brand, Martin Koutecký, Alexandra Lassota
A Polyhedral Perspective on Tropical Convolutions. IWOCA (2023)
Alexandra Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints. CoRR (2023)
Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak
Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs. ICALP (2022)
Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak
Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs. CoRR (2022)
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
Cardinality Constrained Scheduling in Online Models. STACS (2022)
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
Cardinality Constrained Scheduling in Online Models. CoRR (2022)
Sebastian Berndt, Klaus Jansen, Alexandra Lassota
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. SOFSEM (2021)
Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak
Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises. CoRR (2021)
Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies
Total Completion Time Minimization for Scheduling with Incompatibility Cliques. ICAPS (2021)
Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. IPCO (2021)
Klaus Jansen, Alexandra Lassota, Marten Maack
Approximation Algorithms for Scheduling with Class Constraints. SPAA (2020)
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
Solving Packing Problems with Few Small Items Using Rainbow Matchings. CoRR (2020)
Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies
Total Completion Time Minimization for Scheduling with Incompatibility Cliques. CoRR (2020)
Klaus Jansen, Alexandra Lassota, Lars Rohwedder
Near-Linear Time Algorithm for n-Fold ILPs via Color Coding. SIAM J. Discret. Math. 34 (4) (2020)
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
Solving Packing Problems with Few Small Items Using Rainbow Matchings. MFCS (2020)
Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. CoRR (2020)
Sebastian Berndt, Klaus Jansen, Alexandra Lassota
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. CoRR (2020)
Klaus Jansen, Alexandra Lassota, Marten Maack
Approximation Algorithms for Scheduling with Class Constraints. CoRR (2019)
Klaus Jansen, Alexandra Lassota, Lars Rohwedder
Near-Linear Time Algorithm for n-fold ILPs via Color Coding. ICALP (2019)
Klaus Jansen, Alexandra Lassota, Lars Rohwedder
Near-Linear Time Algorithm for n-fold ILPs via Color Coding. CoRR (2018)