( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Speed-robust scheduling: sand, bricks, and rocks.

, , , , , и . Math. Program., 197 (2): 1009-1048 (февраля 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.

Gerhard Nölke

Konrad Nölkensmeier

Stefan Nölker

Klaus Nölker

Margot Nölke

 

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

Robustification of Online Graph Exploration Methods., , , , и . AAAI, стр. 9732-9740. AAAI Press, (2022)On Minimum Generalized Manhattan Connections, , , , , , , и . Proc. 17th Algorithms and Data Structures Symposium (WADS'21), 12808, стр. 85--100. (2021)Matching and packing problems - optimization under uncertainty in theory and practice. Bremen University, Germany, (2023)base-search.net (ftsubbremen:oai:media.suub.uni-bremen.de:Publications/elib/6748).Speed-robust scheduling: sand, bricks, and rocks., , , , , и . Math. Program., 197 (2): 1009-1048 (февраля 2023)On Minimum Generalized Manhattan Connections., , , , , , , и . WADS, том 12808 из Lecture Notes in Computer Science, стр. 85-100. Springer, (2021)Speed-Robust Scheduling - Sand, Bricks, and Rocks., , , , , и . IPCO, том 12707 из Lecture Notes in Computer Science, стр. 283-296. Springer, (2021)Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time., , , , и . FSTTCS, том 213 из LIPIcs, стр. 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics., , , , и . MFCS, том 170 из LIPIcs, стр. 18:1-18:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Speed-Robust Scheduling., , , , , и . CoRR, (2020)Online Minimum Cost Matching with Recourse on the Line., и . APPROX-RANDOM, том 176 из LIPIcs, стр. 37:1-37:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)