( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Min-k-planar Drawings of Graphs.

, , , , , , , , , и . GD (1), том 14465 из Lecture Notes in Computer Science, стр. 39-52. Springer, (2023)

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 Valenza

Giuseppe Bosco

 

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

Partial edge drawing: Homogeneity is more important than crossings and ink., , , и . IISA, стр. 1-6. IEEE, (2016)Drawing Directed Acyclic Graphs: An Experimental Study., , , , , , , и . Int. J. Comput. Geom. Appl., 10 (6): 623-648 (2000)Embedding Problems for Paths with Direction Constrained Edges., , , и . COCOON, том 1858 из Lecture Notes in Computer Science, стр. 64-73. Springer, (2000)Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices., , , и . Discret. Comput. Geom., 43 (2): 272-288 (2010)A Distributed Multilevel Force-Directed Algorithm., , , и . IEEE Trans. Parallel Distributed Syst., 30 (4): 754-765 (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)On the Planar Split Thickness of Graphs, , , , , , , , и . Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN'16), том 9644 из Lecture Notes in Computer Science, стр. 403--415. Springer-Verlag, (апреля 2016)A Distributed Force-Directed Algorithm on Giraph: Design and Experiments., , , и . CoRR, (2016)The Planar Slope Number of Subcubic Graphs., , и . LATIN, том 8392 из Lecture Notes in Computer Science, стр. 132-143. Springer, (2014)