( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Malleable scheduling beyond identical machines.

, , и . J. Sched., 26 (5): 425-442 (октября 2023)

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.

Jannik Matuschke

Walter Matuschke

Jannik Steinbring

Jannik Rossenbach

Andreas Matuschke

 

Другие публикации лиц с тем же именем

Malleable scheduling beyond identical machines., , и . J. Sched., 26 (5): 425-442 (октября 2023)Robust randomized matchings., , и . SODA, стр. 1904-1915. SIAM, (2015)Decomposing Probability Marginals Beyond Affine Requirements.. IPCO, том 14679 из Lecture Notes in Computer Science, стр. 309-322. Springer, (2024)Rerouting Flows When Links Fail., , и . ICALP, том 80 из LIPIcs, стр. 89:1-89:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Many-to-one Matchings with Lower Quotas: Algorithms and Complexity., , , , и . ISAAC, том 9472 из Lecture Notes in Computer Science, стр. 176-187. Springer, (2015)Degree-Constrained Orientations of Embedded Graphs., и . ISAAC, том 7676 из Lecture Notes in Computer Science, стр. 506-516. Springer, (2012)Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems., , и . ISAAC, том 7676 из Lecture Notes in Computer Science, стр. 433-443. Springer, (2012)Multi-Leader Congestion Games with an Adversary., , , , и . AAAI, стр. 5068-5075. AAAI Press, (2022)New and Simple Algorithms for Stable Flow Problems., и . WG, том 10520 из Lecture Notes in Computer Science, стр. 206-219. Springer, (2017)The popular assignment problem: when cardinality is more important than popularity., , , , и . SODA, стр. 103-123. SIAM, (2022)