The following pages link to Emilio Di Giacomo (Q290520):
Displaying 50 items.
- Lower and upper bounds for long induced paths in 3-connected planar graphs (Q290522) (← links)
- Drawing a tree as a minimum spanning tree approximation (Q414909) (← links)
- 2-layer right angle crossing drawings (Q476445) (← links)
- Area, curve complexity, and crossing resolution of non-planar graph drawings (Q649108) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- Bounds on the crossing resolution of complete geometric graphs (Q765347) (← links)
- Packing trees into 1-planar graphs (Q782163) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q832866) (← links)
- (Q924085) (redirect page) (← links)
- Point-set embeddings of trees with given partial drawings (Q924086) (← links)
- Radial drawings of graphs: geometric constraints and trade-offs (Q954965) (← links)
- Drawing colored graphs on colored points (Q959802) (← links)
- Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017) (← links)
- Volume requirements of 3D upward drawings (Q1011762) (← links)
- Upward straight-line embeddings of directed graphs into point sets (Q1037786) (← links)
- Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
- 1-page and 2-page drawings with bounded number of crossings per edge (Q1678086) (← links)
- New results on edge partitions of 1-plane graphs (Q1694686) (← links)
- Drawing subcubic planar graphs with four slopes and optimal angular resolution (Q1694729) (← links)
- Hamiltonian orthogeodesic alternating paths (Q1932349) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- A user study on hybrid graph visualizations (Q2151426) (← links)
- Quasi-upward planar drawings with minimum curve complexity (Q2151443) (← links)
- Colored anchored visibility representations in 2D and 3D space (Q2206717) (← links)
- 1-bend upward planar slope number of SP-digraphs (Q2206732) (← links)
- Sketched representations and orthogonal planarity of bounded treewidth graphs (Q2206871) (← links)
- On the curve complexity of 3-colored point-set embeddings (Q2210505) (← links)
- Polyline drawings with topological constraints (Q2290634) (← links)
- NodeTrix planarity testing with small clusters (Q2319629) (← links)
- Fan-planarity: properties and complexity (Q2346379) (← links)
- The approximate rectangle of influence drawability problem (Q2354030) (← links)
- Computing straight-line 3D grid drawings of graphs in linear volume (Q2387202) (← links)
- A note on 3D orthogonal drawings with direction constrained edges (Q2390232) (← links)
- Area requirement of graph drawings with few crossings per edge (Q2391538) (← links)
- Orthogeodesic point-set embedding of trees (Q2391540) (← links)
- \(k\)-spine, 1-bend planarity (Q2503294) (← links)
- Book embeddability of series-parallel digraphs (Q2505497) (← links)
- \((k,p)\)-planarity: a relaxation of hybrid planarity (Q2664946) (← links)
- 1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge (Q2798215) (← links)
- Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs (Q2864303) (← links)
- Switch-Regular Upward Planarity Testing of Directed Trees (Q2865045) (← links)
- Exploring Complex Drawings via Edge Stratification (Q2867667) (← links)
- Heuristics for the Maximum 2-layer RAC Subgraph Problem (Q2889915) (← links)
- Planar and Quasi Planar Simultaneous Geometric Embedding (Q2936913) (← links)
- Fan-Planar Graphs: Combinatorial Properties and Complexity Results (Q2936925) (← links)
- 1-Bend Upward Planar Drawings of SP-Digraphs (Q2961509) (← links)
- An Experimental Study on the Ply Number of Straight-Line Drawings (Q2980905) (← links)
- (Q3043751) (← links)
- Drawing a Tree as a Minimum Spanning Tree Approximation (Q3060761) (← links)
