( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees.

, , , , и . CoRR, (2020)

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

 

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

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