( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract).

, , , , , и . SCG, стр. 306-315. 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.

Agustin Liotta

Giuseppe Olivato

Giuseppe Veltri

Giuseppe Amato

Giuseppe Valenza

 

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

Drawing a tree as a minimum spanning tree approximation, , , и . Journal of Computer and System Sciences, 78 (2): 491--503 (2012)Visual querying and analysis of temporal fiscal networks., , , , и . Inf. Sci., (2019)A Survey on Graph Drawing Beyond Planarity., , и . ACM Comput. Surv., 52 (1): 4:1-4:37 (2019)Optimal and suboptimal robust algorithms for proximity graphs., , и . Comput. Geom., 25 (1-2): 35-49 (2003)Drawing Partial 2-Trees with Few Slopes., , , и . Algorithmica, 85 (5): 1156-1175 (мая 2023)Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices., , , и . Discret. Comput. Geom., 43 (2): 272-288 (2010)Embedding Problems for Paths with Direction Constrained Edges., , , и . COCOON, том 1858 из Lecture Notes in Computer Science, стр. 64-73. Springer, (2000)Drawing Directed Acyclic Graphs: An Experimental Study., , , , , , , и . Int. J. Comput. Geom. Appl., 10 (6): 623-648 (2000)A Distributed Multilevel Force-Directed Algorithm., , , и . IEEE Trans. Parallel Distributed Syst., 30 (4): 754-765 (2019)Partial edge drawing: Homogeneity is more important than crossings and ink., , , и . IISA, стр. 1-6. IEEE, (2016)