Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandra Lassota
Person information
- affiliation: MPI-INF, Saarbrücken, Germany
- affiliation (former): EPFL, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak:
Parameterized algorithms for block-structured integer programs with large entries. SODA 2024: 740-751- [c12]Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. SOSA 2024: 279-285 - [i13]Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin:
Tight Lower Bounds for Block-Structured Integer Programs. CoRR abs/2402.17290 (2024) - 2023
- [j3]Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
:
The double exponential runtime is tight for 2-stage stochastic ILPs. Math. Program. 197(2): 1145-1172 (2023) - [j2]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Online cardinality constrained scheduling. Oper. Res. Lett. 51(5): 533-539 (2023) - [c11]Alexandra Anna Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter:
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints. ICML 2023: 18563-18583 - [c10]Cornelius Brand, Alexandra Lassota:
Fast Convolutions for Near-Convex Sequences. ISAAC 2023: 16:1-16:16 - [c9]Cornelius Brand, Martin Koutecký, Alexandra Lassota:
A Polyhedral Perspective on Tropical Convolutions. IWOCA 2023: 111-122 - [i12]Alexandra Lassota, Alexander Lindermayr, Nicole Megow, Jens Schlöter:
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints. CoRR abs/2301.12863 (2023) - [i11]Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. CoRR abs/2307.00406 (2023) - [i10]Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak:
Parameterized algorithms for block-structured integer programs with large entries. CoRR abs/2311.01890 (2023) - 2022
- [c8]Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak:
Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs. ICALP 2022: 87:1-87:15 - [c7]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Cardinality Constrained Scheduling in Online Models. STACS 2022: 28:1-28:15 - [i9]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Cardinality Constrained Scheduling in Online Models. CoRR abs/2201.05113 (2022) - [i8]Alexandra Lassota, Aleksander Lukasiewicz, Adam Polak:
Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs. CoRR abs/2203.10077 (2022) - 2021
- [b1]Alexandra Anna Lassota:
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). Kiel University, Germany, 2021 - [c6]Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies:
Total Completion Time Minimization for Scheduling with Incompatibility Cliques. ICAPS 2021: 192-200 - [c5]Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota:
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. IPCO 2021: 297-310 - [c4]Sebastian Berndt, Klaus Jansen, Alexandra Lassota:
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. SOFSEM 2021: 349-360 - [i7]Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak:
Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises. CoRR abs/2111.08048 (2021) - 2020
- [j1]Klaus Jansen, Alexandra Lassota, Lars Rohwedder:
Near-Linear Time Algorithm for n-Fold ILPs via Color Coding. SIAM J. Discret. Math. 34(4): 2282-2299 (2020) - [c3]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: 11:1-11:14 - [c2]Klaus Jansen, Alexandra Lassota, Marten Maack:
Approximation Algorithms for Scheduling with Class Constraints. SPAA 2020: 349-357 - [i6]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 abs/2007.02660 (2020) - [i5]Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota:
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. CoRR abs/2008.12928 (2020) - [i4]Sebastian Berndt, Klaus Jansen, Alexandra Lassota:
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. CoRR abs/2010.09255 (2020) - [i3]Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies:
Total Completion Time Minimization for Scheduling with Incompatibility Cliques. CoRR abs/2011.06150 (2020)
2010 – 2019
- 2019
- [c1]Klaus Jansen, Alexandra Lassota, Lars Rohwedder:
Near-Linear Time Algorithm for n-fold ILPs via Color Coding. ICALP 2019: 75:1-75:13 - [i2]Klaus Jansen, Alexandra Lassota, Marten Maack:
Approximation Algorithms for Scheduling with Class Constraints. CoRR abs/1909.11970 (2019) - 2018
- [i1]Klaus Jansen, Alexandra Lassota, Lars Rohwedder:
Near-Linear Time Algorithm for n-fold ILPs via Color Coding. CoRR abs/1811.00950 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-11 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
