( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Dilation-Optimal Edge Deletion in Polygonal Cycles.

, , , , и . ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 88-99. Springer, (2007)

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)Packing Plane Perfect Matchings into a Point Set., , , и . Discret. Math. Theor. Comput. Sci., 17 (2): 119-142 (2015)On plane geometric spanners: A survey and open problems., и . Comput. Geom., 46 (7): 818-830 (2013)Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem. Inf. Comput., 116 (1): 1-9 (января 1995)Spanners of Complete $k$-Partite Geometric Graphs, , , , , и . CoRR, (2007)Communication-Efficient Construction of the Plane Localized Delaunay Graph, , , и . CoRR, (2008)Computing the Smallest T-Shaped Polygon Containing k Points., и . Int. J. Comput. Math., 79 (2): 143-156 (2002)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)