( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Farthest-Point Information in Networks.

, , , , и . CCCG, стр. 199-204. (2012)

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.

Thomas Smid

Menno Smid

Stefan Smid

Michiel Morshuis

Michiel Kwantes

 

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

A Technique for Adding Range Restrictions to Generalized Searching Problems., , и . Inf. Process. Lett., 64 (5): 263-269 (1997)Communication-Efficient Construction of the Plane Localized Delaunay Graph, , , и . CoRR, (2008)Spanners of Complete $k$-Partite Geometric Graphs, , , , , и . CoRR, (2007)Computing the Smallest T-Shaped Polygon Containing k Points., и . Int. J. Comput. Math., 79 (2): 143-156 (2002)Computing the Greedy Spanner in Near-Quadratic Time., , , , и . Algorithmica, 58 (3): 711-729 (2010)Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity., и . SWAT, том 621 из Lecture Notes in Computer Science, стр. 388-398. Springer, (1992)A Facility Coloring Problem in 1-D., , , и . AAIM, том 8546 из Lecture Notes in Computer Science, стр. 88-99. Springer, (2014)Communication-Efficient Construction of the Plane Localized Delaunay Graph., , , и . LATIN, том 6034 из Lecture Notes in Computer Science, стр. 282-293. Springer, (2010)Computing Covers of Plane Forests., , , и . CCCG, Carleton University, Ottawa, Canada, (2013)The discrete Voronoi game in a simple polygon., , , и . Theor. Comput. Sci., (2019)