( en | de | ru )

 

Disambiguation of "Liotta, Giuseppe"

Author of the publication

copydeleteadd this publication to your clipboard
How many vertex locations can be arbitrarily chosen when drawing planar graphs?

, , and . CoRR, (2012)

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. You can also use the button next to the name to display some publications already assigned to the person.

Agustin Liotta

Giuseppe Olivato

Giuseppe Veltri

Giuseppe Valenza

Giuseppe Bosco

 

Other publications of authors with the same name

Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices., , , and . Discret. Comput. Geom., 43 (2): 272-288 (2010)Embedding Problems for Paths with Direction Constrained Edges., , , and . COCOON, volume 1858 of Lecture Notes in Computer Science, page 64-73. Springer, (2000)Drawing Directed Acyclic Graphs: An Experimental Study., , , , , , , and . Int. J. Comput. Geom. Appl., 10 (6): 623-648 (2000)Partial edge drawing: Homogeneity is more important than crossings and ink., , , and . IISA, page 1-6. IEEE, (2016)A Distributed Multilevel Force-Directed Algorithm., , , and . IEEE Trans. Parallel Distributed Syst., 30 (4): 754-765 (2019)A Distributed Force-Directed Algorithm on Giraph: Design and Experiments., , , and . CoRR, (2016)On the Planar Split Thickness of Graphs, , , , , , , , and . Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN'16), volume 9644 of Lecture Notes in Computer Science, page 403--415. Springer-Verlag, (April 2016)On Partitioning the Edges of 1-Planar Graphs., , and . CoRR, (2015)Drawing Partial 2-Trees with Few Slopes., , , and . Algorithmica, 85 (5): 1156-1175 (May 2023)Optimal and suboptimal robust algorithms for proximity graphs., , and . Comput. Geom., 25 (1-2): 35-49 (2003)