PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Klasing, Ralf"

Author of the publication

copydeleteadd this publication to your clipboard
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs.

, , , and . ESA, volume 726 of Lecture Notes in Computer Science, page 200-211. Springer, (1993)

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.

Dr. Ralf Finger University of Stuttgart

Ralf Eisinger University of Stuttgart

Ralf Sauerwald University of Stuttgart

Ralf Rettich University of Stuttgart

Dr. Ralf Klemt University of Stuttgart

 

Other publications of authors with the same name

On the size of identifying codes in triangle-free graphs., , , and . Discrete Applied Mathematics, 160 (10-11): 1532-1546 (2012)Effective Systolic Algorithms for Gossiping in Cycles., , , , and . Parallel Processing Letters, 8 (2): 197-205 (1998)Hardness and Approximation of Gathering in Static Radio Networks., , , , and . Parallel Processing Letters, 16 (2): 165-184 (2006)Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs., , , and . ESA, volume 726 of Lecture Notes in Computer Science, page 200-211. Springer, (1993)Efficiently Testing T -Interval Connectivity in Dynamic Graphs., , , and . CIAC, volume 9079 of Lecture Notes in Computer Science, page 89-100. Springer, (2015)Efficient Exploration of Anonymous Undirected Graphs.. IWOCA, volume 8288 of Lecture Notes in Computer Science, page 7-13. Springer, (2013)Computing Parameters of Sequence-Based Dynamic Graphs., , , and . Theory Comput. Syst., 63 (3): 394-417 (2019)Optimal Embedding of Complete Binary Trees into Lines and Grids., , , and . J. Parallel Distrib. Comput., 49 (1): 40-56 (1998)From Balls and Bins to Points and Vertices., , , and . Algorithmic Operations Research, 4 (2): 133-143 (2009)Hardness and approximation of Gathering in static radio networks., , , , and . PerCom Workshops, page 75-79. IEEE Computer Society, (2006)