Alexandra Lassota

43 papers A* 8A 2B 6C 1Journal 25Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A* conf
Algorithms for Structured Elections Under Thiele Voting Rules.
AAAI
Alexandra Lassota, Krzysztof Sornat
2026 J jnl
Makespan minimization for ordinal cardinality constrained scheduling.
Discret. Appl. Math.
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2026 J jnl
Solving 4-Block Integer Linear Programs Faster Using Affine Decompositions of the Right-Hand Sides.
CoRR
Alexandra Lassota, Koen Ligthart
2026 J jnl
The Condorcet dimension of metric spaces.
Oper. Res. Lett.
Alexandra Lassota, Adrian Vetta, Bernhard von Stengel
2025 J jnl
On Integer Programs That Look Like Paths.
CoRR
Marcin Brianski, Alexandra Lassota, Kristýna Pekárková, Michal Pilipczuk, Janina Reuter
2025 A* conf
Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns.
ICALP
Alexandra Lassota, Koen Ligthart
2025 J jnl
Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns.
CoRR
Alexandra Lassota, Koen Ligthart
2025 J jnl
Parameterized algorithms for block-structured integer programs with large entries.
TheoretiCS
Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
2025 A* conf
Six Candidates Suffice to Win a Voter Majority.
STOC
Moses Charikar, Alexandra Lassota, Prasanna Ramakrishnan, Adrian Vetta, Kangning Wang
2024 A* conf
Aggregation of Continuous Preferences in One Dimension.
IJCAI
Alberto Del Pia, Dusan Knop, Alexandra Lassota, Krzysztof Sornat, Nimrod Talmon
2024 — conf
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard.
SOSA
Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2024 J jnl
FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin Shares.
CoRR
Klaus Jansen, Alexandra Lassota, Malte Tutas, Adrian Vetta
2024 A* conf
Parameterized algorithms for block-structured integer programs with large entries.
SODA
Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
2024 A conf
Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds.
ESA
Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak
2024 J jnl
Six Candidates Suffice to Win a Voter Majority.
CoRR
Moses Charikar, Alexandra Lassota, Prasanna Ramakrishnan, Adrian Vetta, Kangning Wang
2024 J jnl
The Condorcet Dimension of Metric Spaces.
CoRR
Alexandra Lassota, Adrian Vetta, Bernhard von Stengel
2024 B conf
Tight Lower Bounds for Block-Structured Integer Programs.
IPCO
Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin
2024 J jnl
Tight Lower Bounds for Block-Structured Integer Programs.
CoRR
Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin
2023 C conf
A Polyhedral Perspective on Tropical Convolutions.
IWOCA
Cornelius Brand, Martin Koutecký, Alexandra Lassota
2023 J jnl
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard.
CoRR
Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2023 B conf
Fast Convolutions for Near-Convex Sequences.
ISAAC
Cornelius Brand, Alexandra Lassota
2023 J jnl
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints.
CoRR
Alexandra Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter
2023 J jnl
Online cardinality constrained scheduling.
Oper. Res. Lett.
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2023 J jnl
Parameterized algorithms for block-structured integer programs with large entries.
CoRR
Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
2023 J jnl
The double exponential runtime is tight for 2-stage stochastic ILPs.
Math. Program.
Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
2022 A conf
Cardinality Constrained Scheduling in Online Models.
STACS
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2022 J jnl
Cardinality Constrained Scheduling in Online Models.
CoRR
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2022 A* conf
Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs.
ICALP
Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak
2022 J jnl
Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs.
CoRR
Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak
2021 J jnl
Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises.
CoRR
Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak
2021 B conf
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs.
IPCO
Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
2021 B conf
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs.
SOFSEM
Sebastian Berndt, Klaus Jansen, Alexandra Lassota
2021 A* conf
Total Completion Time Minimization for Scheduling with Incompatibility Cliques.
ICAPS
Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies
2020 B conf
Approximation Algorithms for Scheduling with Class Constraints.
SPAA
Klaus Jansen, Alexandra Lassota, Marten Maack
2020 J jnl
Near-Linear Time Algorithm for n-Fold ILPs via Color Coding.
SIAM J. Discret. Math.
Klaus Jansen, Alexandra Lassota, Lars Rohwedder
2020 B conf
Solving Packing Problems with Few Small Items Using Rainbow Matchings.
MFCS
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
2020 J jnl
Solving Packing Problems with Few Small Items Using Rainbow Matchings.
CoRR
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
2020 J jnl
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs.
CoRR
Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
2020 J jnl
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs.
CoRR
Sebastian Berndt, Klaus Jansen, Alexandra Lassota
2020 J jnl
Total Completion Time Minimization for Scheduling with Incompatibility Cliques.
CoRR
Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies
2019 J jnl
Approximation Algorithms for Scheduling with Class Constraints.
CoRR
Klaus Jansen, Alexandra Lassota, Marten Maack
2019 A* conf
Near-Linear Time Algorithm for n-fold ILPs via Color Coding.
ICALP
Klaus Jansen, Alexandra Lassota, Lars Rohwedder
2018 J jnl
Near-Linear Time Algorithm for n-fold ILPs via Color Coding.
CoRR
Klaus Jansen, Alexandra Lassota, Lars Rohwedder