( en | de | ru )

 

Disambiguation of "Smid, Michiel H. M."

Author of the publication

copydeleteadd this publication to your clipboard
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts.

, , , and . SWAT, volume 53 of LIPIcs, page 27:1-27:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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.

Thomas Smid

Menno Smid

Stefan Smid

Michiel Morshuis

Michiel Kwantes

 

Other publications of authors with the same name

A Technique for Adding Range Restrictions to Generalized Searching Problems., , and . Inf. Process. Lett., 64 (5): 263-269 (1997)Computing the Smallest T-Shaped Polygon Containing k Points., and . Int. J. Comput. Math., 79 (2): 143-156 (2002)Communication-Efficient Construction of the Plane Localized Delaunay Graph, , , and . CoRR, (2008)Spanners of Complete $k$-Partite Geometric Graphs, , , , , and . CoRR, (2007)Computing the Greedy Spanner in Near-Quadratic Time., , , , and . Algorithmica, 58 (3): 711-729 (2010)The discrete Voronoi game in a simple polygon., , , and . Theor. Comput. Sci., (2019)On the Minimum Consistent Subset Problem., , , , , , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 155-167. Springer, (2019)Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles., , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 283-295. Springer, (2019)Communication-Efficient Construction of the Plane Localized Delaunay Graph., , , and . LATIN, volume 6034 of Lecture Notes in Computer Science, page 282-293. Springer, (2010)Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity., and . SWAT, volume 621 of Lecture Notes in Computer Science, page 388-398. Springer, (1992)