The following pages link to Emilio Di Giacomo (Q290520):
Displaying 10 items.
- Bounds on the crossing resolution of complete geometric graphs (Q765347) (← links)
- Computing straight-line 3D grid drawings of graphs in linear volume (Q2387202) (← links)
- Area requirement of graph drawings with few crossings per edge (Q2391538) (← links)
- Book embeddability of series-parallel digraphs (Q2505497) (← links)
- Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs (Q2864303) (← links)
- Heuristics for the Maximum 2-layer RAC Subgraph Problem (Q2889915) (← links)
- Computing Radial Drawings on the Minimum Number of Circles (Q5301377) (← links)
- Matched Drawings of Planar Graphs (Q5452222) (← links)
- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge (Q5452234) (← links)
- Graph Drawing (Q5711612) (← links)
