( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Finding the best shortcut in a geometric network.

, , и . SCG, стр. 327-335. ACM, (2005)

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.

Gerhard Gudmundsson

Gerhard Gudmundsson

Gerhard Gudmundsson

Gerhard Gudmundsson

Gudmundur Olafs Gudmundsson

 

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

On the Expected Maximum Degree of Gabriel and Yao Graphs, , и . CoRR, (2009)Approximate distance oracles for geometric graphs., , , и . SODA, стр. 828-837. ACM/SIAM, (2002)On beta-Plurality Points in Spatial Voting Games., , , и . CoRR, (2020)Computing longest duration flocks in trajectory data., и . GIS, стр. 35-42. ACM, (2006)Restricted Mesh Simplification Using Edge Contractions., , и . COCOON, том 4112 из Lecture Notes in Computer Science, стр. 196-204. Springer, (2006)Constructing Plane Spanners of Bounded Degree and Low Weight., , и . ESA, том 2461 из Lecture Notes in Computer Science, стр. 234-246. Springer, (2002)Experimental Study of Geometric t-Spanners: A Running Time Comparison., и . WEA, том 4525 из Lecture Notes in Computer Science, стр. 270-284. Springer, (2007)A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract)., и . FCT, том 1279 из Lecture Notes in Computer Science, стр. 305-316. Springer, (1997)Planar Geometric Spanners., , и . Encyclopedia of Algorithms, (2016)10491 Results of the break-out group: Similarity measures., , , , и . Representation, Analysis and Visualization of Moving Objects, том 10491 из Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)