( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Exact Geometric Computation in LEDA.

, , , , , и . Symposium on Computational Geometry, стр. C18-C19. ACM, (1995)

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.

Stefan Näher

Armin Näher

Helmut Näher

Karl Näher

Gotthilf Näher

 

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

Certifying algorithms., , , и . Comput. Sci. Rev., 5 (2): 119-161 (2011)Das Travelling Salesman Problem.. Taschenbuch der Algorithmen, Springer, (2008)Design and Implementation of Efficient Data Types for Static Graphs., и . ESA, том 2461 из Lecture Notes in Computer Science, стр. 748-759. Springer, (2002)Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space., и . Inf. Process. Lett., 35 (4): 183-189 (1990)Two computational geometry libraries: LEDA and CGAL., и . Handbook of Discrete and Computational Geometry, 2nd Ed., Chapman and Hall/CRC, (2004)Two computational geometry librarie., и . Handbook of Discrete and Computational Geometry, 2nd Ed., Chapman and Hall/CRC, (2004)Dynamic Fractional Cascading., и . Algorithmica, 5 (2): 215-241 (1990)AGD-Library: A Library of Algorithms for Graph Drawing., , , и . WAE, стр. 112-123. Università Ca' Foscari di Venezia, (1997)A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem., и . CCCG, (2008)A faster compaction algorithm with automatic jog insertion., и . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 9 (2): 158-166 (1990)