The following pages link to Walter Didimo (Q290509):
Displaying 11 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Bounds on the crossing resolution of complete geometric graphs (Q765347) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- Area requirement of graph drawings with few crossings per edge (Q2391538) (← links)
- Book embeddability of series-parallel digraphs (Q2505497) (← links)
- Orthogonal drawings of graphs with vertex and edge labels (Q2573336) (← links)
- Heuristics for the Maximum 2-layer RAC Subgraph Problem (Q2889915) (← links)
- Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area (Q4899278) (← links)
- Computing Radial Drawings on the Minimum Number of Circles (Q5301377) (← links)
- Matched Drawings of Planar Graphs (Q5452222) (← links)
- Graph Drawing (Q5711612) (← links)
