( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Vertex- and Empty-Ply Proximity Drawings

, , , , , , , , , и . Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17), том 10692 из LNCS, стр. 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.

Patrizio Collovà

Gianna Angelini

Patrizio Foresta

Sandra Angelini

Terenzio Angelini

 

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

Universal Slope Sets for 1-Bend Planar Drawings., , , и . CoRR, (2017)On the Complexity of Clustered-Level Planarity and T-Level Planarity., , , , и . CoRR, (2014)On the Complexity of Some Problems Related to SEFE., , и . CoRR, (2013)2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees., , , , и . CoRR, (2020)One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons, , , , и . Proceedings of the 36th European Workshop on Computational Geometry (EuroCG'20), стр. 70:1--70:6. Würzburg, (2020)Abstract.Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity., , , и . J. Graph Algorithms Appl., 24 (4): 573-601 (2020)Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario., , , и . Algorithmica, 85 (9): 2667-2692 (сентября 2023)Monotone Drawings of Graphs with Fixed Embedding., , , , , , и . Algorithmica, 71 (2): 233-257 (2015)Universal Slope Sets for 1-Bend Planar Drawings., , , и . Algorithmica, 81 (6): 2527-2556 (2019)Advancements on SEFE and Partitioned Book Embedding problems., , и . Theor. Comput. Sci., (2015)