default search action
Fabrizio Frati
- > Home > Persons > Fabrizio Frati
Publications
- 2024
- [j68]Fabrizio Frati:
Upward planarity testing of biconnected outerplanar DAGs solves partition. Theor. Comput. Sci. 998: 114541 (2024) - 2023
- [i47]Fabrizio Frati:
Upward Planarity Testing of Biconnected Outerplanar DAGs Solves Partition. CoRR abs/2307.13799 (2023) - 2022
- [j64]Fabrizio Frati:
Planar rectilinear drawings of outerplanar graphs in linear time. Comput. Geom. 103: 101854 (2022) - 2020
- [c76]Fabrizio Frati:
Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time. GD 2020: 423-435 - [i36]Fabrizio Frati:
Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time. CoRR abs/2006.06951 (2020) - 2017
- [j43]Fabrizio Frati:
A Lower Bound on the Diameter of the Flip Graph. Electron. J. Comb. 24(1): 1 (2017) - 2016
- [r1]Fabrizio Frati:
Clustered Graph Drawing. Encyclopedia of Algorithms 2016: 326-331 - 2015
- [i17]Fabrizio Frati:
A Lower Bound on the Diameter of the Flip Graph. CoRR abs/1508.03473 (2015) - 2014
- [j29]Fabrizio Frati:
Multilayer Drawings of Clustered Graphs. J. Graph Algorithms Appl. 18(5): 633-675 (2014) - 2012
- [j22]Fabrizio Frati:
Straight-line drawings of outerplanar graphs in O(dn log n) area. Comput. Geom. 45(9): 524-533 (2012) - [c42]Fabrizio Frati:
Multilevel Drawings of Clustered Graphs. COCOON 2012: 311-322 - 2010
- [j11]Fabrizio Frati:
Lower Bounds on the Area Requirements of Series-Parallel Graphs. Discret. Math. Theor. Comput. Sci. 12(5): 139-174 (2010) - [j10]Fabrizio Frati:
A note on isosceles planar graph drawing. Inf. Process. Lett. 110(12-13): 507-509 (2010) - [c29]Fabrizio Frati:
Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs. GD 2010: 220-225 - 2009
- [c23]Fabrizio Frati:
Planar Packing of Diameter-Four Trees. CCCG 2009: 95-98 - 2008
- [j2]Fabrizio Frati:
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. Int. J. Comput. Geom. Appl. 18(3): 251-271 (2008) - [c15]Fabrizio Frati:
A Lower Bound on the Area Requirements of Series-Parallel Graphs. WG 2008: 159-170 - 2007
- [c14]Fabrizio Frati:
Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area. CCCG 2007: 225-228 - [c11]Fabrizio Frati:
Straight-Line Orthogonal Drawings of Binary and Ternary Trees. GD 2007: 76-87 - [c5]Fabrizio Frati:
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. WG 2007: 133-144 - 2006
- [c2]Fabrizio Frati:
Embedding Graphs Simultaneously with Fixed Edges. GD 2006: 108-113
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint