( en | de | ru )

 

Disambiguation

Author of the publication

copydeleteadd this publication to your clipboard
The Minimum Moving Spanning Tree Problem.

, , , , , , and . WADS, volume 12808 of Lecture Notes in Computer Science, page 15-28. Springer, (2021)

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)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)An Instance-Based Algorithm for Deciding the Bias of a Coin., and . CoRR, (2020)Euclidean Maximum Matchings in the Plane - Local to Global., , and . WADS, volume 12808 of Lecture Notes in Computer Science, page 186-199. Springer, (2021)Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares., and . CCCG, page 206-213. (2020)Shortest Beer Path Queries in Outerplanar Graphs., , and . ISAAC, volume 212 of LIPIcs, page 62:1-62:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Geometric Covering via Extraction Theorem., , , , and . ITCS, volume 287 of LIPIcs, page 7:1-7:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)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)Covering Points with Pairs of Concentric Disks., , , and . CCCG, page 33-38. (2020)