( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Stabbing Pairwise Intersecting Disks by Five Points.

, , , , , , и . ISAAC, том 123 из LIPIcs, стр. 50:1-50:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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.

Kurt Mulzer

Josef Mulzer

Florian Mulzer

Bernhard Mulzer

Hanns Mulzer

 

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

Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications., , , , и . Discret. Comput. Geom., 64 (3): 838-904 (2020)Computing the Fréchet Distance with a Retractable Leash., , , , и . Discret. Comput. Geom., 56 (2): 315-336 (2016)Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead., , , и . ACM Trans. Algorithms, 18 (3): 26:1-26:27 (2022)On the Stretch Factor of Polygonal Chains., , , и . SIAM J. Discret. Math., 35 (3): 1592-1614 (2021)A Static Optimality Transformation with Applications to Planar Point Location, и . CoRR, (2011)Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees., , и . CoRR, (2017)Computational Geometry Column 67., , и . SIGACT News, 49 (2): 77-94 (2018)On the Stretch Factor of Polygonal Chains., , , и . MFCS, том 138 из LIPIcs, стр. 56:1-56:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Routing in Histograms., , , , , , , и . CoRR, (2019)Maximum Matchings in Geometric Intersection Graphs., , и . STACS, том 154 из LIPIcs, стр. 31:1-31:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)