( en | de | ru )

 

Disambiguation of "Shachnai, Hadas"

Author of the publication

copydeleteadd this publication to your clipboard
The Preemptive Resource Allocation Problem.

, , and . FSTTCS, volume 150 of LIPIcs, page 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Edith Hadaschik

Marie-Luisa Hadaschik

Kerstin Hadasch

Boris Alexander Hadaschik

Robert Peter Hadasch

 

Other publications of authors with the same name

Real-Time k-bounded Preemptive Scheduling., , , and . ALENEX, page 127-137. SIAM, (2016)Fast Information Spreading in Graphs with Large Weak Conductance., and . SIAM J. Comput., 41 (6): 1451-1465 (2012)The Euclidean k-Supplier Problem., , and . IPCO, volume 7801 of Lecture Notes in Computer Science, page 290-301. Springer, (2013)Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs., and . FCT, volume 4639 of Lecture Notes in Computer Science, page 482-493. Springer, (2007)Throughput maximization of real-time scheduling with batching., , , , , and . ACM Trans. Algorithms, 5 (2): 18:1-18:17 (2009)Spatial Voting with Incomplete Voter Information., , , , and . AAAI, page 9790-9797. AAAI Press, (2024)Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding., , and . FOCS, page 1366-1376. IEEE, (2023)Fast Distributed Approximation for Max-Cut., , and . ALGOSENSORS, volume 10718 of Lecture Notes in Computer Science, page 41-56. Springer, (2017)On Lagrangian Relaxation and Subset Selection Problems., and . WAOA, volume 5426 of Lecture Notes in Computer Science, page 160-173. Springer, (2008)Minimizing total busy time in parallel scheduling with application to optical networks., , , , , , and . IPDPS, page 1-12. IEEE, (2009)