The following pages link to Christian A. Duncan (Q621922):
Displaying 37 items.
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- (Q857058) (redirect page) (← links)
- On simultaneous planar graph embeddings (Q857060) (← links)
- Planarity-preserving clustering and embedding for large planar graphs (Q1869744) (← links)
- Tight bounds on maximal and maximum matchings (Q1877645) (← links)
- Drawing trees with perfect angular resolution and polynomial area (Q1943652) (← links)
- Optimal polygonal representation of planar graphs (Q2429359) (← links)
- Balanced aspect ratio trees: Combining the advantages of \(k\)-\(d\) trees and octrees (Q2709802) (← links)
- (Q2753934) (← links)
- Optimal constrained graph exploration (Q2768385) (← links)
- Optimal constrained graph exploration (Q2944522) (← links)
- Maximizing the Degree of (Geometric) Thickness-t Regular Graphs (Q2959757) (← links)
- (Q3043714) (← links)
- (Q3043745) (← links)
- Drawing Trees with Perfect Angular Resolution and Polynomial Area (Q3073671) (← links)
- Planar and Poly-arc Lombardi Drawings (Q3223963) (← links)
- Graph-Drawing Contest Report (Q3595498) (← links)
- (Q4252301) (← links)
- (Q4474098) (← links)
- (Q4501704) (← links)
- Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs (Q4511264) (← links)
- (Q4643853) (← links)
- Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution (Q4679072) (← links)
- Efficient perspective-accurate silhouette computation and applications (Q5361560) (← links)
- The geometric thickness of low degree graphs (Q5361688) (← links)
- Graph Drawing Contest Report (Q5452242) (← links)
- DRAWING WITH FAT EDGES (Q5493899) (← links)
- (Q5501788) (← links)
- Lombardi Drawings of Graphs (Q5894096) (← links)
- Lombardi Drawings of Graphs (Q5894484) (← links)
- Planar Drawings of Higher-Genus Graphs (Q5894994) (← links)
- Graph Drawing (Q5897659) (← links)
- Algorithms and Data Structures (Q5900756) (← links)
- Algorithms and Data Structures (Q5900758) (← links)
- Planar Drawings of Higher-Genus Graphs (Q5900855) (← links)
- On the flattest common supersequence method for deadlock-free routing in arbitrary networks (Q5929025) (← links)
- Drawing planar graphs with circular arcs (Q5944937) (← links)
