The following pages link to Walter Didimo (Q290509):
Displayed 50 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Drawing a tree as a minimum spanning tree approximation (Q414909) (← links)
- Drawing trees in a streaming model (Q436551) (← links)
- Vertex angle and crossing angle resolution of leveled tree drawings (Q456065) (← 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)
- Drawing graphs with right angle crossings (Q719252) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- Bounds on the crossing resolution of complete geometric graphs (Q765347) (← links)
- A characterization of complete bipartite RAC graphs (Q765516) (← links)
- An experimental study of a 1-planarity testing and embedding algorithm (Q782206) (← links)
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis (Q903597) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- Point-set embeddings of trees with given partial drawings (Q924086) (← links)
- Maximum upward planar subgraphs of embedded planar digraphs (Q945947) (← links)
- Radial drawings of graphs: geometric constraints and trade-offs (Q954965) (← links)
- Upward straight-line embeddings of directed graphs into point sets (Q1037786) (← links)
- (Q1348946) (redirect page) (← links)
- Quasi-upward planarity (Q1348947) (← links)
- Turn-regularity and optimal area drawings of orthogonal representations (Q1567307) (← links)
- HV-planarity: algorithms and complexity (Q1628786) (← links)
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs (Q1687902) (← links)
- New results on edge partitions of 1-plane graphs (Q1694686) (← links)
- Bend-minimum orthogonal drawings in quadratic time (Q1725783) (← links)
- Density of straight-line 1-planar graph drawings (Q1943644) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- A user study on hybrid graph visualizations (Q2151426) (← links)
- ChordLink: a new hybrid visualization model (Q2206859) (← links)
- Planar drawings of fixed-mobile bigraphs (Q2330125) (← links)
- Fan-planarity: properties and complexity (Q2346379) (← links)
- Monotone drawings of graphs with fixed embedding (Q2346955) (← links)
- Area requirement of graph drawings with few crossings per edge (Q2391538) (← links)
- On RAC drawings of 1-planar graphs (Q2402260) (← links)
- Upward and quasi-upward planarity testing of embedded mixed graphs (Q2437763) (← links)
- \(k\)-spine, 1-bend planarity (Q2503294) (← links)
- Book embeddability of series-parallel digraphs (Q2505497) (← links)
- Orthogonal drawings of graphs with vertex and edge labels (Q2573336) (← links)
- The Crossing-Angle Resolution in Graph Drawing (Q2849803) (← links)
- Switch-Regular Upward Planarity Testing of Directed Trees (Q2865045) (← links)
- Drawing Non-Planar Graphs with Crossing-Free Subgraphs (Q2867666) (← 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)
- On the Complexity of HV-rectilinear Planarity Testing (Q2936940) (← links)
- A Million Edge Drawing for a Fistful of Dollars (Q2959741) (← links)
- Kojaph: Visual Definition and Exploration of Patterns in Graph Databases (Q2959763) (← links)
- 2-Layer Fan-Planarity: From Caterpillar to Stegosaurus (Q2959764) (← links)
- A Distributed Multilevel Force-Directed Algorithm (Q2961498) (← links)