The following pages link to Walter Didimo (Q290509):
Displayed 50 items.
- Placing Arrows in Directed Graph Drawings (Q2961503) (← links)
- Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus (Q2971387) (← links)
- Vertex-Coloring with Defects (Q2971395) (← links)
- An Experimental Study on the Ply Number of Straight-Line Drawings (Q2980905) (← links)
- (Q3043705) (← links)
- (Q3043712) (← links)
- (Q3043755) (← links)
- (Q3043759) (← links)
- (Q3043781) (← links)
- Upward Spirality and Upward Planarity Testing (Q3058535) (← links)
- Drawing a Tree as a Minimum Spanning Tree Approximation (Q3060761) (← links)
- CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS (Q3063657) (← links)
- Topology-Driven Force-Directed Algorithms (Q3073669) (← links)
- 2-Layer Right Angle Crossing Drawings (Q3111648) (← links)
- Drawing Graphs with Right Angle Crossings (Q3183456) (← links)
- Monotone Drawings of Graphs with Fixed Embedding (Q3223970) (← links)
- Upward Planarity Testing of Embedded Mixed Graphs (Q3223974) (← links)
- Matched Drawings of Planar Graphs (Q3402369) (← links)
- Visual Analysis of One-To-Many Matched Graphs (Q3402376) (← links)
- Switch-Regular Upward Planar Embeddings of Trees (Q3404429) (← links)
- Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings (Q3557870) (← links)
- Drawing Trees in a Streaming Model (Q3557886) (← links)
- k-Colored Point-Set Embeddability of Outerplanar Graphs (Q3595463) (← links)
- Radial Drawings of Graphs: Geometric Constraints and Trade-Offs (Q3595465) (← links)
- Visual Analysis of One-to-Many Matched Graphs (Q3611847) (← links)
- Constrained Point-Set Embeddability of Planar Graphs (Q3611871) (← links)
- Visualization of the High Level Structure of the Internet with Hermes (Q4405602) (← links)
- (Q4422263) (← links)
- (Q4422272) (← links)
- Upward Embeddings and Orientations of Undirected Planar Graphs (Q4435352) (← links)
- (Q4472302) (← links)
- (Q4501693) (← links)
- Computing orthogonal drawings with the minimum number of bends (Q4571369) (← links)
- An Experimental Study on the Ply Number of Straight-line Drawings (Q4622771) (← links)
- (Q4778568) (← links)
- Drawing database schemas (Q4791031) (← links)
- Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area (Q4899278) (← links)
- Right Angle Crossing Drawings of Graphs (Q5001661) (← links)
- VAIM: Visual Analytics for Influence Maximization (Q5014109) (← links)
- On Turn-Regular Orthogonal Representations (Q5014121) (← links)
- Storyline Visualizations with Ubiquitous Actors (Q5014126) (← links)
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time (Q5014135) (← links)
- On Turn-Regular Orthogonal Representations (Q5049999) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Computing orthogonal drawings with the minimum number of bends (Q5096950) (← links)
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time (Q5146819) (← links)
- h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area (Q5200497) (← links)
- Computing Radial Drawings on the Minimum Number of Circles (Q5301377) (← links)
- Upward Planar Drawings and Switch-regularity Heuristics (Q5301392) (← links)
- k-colored Point-set Embeddability of Outerplanar Graphs (Q5301427) (← links)