( en | de | ru )

 

Disambiguation of "Klasing, Ralf"

Author of the publication

copydeleteadd this publication to your clipboard
Hardness and approximation of Gathering in static radio networks.

, , , , and . PerCom Workshops, page 75-79. IEEE Computer Society, (2006)

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. You can also use the button next to the name to display some publications already assigned to the person.

Ralf Klasing

Friedrich Klasing

Hans Klasing

Friederike Klasing

Klaas Klasing

 

Other publications of authors with the same name

Optimal Embedding of Complete Binary Trees into Lines and Grids., , , and . J. Parallel Distributed Comput., 49 (1): 40-56 (1998)Hardness and Approximation of Gathering in Static Radio Networks., , , , and . Parallel Process. Lett., 16 (2): 165-184 (2006)Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017., and . J. Comput. Syst. Sci., (2020)Efficient Exploration of Anonymous Undirected Graphs.. IWOCA, volume 8288 of Lecture Notes in Computer Science, page 7-13. Springer, (2013)Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020., , and . Algorithmica, 84 (10): 3103-3106 (2022)On the distance-edge-monitoring numbers of graphs., , , and . Discret. Appl. Math., (January 2024)Hardness and approximation of Gathering in static radio networks., , , , and . PerCom Workshops, page 75-79. IEEE Computer Society, (2006)The Red-Blue Separation Problem on Graphs., , , , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 285-298. Springer, (2022)The number of spanning trees for Sierpiński graphs and data center networks., , , , and . Inf. Comput., (2024)Algorithms and Complexity for Path Covers of Temporal DAGs., , , and . MFCS, volume 306 of LIPIcs, page 38:1-38:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)