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
A Universal Point Set for 2-Outerplanar Graphs.

, , , and . Graph Drawing, volume 9411 of Lecture Notes in Computer Science, page 409-422. Springer, (2015)

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

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)Vertex-Coloring with Star-Defects., , , and . WALCOM, volume 9627 of Lecture Notes in Computer Science, page 40-51. Springer, (2016)Multi-Level Steiner Trees., , , , , , , , , and 1 other author(s). SEA, volume 103 of LIPIcs, page 15:1-15:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)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)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)Simple k-Planar Graphs are Simple (k+1)-Quasiplanar., , , , , , , , , and 1 other author(s). CoRR, (2019)Beyond-Planarity: Density Results for Bipartite Graphs., , , , and . CoRR, (2017)