( en | de | ru )

 

Disambiguation of "Lozzo, Giordano Da"

Author of the publication

copydeleteadd this publication to your clipboard
Morphing Contact Representations of Graphs.

, , , , and . SoCG, volume 129 of LIPIcs, page 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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

Andrea Giordano

Daniele Giordano

Giordano Paolo

 

Other publications of authors with the same name

Simultaneous Orthogonal Planarity, , , , , , , , , and . Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD'16), 9801, page 532-545. Springer, (2016)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)On the Complexity of Some Problems Related to SEFE., , and . CoRR, (2013)On the Complexity of Clustered-Level Planarity and T-Level Planarity., , , , and . CoRR, (2014)2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees., , , , and . CoRR, (2020)C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width., , , and . Algorithmica, 83 (8): 2471-2502 (2021)Advancements on SEFE and Partitioned Book Embedding problems., , and . Theor. Comput. Sci., (2015)Algorithms and Bounds for L-Drawings of Directed Graphs., , , , , , and . Int. J. Found. Comput. Sci., 29 (4): 461-480 (2018)On the Upward Book Thickness Problem: Combinatorial and Complexity Results., , , and . GD, volume 12868 of Lecture Notes in Computer Science, page 242-256. Springer, (2021)The Parametrized Complexity of the Segment Number., , , , , and . GD (2), volume 14466 of Lecture Notes in Computer Science, page 97-113. Springer, (2023)