( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Complexity of Anchored Rectangle Packing.

, , , , , , , и . ESA, том 144 из LIPIcs, стр. 8:1-8:14. 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.

Gerhard Nölke

Konrad Nölkensmeier

Stefan Nölker

Klaus Nölker

Margot Nölke

 

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

Robustification of Online Graph Exploration Methods., , , , и . CoRR, (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)On Minimum Generalized Manhattan Connections, , , , , , , и . Proc. 17th Algorithms and Data Structures Symposium (WADS'21), 12808, стр. 85--100. (2021)Robustification of Online Graph Exploration Methods., , , , и . AAAI, стр. 9732-9740. AAAI Press, (2022)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).On Hop-Constrained Steiner Trees in Tree-Like Metrics., , , , и . SIAM J. Discret. Math., 36 (2): 1249-1273 (2022)Online Minimum Cost Matching on the Line with Recourse., и . CoRR, (2020)Speed-robust scheduling: sand, bricks, and rocks., , , , , и . Math. Program., 197 (2): 1009-1048 (февраля 2023)