( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computational Complexity of the α-Ham-Sandwich Problem.

, , и . ICALP, том 168 из LIPIcs, стр. 31:1-31:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

Florian Mulzer

Bernhard Mulzer

Josef Mulzer

Kurt Mulzer

Hanns Mulzer

 

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

Five Proofs of Chernoff's Bound with Applications.. CoRR, (2018)Memory-Constrained Algorithms for Simple Polygons, , , , , , и . CoRR, (2011)Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees., , и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 108-119. Springer, (2018)An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings., , , , и . ISAAC, том 9472 из Lecture Notes in Computer Science, стр. 505-516. Springer, (2015)Routing in polygonal domains., , , , , , , , , и . Comput. Geom., (2020)Dynamic Connectivity in Disk Graphs., , , , , , и . CoRR, (2021)Unique Sink Orientations of Grids is in Unique End of Potential Line., и . CoRR, (2022)Asymmetric Convex Intersection Testing., и . SOSA, том 69 из OASIcs, стр. 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)No-Dimensional Tverberg Theorems and Algorithms., и . SoCG, том 164 из LIPIcs, стр. 31:1-31:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors., и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 683-696. Springer, (2018)