The following pages link to Stephen G. Kobourov (Q344819):
Displayed 50 items.
- Graph Drawing via Gradient Descent, $$(GD)^2$$ (Q5014098) (← links)
- Polygons with Prescribed Angles in 2D and 3D (Q5014111) (← links)
- The Turing Test for Graph Drawing Algorithms (Q5014138) (← links)
- Polygons with Prescribed Angles in 2D and 3D (Q5050003) (← links)
- Packing Trees into 1-planar Graphs (Q5084698) (← links)
- Multi-Level Steiner Trees. (Q5140725) (← links)
- The Maximum k-Differential Coloring Problem (Q5175098) (← links)
- Graph Drawing (Q5193173) (← links)
- Graph Drawing (Q5193177) (← links)
- (Q5207877) (← links)
- Simultaneous Embedding of Planar Graphs with Few Bends (Q5301376) (← links)
- Fixed-Location Circular Arc Drawing of Planar Graphs (Q5301408) (← links)
- Morphing Planar Graphs in Spherical Space (Q5301431) (← links)
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets (Q5302049) (← links)
- The geometric thickness of low degree graphs (Q5361688) (← links)
- Smooth Orthogonal Drawings of Planar Graphs (Q5405035) (← links)
- Semantic Word Cloud Representations: Hardness and Approximation Algorithms (Q5405069) (← links)
- Characterization of Unlabeled Level Planar Graphs (Q5452208) (← links)
- Minimum Level Nonplanar Patterns for Trees (Q5452212) (← links)
- Constrained Simultaneous and Near-Simultaneous Embeddings (Q5452230) (← links)
- Graph Drawing Contest Report (Q5452242) (← links)
- DRAWING WITH FAT EDGES (Q5493899) (← links)
- Graph Drawing (Q5711605) (← links)
- Combinatorial and Geometric Properties of Planar Laman Graphs (Q5741829) (← links)
- On Area-Universal Quadrangulations (Q5856667) (← links)
- (Q5874465) (← links)
- (Q5875617) (← links)
- Computing cartograms with optimal complexity (Q5891266) (← links)
- Computing cartograms with optimal complexity (Q5891418) (← links)
- MapSets: Visualizing Embedded and Clustered Graphs (Q5892032) (← links)
- Fitting Planar Graphs on Planar Maps (Q5892055) (← links)
- Lombardi Drawings of Graphs (Q5894096) (← links)
- Lombardi Drawings of Graphs (Q5894484) (← links)
- Proportional Contact Representations of Planar Graphs (Q5894782) (← links)
- Planar Drawings of Higher-Genus Graphs (Q5894994) (← links)
- Fitting Planar Graphs on Planar Maps (Q5895224) (← links)
- Proportional Contact Representations of Planar Graphs (Q5895512) (← links)
- Graph Drawing (Q5896902) (← links)
- Graph Drawing (Q5896917) (← links)
- Graph Drawing (Q5897659) (← links)
- MapSets: Visualizing Embedded and Clustered Graphs (Q5899626) (← links)
- Algorithms and Data Structures (Q5900758) (← links)
- Planar Drawings of Higher-Genus Graphs (Q5900855) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902518) (← links)
- Online facility assignment (Q5915640) (← links)
- Recognition and drawing of stick graphs (Q5915944) (← links)
- Online facility assignment (Q5919330) (← links)
- The segment number: algorithms and universal lower bounds for some classes of planar graphs (Q6039428) (← links)
- Computing β-Stretch Paths in Drawings of Graphs. (Q6059163) (← links)
- Spherical graph drawing by multi-dimensional scaling (Q6117037) (← links)