( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Online Multi-Commodity Facility Location Problem.

, , , , и . SPAA, стр. 129-139. ACM, (2020)

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.

Mathias Knollmann

Jens Knollmann

Eirch Knollmann

Rolf Knollmann

Volker Knollmann

 

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

The Online Multi-Commodity Facility Location Problem., , , , и . SPAA, стр. 129-139. ACM, (2020)A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility., , , , , и . OPODIS, том 253 из LIPIcs, стр. 15:1-15:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation., , , , и . Theor. Comput. Sci., (2023)Monitoring of Domain-Related Problems in Distributed Data Streams., , , , , , , , , и 3 other автор(ы). SIROCCO, том 10641 из Lecture Notes in Computer Science, стр. 212-226. Springer, (2017)Distributed Data Streams., , , , , и . Algorithms for Big Data, том 13201 из Lecture Notes in Computer Science, Springer, (2022)Managing Multiple Mobile Resources., , , и . WAOA, том 11926 из Lecture Notes in Computer Science, стр. 120-137. Springer, (2019)Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented and Luminous Robots with Limited Visibility., , , , и . SSS, том 12514 из Lecture Notes in Computer Science, стр. 60-64. Springer, (2020)A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension., , , , и . ALGOCLOUD, том 11409 из Lecture Notes in Computer Science, стр. 46-58. Springer, (2018)Online algorithms for allocating heterogeneous resources.. University of Paderborn, Germany, (2023)Gathering a Euclidean Closed Chain of Robots in Linear Time., , , , и . ALGOSENSORS, том 12961 из Lecture Notes in Computer Science, стр. 29-44. Springer, (2021)