The following pages link to Fabrizio Frati (Q390120):
Displaying 50 items.
- On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph (Q450560) (← links)
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area (Q452455) (← links)
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- A lower bound on the diameter of the flip graph (Q521362) (← links)
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- Colored simultaneous geometric embeddings and universal pointsets (Q548667) (← links)
- Straight-line rectangular drawings of clustered graphs (Q629827) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- Acyclically 3-colorable planar graphs (Q695319) (← links)
- A note on isosceles planar graph drawing (Q763540) (← links)
- Compatible connectivity augmentation of planar disconnected graphs (Q894688) (← links)
- Planar packing of trees and spider trees (Q976102) (← links)
- Small area drawings of outerplanar graphs (Q1024211) (← links)
- Upward straight-line embeddings of directed graphs into point sets (Q1037786) (← links)
- How to draw a clustered tree (Q1044037) (← links)
- On the area requirements of straight-line orthogonal drawings of ternary trees (Q1670991) (← links)
- Pole dancing: 3D morphs for tree drawings (Q1725773) (← links)
- Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours (Q1953438) (← links)
- LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs (Q2009630) (← links)
- On the area requirements of planar greedy drawings of triconnected planar graphs (Q2019489) (← links)
- Every collinear set in a planar graph is free (Q2022612) (← links)
- Planar rectilinear drawings of outerplanar graphs in linear time (Q2123284) (← links)
- From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs (Q2151435) (← links)
- Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
- On the edge-length ratio of planar graphs (Q2206847) (← links)
- Graph stories in small area (Q2206885) (← links)
- On the area requirements of planar straight-line orthogonal drawings of ternary trees (Q2220843) (← links)
- On the number of upward planar orientations of maximal planar graphs (Q2250457) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- On embedding a graph in the grid with the maximum number of bends and other bad features (Q2272195) (← links)
- Beyond level planarity: cyclic, torus, and simultaneous level planarity (Q2283039) (← links)
- On planar greedy drawings of 3-connected planar graphs (Q2283114) (← links)
- Orthogeodesic point-set embedding of trees (Q2391540) (← links)
- The importance of being proper (Q2512653) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q2682927) (← links)
- SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs (Q2811194) (← links)
- Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area (Q2849802) (← links)
- On the Upward Planarity of Mixed Plane Graphs (Q2867638) (← links)
- Strip Planarity Testing (Q2867641) (← links)
- Morphing Planar Graph Drawings Efficiently (Q2867642) (← links)
- SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs (Q2872083) (← links)
- Succinct greedy drawings do not always exist (Q2894243) (← links)
- Multilevel Drawings of Clustered Graphs (Q2914336) (← links)
- The Importance of Being Proper (Q2936931) (← links)
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs (Q2936949) (← links)
- Multilayer Drawings of Clustered Graphs (Q2938755) (← links)
- Intersection-Link Representations of Graphs (Q2959759) (← links)
- Computing NodeTrix Representations of Clustered Graphs (Q2961508) (← links)
- Drawing Planar Graphs with Many Collinear Vertices (Q2961512) (← links)
