( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Planar L-Drawings of Directed Graphs

, , , , , , , и . Computing in Geometry and Topology, 2 (1): 7:1--7:15 (2023)
DOI: 10.57717/cgt.v2i1.43

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.

Marco Patrignani

Maurizio Podda

Maurizio Venturini

Maurizio Zanazzi

Maurizio Serva

 

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

Morphing Planar Graphs Drawings Efficiently., , , и . CoRR, (2013)Drawings of Non-planar Graphs with Crossing-free Subgraphs., , , , , , , и . CoRR, (2013)Drawing database schemas., , , и . Softw. Pract. Exp., 32 (11): 1065-1098 (2002)Visualizing co-phylogenetic reconciliations., , , и . Theor. Comput. Sci., (2020)HV-planarity: Algorithms and complexity., , и . J. Comput. Syst. Sci., (2019)Monotone Drawings of Graphs., , , , и . J. Graph Algorithms Appl., 16 (1): 5-35 (2012)Small Point-Sets Supporting Graph Stories., , , , , , и . J. Graph Algorithms Appl., 27 (8): 651-677 (2023)A meta-algorithm for finding large k-plexes., , , и . Knowl. Inf. Syst., 63 (7): 1745-1769 (2021)Upward Book Embeddability of st-Graphs: Complexity and Algorithms., , , , , и . Algorithmica, 85 (12): 3521-3571 (декабря 2023)How to Morph Planar Graph Drawings., , , , , , , , , и 3 other автор(ы). SIAM J. Comput., 46 (2): 824-852 (2017)