( en | de | ru )

 

Disambiguation of "Montecchiani, Fabrizio"

Author of the publication

copydeleteadd this publication to your clipboard
A Survey on Graph Drawing Beyond Planarity.

, , and . ACM Comput. Surv., 52 (1): 4:1-4:37 (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.

Fabrizio Catanese

Fabrizio Gabbiani

Fabrizio Gabrielli

Fabrizio Lindner

Fabrizio Arosio

 

Other publications of authors with the same name

Ortho-polygon Visibility Representations of Embedded Graphs., , , , , , and . Algorithmica, 80 (8): 2345-2383 (2018)Simultaneous Visibility Representations of Plane st-graphs Using L-shapes., , and . WG, volume 9224 of Lecture Notes in Computer Science, page 252-265. Springer, (2015)Polyline drawings with topological constraints., , , , and . Theor. Comput. Sci., (2020)A visual analytics system to support tax evasion discovery., , , , and . Decis. Support Syst., (2018)On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper)., , , , and . ICTCS, volume 3587 of CEUR Workshop Proceedings, page 98-103. CEUR-WS.org, (2023)TRART: A system to support territorial policies., , , , and . Intelligent Environments (Workshops), volume 17 of Ambient Intelligence and Smart Environments, page 629-634. IOS Press, (2013)VisFLOWer: Visual analysis of touristic flows., , , , and . IISA, page 1-6. IEEE, (2015)Parameterized Algorithms for Book Embedding Problems., , , and . J. Graph Algorithms Appl., 24 (4): 603-620 (2020)Area requirement of graph drawings with few crossings per edge., , , and . Comput. Geom., 46 (8): 909-916 (2013)Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs., , , , , , , and . Comput. Geom., (2015)