( en | de | ru )

 

Disambiguation of "Da Lozzo, Giordano"

Author of the publication

copydeleteadd this publication to your clipboard
Planar L-Drawings of Directed Graphs

, , , , , , , and . Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17), volume 10692 of Lecture Notes in Computer Science, page 465--478. Springer-Verlag, (2018)
DOI: 10.1007/978-3-319-73915-1_36

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.

Sébastien Giordano

Paolo Giordano

Daniele Giordano

Andrea Giordano

Giordano Paolo

 

Other publications of authors with the same name

2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees., , , , and . CoRR, (2020)On the Complexity of Some Problems Related to SEFE., , and . CoRR, (2013)Simultaneous Orthogonal Planarity, , , , , , , , , and . Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, volume 9801 of Lecture Notes in Computer Science, page 532--545. Springer, (September 2016)Simultaneous Orthogonal Planarity, , , , , , , , , and . Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD'16), 9801, page 532-545. Springer, (2016)On the Complexity of Clustered-Level Planarity and T-Level Planarity., , , , and . CoRR, (2014)Advancements on SEFE and Partitioned Book Embedding problems., , and . Theor. Comput. Sci., (2015)C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width., , , and . Algorithmica, 83 (8): 2471-2502 (2021)Algorithms and Bounds for L-Drawings of Directed Graphs., , , , , , and . Int. J. Found. Comput. Sci., 29 (4): 461-480 (2018)How to Morph a Tree on a Small Grid., , , , , , and . Discret. Comput. Geom., 67 (3): 743-786 (2022)Upward Book Embeddings of st-Graphs., , , , , and . SoCG, volume 129 of LIPIcs, page 13:1-13:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)