( en | de | ru )

 

Disambiguation of "Smid, Michiel"

Author of the publication

copydeleteadd this publication to your clipboard
On Separating Path and Tree Systems in Graphs.

, , , , , , , , and . CoRR, (2023)

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

Tight Bounds on the Clique Chromatic Number., , , and . Electron. J. Comb., (2021)An instance-based algorithm for deciding the bias of a coin., and . Discret. Math. Algorithms Appl., 15 (3): 2250097:1-2250097:10 (April 2023)Improved Routing on the Delaunay Triangulation., , , , , and . Discret. Comput. Geom., 70 (3): 495-549 (October 2023)Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane., , and . ISAAC, volume 212 of LIPIcs, page 44:1-44:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Shortest Beer Path Queries in Outerplanar Graphs., , and . Algorithmica, 85 (6): 1679-1705 (June 2023)Approximating bottleneck spanning trees on partitioned tuples of points., , and . CoRR, (2021)A simple randomized $O(n n)$-time closest-pair algorithm in doubling metrics., , and . J. Comput. Geom., 11 (1): 507-524 (2020)Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points., , and . Comput. Geom. Topol., 1 (1): 3:1-3:18 (2022)The Minimum Moving Spanning Tree Problem., , , , , , and . WADS, volume 12808 of Lecture Notes in Computer Science, page 15-28. Springer, (2021)The Minimum Moving Spanning Tree Problem., , , , , , and . J. Graph Algorithms Appl., 27 (1): 1-18 (2023)