( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The importance of being proper: (In clustered-level planarity and T-level planarity).

, , , , и . Theor. Comput. Sci., (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.

Sébastien Giordano

Paolo Giordano

Daniele Giordano

Andrea Giordano

Giordano Paolo

 

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

2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees., , , , и . CoRR, (2020)Simultaneous Orthogonal Planarity, , , , , , , , , и . Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, том 9801 из Lecture Notes in Computer Science, стр. 532--545. Springer, (сентября 2016)Simultaneous Orthogonal Planarity, , , , , , , , , и . Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD'16), 9801, стр. 532-545. Springer, (2016)Algorithms and Bounds for L-Drawings of Directed Graphs., , , , , , и . Int. J. Found. Comput. Sci., 29 (4): 461-480 (2018)On Planar Greedy Drawings of 3-Connected Planar Graphs., , и . SoCG, том 77 из LIPIcs, стр. 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Upward Book Embeddings of st-Graphs., , , , , и . SoCG, том 129 из LIPIcs, стр. 13:1-13:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees., , , , и . SODA, стр. 2779-2798. SIAM, (2021)On the Complexity of Some Problems Related to SEFE., , и . CoRR, (2013)On the Complexity of Clustered-Level Planarity and T-Level Planarity., , , , и . CoRR, (2014)How to Morph a Tree on a Small Grid., , , , , , и . Discret. Comput. Geom., 67 (3): 743-786 (2022)