( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks.

, , , , и . Graphs and Algorithms in Communication Networks, Springer, (2010)

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.

Ralf Klasing

Friedrich Klasing

Hans Klasing

Friederike Klasing

Klaas Klasing

 

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

Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017., и . J. Comput. Syst. Sci., (2020)Computing Parameters of Sequence-Based Dynamic Graphs., , , и . Theory Comput. Syst., 63 (3): 394-417 (2019)Efficient Exploration of Anonymous Undirected Graphs.. IWOCA, том 8288 из Lecture Notes in Computer Science, стр. 7-13. Springer, (2013)Optimal Embedding of Complete Binary Trees into Lines and Grids., , , и . J. Parallel Distributed Comput., 49 (1): 40-56 (1998)From Balls and Bins to Points and Vertices., , , и . Algorithmic Oper. Res., 4 (2): 133-143 (2009)On the distance-edge-monitoring numbers of graphs., , , и . Discret. Appl. Math., (января 2024)Hardness and Approximation of Gathering in Static Radio Networks., , , , и . Parallel Process. Lett., 16 (2): 165-184 (2006)Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality., , , , , , и . J. Comput. Syst. Sci., (2018)Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020., , и . Algorithmica, 84 (10): 3103-3106 (2022)A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks., , , , и . J. Parallel Distributed Comput., (ноября 2023)