The following pages link to Emilio Di Giacomo (Q290520):
Displaying 50 items.
- CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS (Q3063657) (← links)
- Upward Topological Book Embeddings of DAGs (Q3094923) (← links)
- 2-Layer Right Angle Crossing Drawings (Q3111648) (← links)
- Hamiltonian Orthogeodesic Alternating Paths (Q3111649) (← links)
- Orthogeodesic Point-Set Embedding of Trees (Q3223943) (← links)
- Matched Drawings of Planar Graphs (Q3402369) (← links)
- Visual Analysis of One-To-Many Matched Graphs (Q3402376) (← links)
- The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing (Q3404427) (← links)
- Switch-Regular Upward Planar Embeddings of Trees (Q3404429) (← links)
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES (Q3442763) (← links)
- Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings (Q3557870) (← links)
- k-Colored Point-Set Embeddability of Outerplanar Graphs (Q3595463) (← links)
- Radial Drawings of Graphs: Geometric Constraints and Trade-Offs (Q3595465) (← links)
- Drawing Bipartite Graphs on Two Curves (Q3595484) (← links)
- Drawing Colored Graphs on Colored Points (Q3603518) (← links)
- Visual Analysis of One-to-Many Matched Graphs (Q3611847) (← links)
- Constrained Point-Set Embeddability of Planar Graphs (Q3611871) (← links)
- (Q4422270) (← links)
- (Q4422272) (← links)
- An Experimental Study on the Ply Number of Straight-line Drawings (Q4622771) (← links)
- Colored Point-Set Embeddings of Acyclic Graphs (Q4625132) (← links)
- The Approximate Rectangle of Influence Drawability Problem (Q4912195) (← links)
- Storyline Visualizations with Ubiquitous Actors (Q5014126) (← links)
- Packing Trees into 1-planar Graphs (Q5084698) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Polyline Drawings with Topological Constraints (Q5091031) (← links)
- Graph Drawing (Q5193183) (← links)
- Graph Drawing (Q5193185) (← links)
- h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area (Q5200497) (← links)
- (k, p)-Planarity: A Relaxation of Hybrid Planarity (Q5236164) (← links)
- Computing Radial Drawings on the Minimum Number of Circles (Q5301377) (← links)
- k-colored Point-set Embeddability of Outerplanar Graphs (Q5301427) (← links)
- Drawing Bipartite Graphs on Two Parallel Convex Curves (Q5301430) (← links)
- The Planar Slope Number of Subcubic Graphs (Q5405034) (← links)
- Point-Set Embedding of Trees with Edge Constraints (Q5452216) (← links)
- Matched Drawings of Planar Graphs (Q5452222) (← links)
- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge (Q5452234) (← links)
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS (Q5493895) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711522) (← links)
- Graph Drawing (Q5711611) (← links)
- Graph Drawing (Q5711612) (← links)
- Drawing Outer 1-planar Graphs with Few Slopes (Q5892029) (← links)
- Graph Drawing (Q5896910) (← links)
- Graph Drawing (Q5897622) (← links)
- Graph Drawing (Q5897623) (← links)
- Drawing Outer 1-planar Graphs with Few Slopes (Q5899629) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902521) (← links)
- Edge partitions of optimal 2-plane and 3-plane graphs (Q5915586) (← links)
- Universal slope sets for upward planar drawings (Q5915938) (← links)
- Edge partitions of optimal 2-plane and 3-plane graphs (Q5915955) (← links)
