( en | de | ru )

 

Disambiguation of "Lassota, Alexandra"

Author of the publication

copydeleteadd this publication to your clipboard
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard.

, , , , and . SOSA, page 279-285. SIAM, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Antje Lassota

Andreas Lassota

Alexandra Müller

Identifizierung eisenreduzierender Mikroorganismen in anoxischem Reisfeldboden mit Hilfe stabiler Isotope. Uni Marburg, (2009)

Alexandra Fies

Die badische Auswanderung im 19. Jahrhundert nach Nordamerika unter besonderer Berücksichtigung des Amtsbezirks Karlsruhe zwischen 1880 - 1914. Uni Karlsruhe, (2009)

Alexandra Kaupisch

Biochemische und Zellbiologische Charakterisierung der humanen Proteinkinase X. Uni Kassel, (2008)
 

Other publications of authors with the same name

Tight Lower Bounds for Block-Structured Integer Programs., , , , and . IPCO, volume 14679 of Lecture Notes in Computer Science, page 224-237. Springer, (2024)The double exponential runtime is tight for 2-stage stochastic ILPs., , and . Math. Program., 197 (2): 1145-1172 (February 2023)Total Completion Time Minimization for Scheduling with Incompatibility Cliques., , , and . ICAPS, page 192-200. AAAI Press, (2021)Cardinality Constrained Scheduling in Online Models., , , , and . STACS, volume 219 of LIPIcs, page 28:1-28:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs., , and . SOFSEM, volume 12607 of Lecture Notes in Computer Science, page 349-360. Springer, (2021)Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard., , , , and . SOSA, page 279-285. SIAM, (2024)Total Completion Time Minimization for Scheduling with Incompatibility Cliques., , , and . CoRR, (2020)Online cardinality constrained scheduling., , , , and . Oper. Res. Lett., 51 (5): 533-539 (September 2023)Approximation Algorithms for Scheduling with Class Constraints., , and . SPAA, page 349-357. ACM, (2020)Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs., , and . ICALP, volume 229 of LIPIcs, page 87:1-87:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)