( en | de | ru )

 

Disambiguation of "Angelini, Patrizio"

Author of the publication

copydeleteadd this publication to your clipboard
On Vertex- and Empty-Ply Proximity Drawings

, , , , , , , , , and . Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17), volume 10692 of LNCS, page 24--37. Cham, Springer International Publishing, (2017)
DOI: 10.1007/978-3-319-73915-1_3

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.

Patrizio Collovà

Gianna Angelini

Patrizio Foresta

Sandra Angelini

Terenzio Angelini

 

Other publications of authors with the same name

Fan-Bundle-Planar Drawings of Graphs, , , , and . Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD'16), volume 9801 of Lecture Notes in Computer Science, page 634--636. Springer-Verlag, (September 2016)Poster.Splitting Clusters to Get C-Planarity., , and . GD, volume 5849 of Lecture Notes in Computer Science, page 57-68. Springer, (2009)On Morphing 1-Planar Drawings., , , and . WG, volume 12911 of Lecture Notes in Computer Science, page 270-282. Springer, (2021)Graph Planarity by Replacing Cliques with Paths., , , , , , , and . Algorithms, 13 (8): 194 (2020)An Algorithm to Construct Greedy Drawings of Triangulations., , and . J. Graph Algorithms Appl., 14 (1): 19-51 (2010)Extending Partial Orthogonal Drawings., , and . GD, volume 12590 of Lecture Notes in Computer Science, page 265-278. Springer, (2020)Extending Partial Orthogonal Drawings., , and . J. Graph Algorithms Appl., 25 (1): 581-602 (2021)Simple k-planar graphs are simple (k + 1)-quasiplanar., , , , , , , , , and 1 other author(s). J. Comb. Theory B, (2020)On Upward-Planar L-Drawings of Graphs., , , and . MFCS, volume 241 of LIPIcs, page 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Morphing Contact Representations of Graphs., , , , and . SoCG, volume 129 of LIPIcs, page 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)