PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Angelini, Patrizio"

Author of the publication

copydeleteadd this publication to your clipboard
The Importance of Being Proper - (In Clustered-Level Planarity and T-Level Planarity).

, , , , and . Graph Drawing, volume 8871 of Lecture Notes in Computer Science, page 246-258. Springer, (2014)

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.

No persons found for author name Angelini, Patrizio
add a person with the name Angelini, Patrizio
 

Other publications of authors with the same name

An Algorithm to Construct Greedy Drawings of Triangulations., , and . J. Graph Algorithms Appl., 14 (1): 19-51 (2010)Vertex-Coloring with Defects., , , , , , , , , and . J. Graph Algorithms Appl., 21 (3): 313-340 (2017)1-Fan-bundle-planar drawings of graphs., , , , and . Theor. Comput. Sci., (2018)The importance of being proper: (In clustered-level planarity and T-level planarity)., , , , and . Theor. Comput. Sci., (2015)Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph., , , , and . J. Discrete Algorithms, (2012)Simple k-Planar Graphs are Simple (k+1)-Quasiplanar., , , , , , , , , and 1 other author(s). CoRR, (2019)Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time., , and . Algorithmica, 60 (4): 890-937 (2011)On the area requirements of Euclidean minimum spanning trees., , , , , and . Comput. Geom., 47 (2): 200-213 (2014)Splitting Clusters to Get C-Planarity., , and . Graph Drawing, volume 5849 of Lecture Notes in Computer Science, page 57-68. Springer, (2009)Greedy Rectilinear Drawings., , , , , , , , and . Graph Drawing, volume 11282 of Lecture Notes in Computer Science, page 495-508. Springer, (2018)